/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:48:24,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:48:24,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:48:24,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:48:24,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:48:24,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:48:24,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:48:24,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:48:24,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:48:24,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:48:24,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:48:24,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:48:24,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:48:24,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:48:24,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:48:24,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:48:24,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:48:24,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:48:24,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:48:24,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:48:24,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:48:24,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:48:24,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:48:24,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:48:24,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:48:24,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:48:24,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:48:24,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:48:24,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:48:24,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:48:24,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:48:24,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:48:24,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:48:24,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:48:24,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:48:24,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:48:24,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:48:24,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:48:24,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:48:24,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:48:24,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:48:24,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:48:24,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:48:24,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:48:24,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:48:24,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:48:24,413 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:48:24,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:48:24,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:48:24,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:48:24,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:48:24,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:48:24,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:48:24,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:48:24,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:48:24,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:48:24,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:48:24,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:48:24,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:48:24,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:48:24,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:48:24,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:48:24,417 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:48:24,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:48:24,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:48:24,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:48:24,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:48:24,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:48:24,679 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:48:24,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-06 07:48:25,539 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:48:25,688 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:48:25,688 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-06 07:48:25,701 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d4e6338/65c47dcce5b54dbbbfaef181fbf6d653/FLAG0b5c42017 [2022-12-06 07:48:26,120 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d4e6338/65c47dcce5b54dbbbfaef181fbf6d653 [2022-12-06 07:48:26,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:48:26,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:48:26,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:48:26,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:48:26,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:48:26,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d63c0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26, skipping insertion in model container [2022-12-06 07:48:26,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:48:26,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:48:26,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:48:26,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:48:26,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:48:26,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:48:26,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:48:26,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:48:26,305 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-queue-add-2.wvr.c[2696,2709] [2022-12-06 07:48:26,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:48:26,324 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:48:26,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:48:26,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:48:26,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:48:26,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:48:26,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:48:26,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:48:26,356 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-queue-add-2.wvr.c[2696,2709] [2022-12-06 07:48:26,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:48:26,377 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:48:26,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26 WrapperNode [2022-12-06 07:48:26,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:48:26,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:48:26,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:48:26,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:48:26,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,421 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2022-12-06 07:48:26,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:48:26,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:48:26,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:48:26,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:48:26,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:48:26,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:48:26,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:48:26,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:48:26,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (1/1) ... [2022-12-06 07:48:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:48:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:26,509 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 07:48:26,516 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 07:48:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:48:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:48:26,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:48:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:48:26,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:48:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:48:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:48:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:48:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:48:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:48:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:48:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:48:26,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:48:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:48:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:48:26,542 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 07:48:26,633 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:48:26,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:48:26,854 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:48:26,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:48:26,914 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:48:26,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:48:26 BoogieIcfgContainer [2022-12-06 07:48:26,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:48:26,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:48:26,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:48:26,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:48:26,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:48:26" (1/3) ... [2022-12-06 07:48:26,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cf456b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:48:26, skipping insertion in model container [2022-12-06 07:48:26,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:48:26" (2/3) ... [2022-12-06 07:48:26,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cf456b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:48:26, skipping insertion in model container [2022-12-06 07:48:26,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:48:26" (3/3) ... [2022-12-06 07:48:26,922 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-12-06 07:48:26,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:48:26,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:48:26,935 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:48:26,969 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:48:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 264 flow [2022-12-06 07:48:27,081 INFO L130 PetriNetUnfolder]: 11/122 cut-off events. [2022-12-06 07:48:27,082 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:48:27,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 122 events. 11/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2022-12-06 07:48:27,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 264 flow [2022-12-06 07:48:27,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 114 transitions, 240 flow [2022-12-06 07:48:27,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:27,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-06 07:48:27,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 114 transitions, 240 flow [2022-12-06 07:48:27,139 INFO L130 PetriNetUnfolder]: 11/114 cut-off events. [2022-12-06 07:48:27,140 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:48:27,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 11/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2022-12-06 07:48:27,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-06 07:48:27,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-06 07:48:31,250 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 07:48:31,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:48:31,265 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;@4d97b7ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:48:31,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:48:31,268 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 07:48:31,269 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:48:31,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:31,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:31,269 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 07:48:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 82611840, now seen corresponding path program 1 times [2022-12-06 07:48:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991531911] [2022-12-06 07:48:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:31,631 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 07:48:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:31,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991531911] [2022-12-06 07:48:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991531911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:48:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082989902] [2022-12-06 07:48:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:31,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:48:31,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:48:31,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 07:48:31,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:31,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:48:31,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:31,732 INFO L130 PetriNetUnfolder]: 45/87 cut-off events. [2022-12-06 07:48:31,732 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:48:31,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 87 events. 45/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 190 event pairs, 18 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 07:48:31,735 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 14 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2022-12-06 07:48:31,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 106 flow [2022-12-06 07:48:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 07:48:31,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 07:48:31,744 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 4 states and 33 transitions. [2022-12-06 07:48:31,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 106 flow [2022-12-06 07:48:31,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:31,751 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 58 flow [2022-12-06 07:48:31,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2022-12-06 07:48:31,755 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2022-12-06 07:48:31,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:31,756 INFO L89 Accepts]: Start accepts. Operand has 22 places, 18 transitions, 58 flow [2022-12-06 07:48:31,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:31,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:31,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 58 flow [2022-12-06 07:48:31,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 58 flow [2022-12-06 07:48:31,765 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-06 07:48:31,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:48:31,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 8/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 1 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 07:48:31,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 18 transitions, 58 flow [2022-12-06 07:48:31,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 07:48:32,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:32,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 713 [2022-12-06 07:48:32,469 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 54 flow [2022-12-06 07:48:32,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 07:48:32,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:32,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:32,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:48:32,469 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 07:48:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1818505939, now seen corresponding path program 1 times [2022-12-06 07:48:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:32,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780310803] [2022-12-06 07:48:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:32,660 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 07:48:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:32,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780310803] [2022-12-06 07:48:32,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780310803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:32,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:32,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:48:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870757760] [2022-12-06 07:48:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:32,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:48:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:48:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:48:32,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 07:48:32,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 07:48:32,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:32,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 07:48:32,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:32,734 INFO L130 PetriNetUnfolder]: 72/135 cut-off events. [2022-12-06 07:48:32,734 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 07:48:32,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 135 events. 72/135 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 411 event pairs, 9 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 350. Up to 77 conditions per place. [2022-12-06 07:48:32,735 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 31 selfloop transitions, 8 changer transitions 2/42 dead transitions. [2022-12-06 07:48:32,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 42 transitions, 212 flow [2022-12-06 07:48:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:48:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:48:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 07:48:32,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 07:48:32,737 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 54 flow. Second operand 6 states and 48 transitions. [2022-12-06 07:48:32,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 42 transitions, 212 flow [2022-12-06 07:48:32,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 204 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:48:32,738 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 104 flow [2022-12-06 07:48:32,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2022-12-06 07:48:32,739 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:48:32,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:32,739 INFO L89 Accepts]: Start accepts. Operand has 26 places, 23 transitions, 104 flow [2022-12-06 07:48:32,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:32,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:32,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 23 transitions, 104 flow [2022-12-06 07:48:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 104 flow [2022-12-06 07:48:32,744 INFO L130 PetriNetUnfolder]: 16/50 cut-off events. [2022-12-06 07:48:32,744 INFO L131 PetriNetUnfolder]: For 14/26 co-relation queries the response was YES. [2022-12-06 07:48:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 50 events. 16/50 cut-off events. For 14/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 3 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 89. Up to 28 conditions per place. [2022-12-06 07:48:32,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 104 flow [2022-12-06 07:48:32,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 07:48:32,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:48:32,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:32,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:48:32,932 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 110 flow [2022-12-06 07:48:32,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 07:48:32,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:32,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:32,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:48:32,932 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 07:48:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2133734352, now seen corresponding path program 1 times [2022-12-06 07:48:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:32,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626656713] [2022-12-06 07:48:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:32,998 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 07:48:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:32,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626656713] [2022-12-06 07:48:32,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626656713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:32,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:48:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615276301] [2022-12-06 07:48:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:32,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:48:33,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 07:48:33,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 07:48:33,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:33,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 07:48:33,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:33,049 INFO L130 PetriNetUnfolder]: 87/180 cut-off events. [2022-12-06 07:48:33,049 INFO L131 PetriNetUnfolder]: For 168/206 co-relation queries the response was YES. [2022-12-06 07:48:33,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 180 events. 87/180 cut-off events. For 168/206 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 658 event pairs, 12 based on Foata normal form. 23/176 useless extension candidates. Maximal degree in co-relation 493. Up to 109 conditions per place. [2022-12-06 07:48:33,050 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 29 selfloop transitions, 9 changer transitions 3/42 dead transitions. [2022-12-06 07:48:33,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 254 flow [2022-12-06 07:48:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:48:33,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 07:48:33,051 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 110 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:48:33,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 254 flow [2022-12-06 07:48:33,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 237 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 07:48:33,053 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 151 flow [2022-12-06 07:48:33,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-06 07:48:33,054 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 8 predicate places. [2022-12-06 07:48:33,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:33,054 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 151 flow [2022-12-06 07:48:33,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:33,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:33,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 151 flow [2022-12-06 07:48:33,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 151 flow [2022-12-06 07:48:33,060 INFO L130 PetriNetUnfolder]: 18/63 cut-off events. [2022-12-06 07:48:33,060 INFO L131 PetriNetUnfolder]: For 55/69 co-relation queries the response was YES. [2022-12-06 07:48:33,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 63 events. 18/63 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 175 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 193. Up to 37 conditions per place. [2022-12-06 07:48:33,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 151 flow [2022-12-06 07:48:33,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 07:48:33,061 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:33,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 07:48:33,062 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 151 flow [2022-12-06 07:48:33,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 07:48:33,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:33,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:33,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:48:33,062 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 07:48:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash -890155735, now seen corresponding path program 1 times [2022-12-06 07:48:33,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:33,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631766811] [2022-12-06 07:48:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:33,130 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 07:48:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:33,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631766811] [2022-12-06 07:48:33,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631766811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:33,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:33,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:48:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228289223] [2022-12-06 07:48:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:33,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:48:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:48:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:33,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 07:48:33,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:33,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:33,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 07:48:33,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:33,224 INFO L130 PetriNetUnfolder]: 82/181 cut-off events. [2022-12-06 07:48:33,224 INFO L131 PetriNetUnfolder]: For 364/370 co-relation queries the response was YES. [2022-12-06 07:48:33,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 181 events. 82/181 cut-off events. For 364/370 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 607 event pairs, 36 based on Foata normal form. 14/167 useless extension candidates. Maximal degree in co-relation 716. Up to 158 conditions per place. [2022-12-06 07:48:33,226 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 23 selfloop transitions, 2 changer transitions 11/37 dead transitions. [2022-12-06 07:48:33,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 269 flow [2022-12-06 07:48:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-06 07:48:33,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-06 07:48:33,227 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 151 flow. Second operand 5 states and 35 transitions. [2022-12-06 07:48:33,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 269 flow [2022-12-06 07:48:33,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 237 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 07:48:33,229 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 145 flow [2022-12-06 07:48:33,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 07:48:33,230 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2022-12-06 07:48:33,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:33,230 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 145 flow [2022-12-06 07:48:33,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:33,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:33,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 145 flow [2022-12-06 07:48:33,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 145 flow [2022-12-06 07:48:33,237 INFO L130 PetriNetUnfolder]: 18/64 cut-off events. [2022-12-06 07:48:33,237 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-06 07:48:33,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 64 events. 18/64 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 167 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 171. Up to 23 conditions per place. [2022-12-06 07:48:33,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 145 flow [2022-12-06 07:48:33,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 07:48:34,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:34,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 841 [2022-12-06 07:48:34,071 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 141 flow [2022-12-06 07:48:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:34,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:34,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:34,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:48:34,072 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 07:48:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1895879813, now seen corresponding path program 1 times [2022-12-06 07:48:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:34,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375341375] [2022-12-06 07:48:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:34,462 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 07:48:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375341375] [2022-12-06 07:48:34,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375341375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:34,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:34,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:48:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135123388] [2022-12-06 07:48:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:34,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:48:34,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:48:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:48:34,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 07:48:34,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:48:34,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:34,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 07:48:34,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:34,598 INFO L130 PetriNetUnfolder]: 112/229 cut-off events. [2022-12-06 07:48:34,599 INFO L131 PetriNetUnfolder]: For 302/308 co-relation queries the response was YES. [2022-12-06 07:48:34,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 229 events. 112/229 cut-off events. For 302/308 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 840 event pairs, 19 based on Foata normal form. 12/199 useless extension candidates. Maximal degree in co-relation 857. Up to 168 conditions per place. [2022-12-06 07:48:34,600 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 40 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2022-12-06 07:48:34,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 362 flow [2022-12-06 07:48:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:48:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:48:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-06 07:48:34,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 07:48:34,602 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 141 flow. Second operand 7 states and 51 transitions. [2022-12-06 07:48:34,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 362 flow [2022-12-06 07:48:34,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 52 transitions, 330 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:34,605 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 241 flow [2022-12-06 07:48:34,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2022-12-06 07:48:34,607 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 07:48:34,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:34,607 INFO L89 Accepts]: Start accepts. Operand has 36 places, 35 transitions, 241 flow [2022-12-06 07:48:34,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:34,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:34,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions, 241 flow [2022-12-06 07:48:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 241 flow [2022-12-06 07:48:34,615 INFO L130 PetriNetUnfolder]: 26/91 cut-off events. [2022-12-06 07:48:34,615 INFO L131 PetriNetUnfolder]: For 121/143 co-relation queries the response was YES. [2022-12-06 07:48:34,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 91 events. 26/91 cut-off events. For 121/143 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 311 event pairs, 0 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 180. Up to 31 conditions per place. [2022-12-06 07:48:34,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 35 transitions, 241 flow [2022-12-06 07:48:34,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:48:36,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:48:36,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:36,755 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:48:36,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2149 [2022-12-06 07:48:36,756 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 257 flow [2022-12-06 07:48:36,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:48:36,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:36,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:36,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:48:36,757 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 07:48:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1026658796, now seen corresponding path program 1 times [2022-12-06 07:48:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:36,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742601341] [2022-12-06 07:48:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:37,049 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 07:48:37,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:37,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742601341] [2022-12-06 07:48:37,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742601341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:37,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:37,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:48:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395395975] [2022-12-06 07:48:37,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:37,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:48:37,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:48:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:37,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 07:48:37,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:37,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:37,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 07:48:37,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:37,152 INFO L130 PetriNetUnfolder]: 130/263 cut-off events. [2022-12-06 07:48:37,152 INFO L131 PetriNetUnfolder]: For 616/627 co-relation queries the response was YES. [2022-12-06 07:48:37,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 263 events. 130/263 cut-off events. For 616/627 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1018 event pairs, 25 based on Foata normal form. 13/228 useless extension candidates. Maximal degree in co-relation 772. Up to 220 conditions per place. [2022-12-06 07:48:37,154 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 42 selfloop transitions, 5 changer transitions 3/51 dead transitions. [2022-12-06 07:48:37,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 443 flow [2022-12-06 07:48:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:48:37,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 07:48:37,155 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 257 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:48:37,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 443 flow [2022-12-06 07:48:37,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 404 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 07:48:37,158 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 252 flow [2022-12-06 07:48:37,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2022-12-06 07:48:37,160 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 07:48:37,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:37,160 INFO L89 Accepts]: Start accepts. Operand has 39 places, 36 transitions, 252 flow [2022-12-06 07:48:37,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:37,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:37,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 36 transitions, 252 flow [2022-12-06 07:48:37,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 36 transitions, 252 flow [2022-12-06 07:48:37,170 INFO L130 PetriNetUnfolder]: 31/103 cut-off events. [2022-12-06 07:48:37,170 INFO L131 PetriNetUnfolder]: For 185/216 co-relation queries the response was YES. [2022-12-06 07:48:37,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 103 events. 31/103 cut-off events. For 185/216 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 382 event pairs, 0 based on Foata normal form. 12/96 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2022-12-06 07:48:37,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 36 transitions, 252 flow [2022-12-06 07:48:37,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 07:48:37,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:48:37,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:37,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:48:37,335 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 257 flow [2022-12-06 07:48:37,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:37,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:37,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:48:37,336 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 07:48:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -908738390, now seen corresponding path program 2 times [2022-12-06 07:48:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:37,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243208326] [2022-12-06 07:48:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:37,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:37,717 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 07:48:37,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:37,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243208326] [2022-12-06 07:48:37,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243208326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:37,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:37,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:48:37,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645581325] [2022-12-06 07:48:37,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:37,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:48:37,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:37,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:48:37,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:37,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 07:48:37,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:37,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:37,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 07:48:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:37,796 INFO L130 PetriNetUnfolder]: 119/237 cut-off events. [2022-12-06 07:48:37,796 INFO L131 PetriNetUnfolder]: For 645/660 co-relation queries the response was YES. [2022-12-06 07:48:37,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 237 events. 119/237 cut-off events. For 645/660 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 851 event pairs, 26 based on Foata normal form. 19/222 useless extension candidates. Maximal degree in co-relation 745. Up to 174 conditions per place. [2022-12-06 07:48:37,797 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 37 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2022-12-06 07:48:37,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 363 flow [2022-12-06 07:48:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 07:48:37,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-06 07:48:37,800 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 257 flow. Second operand 4 states and 37 transitions. [2022-12-06 07:48:37,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 363 flow [2022-12-06 07:48:37,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 342 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:37,802 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 234 flow [2022-12-06 07:48:37,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-06 07:48:37,802 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 07:48:37,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:37,802 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 234 flow [2022-12-06 07:48:37,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:37,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:37,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 234 flow [2022-12-06 07:48:37,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 234 flow [2022-12-06 07:48:37,815 INFO L130 PetriNetUnfolder]: 28/93 cut-off events. [2022-12-06 07:48:37,815 INFO L131 PetriNetUnfolder]: For 201/230 co-relation queries the response was YES. [2022-12-06 07:48:37,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 93 events. 28/93 cut-off events. For 201/230 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 328 event pairs, 0 based on Foata normal form. 10/85 useless extension candidates. Maximal degree in co-relation 174. Up to 28 conditions per place. [2022-12-06 07:48:37,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 234 flow [2022-12-06 07:48:37,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:48:37,829 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:37,829 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:37,829 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:37,829 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:38,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 07:48:38,113 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 252 flow [2022-12-06 07:48:38,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:38,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:38,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:38,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:48:38,114 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 07:48:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1081129842, now seen corresponding path program 1 times [2022-12-06 07:48:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:38,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710076118] [2022-12-06 07:48:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:38,439 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 07:48:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710076118] [2022-12-06 07:48:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710076118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:38,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:48:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617091915] [2022-12-06 07:48:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:38,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:48:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:48:38,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:48:38,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 07:48:38,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:48:38,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:38,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 07:48:38,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:38,554 INFO L130 PetriNetUnfolder]: 122/251 cut-off events. [2022-12-06 07:48:38,554 INFO L131 PetriNetUnfolder]: For 816/907 co-relation queries the response was YES. [2022-12-06 07:48:38,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 251 events. 122/251 cut-off events. For 816/907 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 952 event pairs, 27 based on Foata normal form. 15/225 useless extension candidates. Maximal degree in co-relation 637. Up to 223 conditions per place. [2022-12-06 07:48:38,556 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 33 selfloop transitions, 6 changer transitions 7/47 dead transitions. [2022-12-06 07:48:38,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 396 flow [2022-12-06 07:48:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:48:38,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 07:48:38,557 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 252 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:48:38,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 396 flow [2022-12-06 07:48:38,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 372 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:48:38,559 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 256 flow [2022-12-06 07:48:38,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2022-12-06 07:48:38,559 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 07:48:38,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:38,559 INFO L89 Accepts]: Start accepts. Operand has 39 places, 35 transitions, 256 flow [2022-12-06 07:48:38,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:38,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:38,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 35 transitions, 256 flow [2022-12-06 07:48:38,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 256 flow [2022-12-06 07:48:38,567 INFO L130 PetriNetUnfolder]: 28/102 cut-off events. [2022-12-06 07:48:38,568 INFO L131 PetriNetUnfolder]: For 193/218 co-relation queries the response was YES. [2022-12-06 07:48:38,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 102 events. 28/102 cut-off events. For 193/218 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 382 event pairs, 0 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 295. Up to 25 conditions per place. [2022-12-06 07:48:38,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 256 flow [2022-12-06 07:48:38,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 07:48:38,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_190| v_~q~0.base_138))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_171) v_~q~0.offset_138)) |v_thread2Thread1of1ForFork1_~j~0#1_55|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_228 4) v_~q~0.offset_138)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 1) (not (= (ite (and (<= 0 v_~q_back~0_228) (< v_~q_back~0_228 v_~n~0_151)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (ite (and (<= 0 v_~q_front~0_171) (< v_~q_front~0_171 v_~n~0_151) (< v_~q_front~0_171 v_~q_back~0_227)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q_back~0_228 1) v_~q_back~0_227) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_55| 0)) (= (+ 1 v_~q_front~0_171) v_~q_front~0_170) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_55| v_~s~0_114) v_~s~0_113) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ 1 v_~N~0_97)))) InVars {~q_back~0=v_~q_back~0_228, #memory_int=|v_#memory_int_190|, ~N~0=v_~N~0_97, ~q~0.base=v_~q~0.base_138, ~n~0=v_~n~0_151, ~q~0.offset=v_~q~0.offset_138, ~s~0=v_~s~0_114, ~q_front~0=v_~q_front~0_171} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_55|, ~q_back~0=v_~q_back~0_227, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_47|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_29|, ~N~0=v_~N~0_97, ~q~0.base=v_~q~0.base_138, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_47|, ~q~0.offset=v_~q~0.offset_138, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_33|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_29|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, #memory_int=|v_#memory_int_190|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_151, ~s~0=v_~s~0_113, ~q_front~0=v_~q_front~0_170} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:38,573 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,573 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,573 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,573 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,573 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,573 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:38,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:38,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-06 07:48:38,817 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 252 flow [2022-12-06 07:48:38,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:48:38,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:38,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:38,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:48:38,818 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 07:48:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash 608260745, now seen corresponding path program 1 times [2022-12-06 07:48:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628477424] [2022-12-06 07:48:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:39,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628477424] [2022-12-06 07:48:39,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628477424] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:39,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805387246] [2022-12-06 07:48:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:39,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:39,082 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 07:48:39,146 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 07:48:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:39,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 07:48:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:39,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:48:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:39,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:39,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:39,412 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 30 [2022-12-06 07:48:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:39,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805387246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:39,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:39,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:48:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177939193] [2022-12-06 07:48:39,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:39,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:48:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:48:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:48:39,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 07:48:39,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 252 flow. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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 07:48:39,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:39,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 07:48:39,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:39,718 INFO L130 PetriNetUnfolder]: 170/332 cut-off events. [2022-12-06 07:48:39,718 INFO L131 PetriNetUnfolder]: For 897/966 co-relation queries the response was YES. [2022-12-06 07:48:39,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 332 events. 170/332 cut-off events. For 897/966 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1392 event pairs, 11 based on Foata normal form. 28/304 useless extension candidates. Maximal degree in co-relation 1218. Up to 225 conditions per place. [2022-12-06 07:48:39,720 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 52 selfloop transitions, 21 changer transitions 2/76 dead transitions. [2022-12-06 07:48:39,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 615 flow [2022-12-06 07:48:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:48:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:48:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 07:48:39,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2022-12-06 07:48:39,722 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 252 flow. Second operand 7 states and 64 transitions. [2022-12-06 07:48:39,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 615 flow [2022-12-06 07:48:39,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 587 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:39,725 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 416 flow [2022-12-06 07:48:39,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2022-12-06 07:48:39,726 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 07:48:39,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:39,726 INFO L89 Accepts]: Start accepts. Operand has 43 places, 47 transitions, 416 flow [2022-12-06 07:48:39,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:39,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:39,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 47 transitions, 416 flow [2022-12-06 07:48:39,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 47 transitions, 416 flow [2022-12-06 07:48:39,738 INFO L130 PetriNetUnfolder]: 41/136 cut-off events. [2022-12-06 07:48:39,739 INFO L131 PetriNetUnfolder]: For 468/525 co-relation queries the response was YES. [2022-12-06 07:48:39,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 136 events. 41/136 cut-off events. For 468/525 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 591 event pairs, 0 based on Foata normal form. 7/117 useless extension candidates. Maximal degree in co-relation 441. Up to 43 conditions per place. [2022-12-06 07:48:39,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 47 transitions, 416 flow [2022-12-06 07:48:39,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 07:48:39,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_234| v_~q~0.base_164)) (.cse2 (* v_~q_back~0_281 4))) (and (= v_~q_back~0_279 (+ 2 v_~q_back~0_281)) (= |v_thread1Thread1of1ForFork0_~i~0#1_98| 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_98| (+ v_~N~0_119 1)) (not (= (ite (let ((.cse0 (+ v_~q_back~0_281 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_177))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_281) (< v_~q_back~0_281 v_~n~0_177)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_24| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread1Thread1of1ForFork0_#res#1.base_24| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_98| v_~N~0_119)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_164)) 1) 1 0) 0)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_164 4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)))) InVars {~q_back~0=v_~q_back~0_281, #memory_int=|v_#memory_int_234|, ~N~0=v_~N~0_119, ~q~0.base=v_~q~0.base_164, ~n~0=v_~n~0_177, ~q~0.offset=v_~q~0.offset_164} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_24|, ~q_back~0=v_~q_back~0_279, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_42|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_44|, ~N~0=v_~N~0_119, ~q~0.base=v_~q~0.base_164, ~q~0.offset=v_~q~0.offset_164, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_48|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_44|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_98|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_42|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_234|, ~n~0=v_~n~0_177, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_24|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:48:39,843 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:39,843 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:39,901 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:48:39,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:48:39,902 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 46 transitions, 418 flow [2022-12-06 07:48:39,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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 07:48:39,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:39,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:39,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:48:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:40,103 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 07:48:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1268985193, now seen corresponding path program 1 times [2022-12-06 07:48:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:40,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588980459] [2022-12-06 07:48:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:40,182 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 07:48:40,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:40,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588980459] [2022-12-06 07:48:40,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588980459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:40,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:40,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:48:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898481291] [2022-12-06 07:48:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:40,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:48:40,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:48:40,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 418 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 07:48:40,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:40,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:48:40,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:40,253 INFO L130 PetriNetUnfolder]: 155/314 cut-off events. [2022-12-06 07:48:40,253 INFO L131 PetriNetUnfolder]: For 1395/1429 co-relation queries the response was YES. [2022-12-06 07:48:40,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 314 events. 155/314 cut-off events. For 1395/1429 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1267 event pairs, 37 based on Foata normal form. 6/271 useless extension candidates. Maximal degree in co-relation 1334. Up to 219 conditions per place. [2022-12-06 07:48:40,255 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 43 selfloop transitions, 7 changer transitions 5/56 dead transitions. [2022-12-06 07:48:40,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 561 flow [2022-12-06 07:48:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 07:48:40,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 07:48:40,256 INFO L175 Difference]: Start difference. First operand has 42 places, 46 transitions, 418 flow. Second operand 5 states and 45 transitions. [2022-12-06 07:48:40,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 561 flow [2022-12-06 07:48:40,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 525 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 07:48:40,259 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 369 flow [2022-12-06 07:48:40,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-06 07:48:40,259 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 07:48:40,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:40,260 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 369 flow [2022-12-06 07:48:40,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:40,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:40,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 369 flow [2022-12-06 07:48:40,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 369 flow [2022-12-06 07:48:40,269 INFO L130 PetriNetUnfolder]: 36/124 cut-off events. [2022-12-06 07:48:40,270 INFO L131 PetriNetUnfolder]: For 373/412 co-relation queries the response was YES. [2022-12-06 07:48:40,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 124 events. 36/124 cut-off events. For 373/412 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 501 event pairs, 0 based on Foata normal form. 7/107 useless extension candidates. Maximal degree in co-relation 370. Up to 34 conditions per place. [2022-12-06 07:48:40,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 43 transitions, 369 flow [2022-12-06 07:48:40,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 07:48:40,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:40,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:48:40,271 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 369 flow [2022-12-06 07:48:40,271 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 07:48:40,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:40,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:40,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:48:40,272 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 07:48:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash -787977895, now seen corresponding path program 1 times [2022-12-06 07:48:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839711500] [2022-12-06 07:48:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:40,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839711500] [2022-12-06 07:48:40,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839711500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:40,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507363422] [2022-12-06 07:48:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:40,585 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 07:48:40,590 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 07:48:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:40,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:48:40,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:40,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:40,679 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 07:48:40,726 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 07:48:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:40,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:40,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:40,794 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 86 treesize of output 74 [2022-12-06 07:48:40,798 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 57 treesize of output 51 [2022-12-06 07:48:40,802 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 51 treesize of output 45 [2022-12-06 07:48:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:40,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507363422] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:40,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:40,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:48:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751565425] [2022-12-06 07:48:40,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:48:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:48:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:48:40,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 07:48:40,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 369 flow. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 07:48:40,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:40,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 07:48:40,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:41,017 INFO L130 PetriNetUnfolder]: 158/319 cut-off events. [2022-12-06 07:48:41,017 INFO L131 PetriNetUnfolder]: For 1322/1420 co-relation queries the response was YES. [2022-12-06 07:48:41,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 319 events. 158/319 cut-off events. For 1322/1420 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1317 event pairs, 39 based on Foata normal form. 26/296 useless extension candidates. Maximal degree in co-relation 1261. Up to 277 conditions per place. [2022-12-06 07:48:41,019 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 45 selfloop transitions, 10 changer transitions 2/58 dead transitions. [2022-12-06 07:48:41,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 549 flow [2022-12-06 07:48:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:48:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:48:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 07:48:41,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 07:48:41,020 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 369 flow. Second operand 6 states and 44 transitions. [2022-12-06 07:48:41,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 549 flow [2022-12-06 07:48:41,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 521 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:41,023 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 397 flow [2022-12-06 07:48:41,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 07:48:41,023 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 07:48:41,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:41,023 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 397 flow [2022-12-06 07:48:41,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:41,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:41,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 397 flow [2022-12-06 07:48:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 397 flow [2022-12-06 07:48:41,034 INFO L130 PetriNetUnfolder]: 36/127 cut-off events. [2022-12-06 07:48:41,034 INFO L131 PetriNetUnfolder]: For 396/437 co-relation queries the response was YES. [2022-12-06 07:48:41,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 127 events. 36/127 cut-off events. For 396/437 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 551 event pairs, 0 based on Foata normal form. 8/112 useless extension candidates. Maximal degree in co-relation 394. Up to 35 conditions per place. [2022-12-06 07:48:41,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 397 flow [2022-12-06 07:48:41,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 07:48:41,040 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:41,040 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:41,124 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:41,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:48:41,125 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 391 flow [2022-12-06 07:48:41,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 07:48:41,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:41,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:41,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:48:41,326 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,SelfDestructingSolverStorable10 [2022-12-06 07:48:41,326 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 07:48:41,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 463792091, now seen corresponding path program 1 times [2022-12-06 07:48:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:41,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58304947] [2022-12-06 07:48:41,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:41,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58304947] [2022-12-06 07:48:41,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58304947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239354366] [2022-12-06 07:48:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:41,412 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 07:48:41,424 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 07:48:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:41,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:48:41,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:41,526 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 07:48:41,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:48:41,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239354366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:41,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:48:41,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:48:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943046894] [2022-12-06 07:48:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:41,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:41,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:41,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:48:41,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 391 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 07:48:41,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:41,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:48:41,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:41,598 INFO L130 PetriNetUnfolder]: 181/370 cut-off events. [2022-12-06 07:48:41,599 INFO L131 PetriNetUnfolder]: For 1512/1548 co-relation queries the response was YES. [2022-12-06 07:48:41,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 370 events. 181/370 cut-off events. For 1512/1548 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1578 event pairs, 75 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 1496. Up to 193 conditions per place. [2022-12-06 07:48:41,601 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 56 selfloop transitions, 1 changer transitions 7/65 dead transitions. [2022-12-06 07:48:41,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 634 flow [2022-12-06 07:48:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:48:41,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 07:48:41,602 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 391 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:48:41,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 634 flow [2022-12-06 07:48:41,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 604 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:41,605 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 313 flow [2022-12-06 07:48:41,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-06 07:48:41,605 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 07:48:41,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:41,605 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 313 flow [2022-12-06 07:48:41,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:41,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:41,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 313 flow [2022-12-06 07:48:41,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 313 flow [2022-12-06 07:48:41,616 INFO L130 PetriNetUnfolder]: 42/138 cut-off events. [2022-12-06 07:48:41,616 INFO L131 PetriNetUnfolder]: For 274/295 co-relation queries the response was YES. [2022-12-06 07:48:41,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 138 events. 42/138 cut-off events. For 274/295 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 567 event pairs, 0 based on Foata normal form. 7/115 useless extension candidates. Maximal degree in co-relation 463. Up to 39 conditions per place. [2022-12-06 07:48:41,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 313 flow [2022-12-06 07:48:41,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 07:48:41,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [562] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_232| v_~q~0.base_162)) (.cse2 (* v_~q_back~0_275 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_79| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_79|) (not (= (ite (let ((.cse0 (+ v_~q_back~0_275 1))) (and (< .cse0 v_~n~0_175) (<= 0 .cse0))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_94| (+ v_~N~0_117 1)) (not (= 0 (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_162)) 1) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_94| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_79| 0)) (not (= (ite (and (<= 0 v_~q_back~0_275) (< v_~q_back~0_275 v_~n~0_175)) 1 0) 0)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_162 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_79|) (= (+ 2 v_~q_back~0_275) v_~q_back~0_273))) InVars {~q_back~0=v_~q_back~0_275, #memory_int=|v_#memory_int_232|, ~N~0=v_~N~0_117, ~q~0.base=v_~q~0.base_162, ~n~0=v_~n~0_175, ~q~0.offset=v_~q~0.offset_162} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_79|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_44|, ~q_back~0=v_~q_back~0_273, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_40|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_79|, #memory_int=|v_#memory_int_232|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_40|, ~N~0=v_~N~0_117, ~q~0.base=v_~q~0.base_162, ~n~0=v_~n~0_175, ~q~0.offset=v_~q~0.offset_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:48:41,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:41,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:48:41,766 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 319 flow [2022-12-06 07:48:41,766 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 07:48:41,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:41,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:41,788 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 07:48:41,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:41,966 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 07:48:41,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1382060673, now seen corresponding path program 1 times [2022-12-06 07:48:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:41,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472698937] [2022-12-06 07:48:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:42,339 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 07:48:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472698937] [2022-12-06 07:48:42,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472698937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:42,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:42,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:48:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130546924] [2022-12-06 07:48:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:48:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:48:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:48:42,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 07:48:42,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:48:42,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:42,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 07:48:42,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:42,501 INFO L130 PetriNetUnfolder]: 210/413 cut-off events. [2022-12-06 07:48:42,501 INFO L131 PetriNetUnfolder]: For 1331/1366 co-relation queries the response was YES. [2022-12-06 07:48:42,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 413 events. 210/413 cut-off events. For 1331/1366 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1760 event pairs, 24 based on Foata normal form. 37/378 useless extension candidates. Maximal degree in co-relation 1819. Up to 316 conditions per place. [2022-12-06 07:48:42,503 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 48 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2022-12-06 07:48:42,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 579 flow [2022-12-06 07:48:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:48:42,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:48:42,504 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 319 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:48:42,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 579 flow [2022-12-06 07:48:42,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 560 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:42,506 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 419 flow [2022-12-06 07:48:42,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2022-12-06 07:48:42,507 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 07:48:42,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:42,507 INFO L89 Accepts]: Start accepts. Operand has 45 places, 47 transitions, 419 flow [2022-12-06 07:48:42,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:42,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:42,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 419 flow [2022-12-06 07:48:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 419 flow [2022-12-06 07:48:42,521 INFO L130 PetriNetUnfolder]: 60/180 cut-off events. [2022-12-06 07:48:42,521 INFO L131 PetriNetUnfolder]: For 545/579 co-relation queries the response was YES. [2022-12-06 07:48:42,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 180 events. 60/180 cut-off events. For 545/579 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 791 event pairs, 0 based on Foata normal form. 14/158 useless extension candidates. Maximal degree in co-relation 439. Up to 56 conditions per place. [2022-12-06 07:48:42,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 419 flow [2022-12-06 07:48:42,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 07:48:44,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:44,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2453 [2022-12-06 07:48:44,960 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 435 flow [2022-12-06 07:48:44,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:48:44,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:44,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:44,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:48:44,975 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 07:48:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1840847627, now seen corresponding path program 1 times [2022-12-06 07:48:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:44,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74813549] [2022-12-06 07:48:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74813549] [2022-12-06 07:48:45,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74813549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456796013] [2022-12-06 07:48:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:45,409 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 07:48:45,447 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 07:48:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:45,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 07:48:45,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:45,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:45,567 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 19 treesize of output 21 [2022-12-06 07:48:45,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:48:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:45,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:45,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:45,913 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 86 treesize of output 74 [2022-12-06 07:48:45,918 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 57 treesize of output 51 [2022-12-06 07:48:45,920 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 51 treesize of output 45 [2022-12-06 07:48:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:45,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456796013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:45,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:45,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:48:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533731] [2022-12-06 07:48:45,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:45,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:48:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:48:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=190, Unknown=3, NotChecked=0, Total=240 [2022-12-06 07:48:45,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 07:48:45,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 435 flow. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:45,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:45,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 07:48:45,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:46,958 INFO L130 PetriNetUnfolder]: 310/609 cut-off events. [2022-12-06 07:48:46,958 INFO L131 PetriNetUnfolder]: For 2287/2344 co-relation queries the response was YES. [2022-12-06 07:48:46,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 609 events. 310/609 cut-off events. For 2287/2344 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2857 event pairs, 28 based on Foata normal form. 50/567 useless extension candidates. Maximal degree in co-relation 1736. Up to 395 conditions per place. [2022-12-06 07:48:46,961 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 64 selfloop transitions, 53 changer transitions 21/139 dead transitions. [2022-12-06 07:48:46,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 139 transitions, 1334 flow [2022-12-06 07:48:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:48:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:48:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-12-06 07:48:46,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3062200956937799 [2022-12-06 07:48:46,962 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 435 flow. Second operand 19 states and 128 transitions. [2022-12-06 07:48:46,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 139 transitions, 1334 flow [2022-12-06 07:48:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 139 transitions, 1301 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:48:46,968 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 972 flow [2022-12-06 07:48:46,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=972, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2022-12-06 07:48:46,968 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-06 07:48:46,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:46,968 INFO L89 Accepts]: Start accepts. Operand has 70 places, 84 transitions, 972 flow [2022-12-06 07:48:46,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:46,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:46,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 84 transitions, 972 flow [2022-12-06 07:48:46,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 84 transitions, 972 flow [2022-12-06 07:48:46,987 INFO L130 PetriNetUnfolder]: 74/232 cut-off events. [2022-12-06 07:48:46,988 INFO L131 PetriNetUnfolder]: For 1094/1148 co-relation queries the response was YES. [2022-12-06 07:48:46,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 232 events. 74/232 cut-off events. For 1094/1148 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1122 event pairs, 0 based on Foata normal form. 14/219 useless extension candidates. Maximal degree in co-relation 969. Up to 89 conditions per place. [2022-12-06 07:48:46,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 84 transitions, 972 flow [2022-12-06 07:48:46,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 07:48:47,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:48:47,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:48:47,169 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,169 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,169 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,169 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L93-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|) (= (store |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71| (store (select |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) |v_ULTIMATE.start_main_~#t2~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre14#1_77|)) |v_#memory_int_267|) (= |v_ULTIMATE.start_main_#t~pre14#1_77| |v_#pthreadsForks_89|) (not (= (ite (and (<= 0 v_~q_back~0_317) (< v_~q_back~0_317 v_~n~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| (ite (= (select (select |v_#memory_int_268| v_~q~0.base_184) (+ (* v_~q_back~0_317 4) v_~q~0.offset_184)) 1) 1 0)) (= |v_#pthreadsForks_88| (+ |v_#pthreadsForks_89| 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_116| 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_116| (+ v_~N~0_133 1)) (= (+ v_~q_back~0_317 1) v_~q_back~0_316) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_89|, ~q_back~0=v_~q_back~0_317, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, #memory_int=|v_#memory_int_268|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~n~0=v_~n~0_195, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} OutVars{~q_back~0=v_~q_back~0_316, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_62|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_77|, #pthreadsForks=|v_#pthreadsForks_88|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_66|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_62|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_267|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_66|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~n~0=v_~n~0_195, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:48:47,595 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L93-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|) (= (store |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71| (store (select |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) |v_ULTIMATE.start_main_~#t2~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre14#1_77|)) |v_#memory_int_267|) (= |v_ULTIMATE.start_main_#t~pre14#1_77| |v_#pthreadsForks_89|) (not (= (ite (and (<= 0 v_~q_back~0_317) (< v_~q_back~0_317 v_~n~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| (ite (= (select (select |v_#memory_int_268| v_~q~0.base_184) (+ (* v_~q_back~0_317 4) v_~q~0.offset_184)) 1) 1 0)) (= |v_#pthreadsForks_88| (+ |v_#pthreadsForks_89| 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_116| 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_116| (+ v_~N~0_133 1)) (= (+ v_~q_back~0_317 1) v_~q_back~0_316) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_89|, ~q_back~0=v_~q_back~0_317, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, #memory_int=|v_#memory_int_268|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~n~0=v_~n~0_195, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} OutVars{~q_back~0=v_~q_back~0_316, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_62|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_77|, #pthreadsForks=|v_#pthreadsForks_88|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_66|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_62|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_267|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_66|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~n~0=v_~n~0_195, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:47,595 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,595 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,596 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,596 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:47,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:47,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:48,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:48,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:48:48,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_265| v_~q~0.base_182))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (= (ite (and (<= 0 v_~q_front~0_220) (< v_~q_front~0_220 v_~n~0_193) (< v_~q_front~0_220 v_~q_back~0_312)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_81| v_~s~0_154) v_~s~0_153) (< |v_thread1Thread1of1ForFork0_~i~0#1_114| (+ v_~N~0_131 1)) (= (select .cse0 (+ (* 4 v_~q_front~0_220) v_~q~0.offset_182)) |v_thread2Thread1of1ForFork1_~j~0#1_81|) (= (+ v_~q_back~0_313 1) v_~q_back~0_312) (= |v_thread1Thread1of1ForFork0_~i~0#1_114| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|) (not (= (ite (and (<= 0 v_~q_back~0_313) (< v_~q_back~0_313 v_~n~0_193)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_81| 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_313 4) v_~q~0.offset_182)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= (+ 1 v_~q_front~0_220) v_~q_front~0_219))) InVars {~q_back~0=v_~q_back~0_313, #memory_int=|v_#memory_int_265|, ~N~0=v_~N~0_131, ~q~0.base=v_~q~0.base_182, ~n~0=v_~n~0_193, ~q~0.offset=v_~q~0.offset_182, ~s~0=v_~s~0_154, ~q_front~0=v_~q_front~0_220} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_81|, ~q_back~0=v_~q_back~0_312, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_70|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_60|, ~N~0=v_~N~0_131, ~q~0.base=v_~q~0.base_182, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_70|, ~q~0.offset=v_~q~0.offset_182, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_64|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_60|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_265|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, ~n~0=v_~n~0_193, ~s~0=v_~s~0_153, ~q_front~0=v_~q_front~0_219} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:48,341 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:48,341 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:48,341 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:48,341 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:48,341 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:48,341 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:48,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:48,663 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:48:48,818 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:48:48,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1851 [2022-12-06 07:48:48,819 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 1008 flow [2022-12-06 07:48:48,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:48,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:48,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:48,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:48:49,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:49,020 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 07:48:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 238360239, now seen corresponding path program 1 times [2022-12-06 07:48:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:49,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438799414] [2022-12-06 07:48:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:49,312 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 07:48:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:49,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438799414] [2022-12-06 07:48:49,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438799414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:49,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:49,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:48:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872016521] [2022-12-06 07:48:49,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:49,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:48:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:49,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:48:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:49,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 07:48:49,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 1008 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:49,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:49,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 07:48:49,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:49,549 INFO L130 PetriNetUnfolder]: 333/640 cut-off events. [2022-12-06 07:48:49,550 INFO L131 PetriNetUnfolder]: For 4429/4494 co-relation queries the response was YES. [2022-12-06 07:48:49,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3658 conditions, 640 events. 333/640 cut-off events. For 4429/4494 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 47 based on Foata normal form. 38/606 useless extension candidates. Maximal degree in co-relation 3289. Up to 366 conditions per place. [2022-12-06 07:48:49,554 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 78 selfloop transitions, 38 changer transitions 0/117 dead transitions. [2022-12-06 07:48:49,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 1542 flow [2022-12-06 07:48:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 07:48:49,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2022-12-06 07:48:49,555 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 1008 flow. Second operand 5 states and 68 transitions. [2022-12-06 07:48:49,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 1542 flow [2022-12-06 07:48:49,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 117 transitions, 1234 flow, removed 151 selfloop flow, removed 7 redundant places. [2022-12-06 07:48:49,565 INFO L231 Difference]: Finished difference. Result has 62 places, 90 transitions, 1025 flow [2022-12-06 07:48:49,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1025, PETRI_PLACES=62, PETRI_TRANSITIONS=90} [2022-12-06 07:48:49,565 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 41 predicate places. [2022-12-06 07:48:49,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:49,566 INFO L89 Accepts]: Start accepts. Operand has 62 places, 90 transitions, 1025 flow [2022-12-06 07:48:49,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:49,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:49,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 90 transitions, 1025 flow [2022-12-06 07:48:49,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 90 transitions, 1025 flow [2022-12-06 07:48:49,588 INFO L130 PetriNetUnfolder]: 87/273 cut-off events. [2022-12-06 07:48:49,588 INFO L131 PetriNetUnfolder]: For 1527/1600 co-relation queries the response was YES. [2022-12-06 07:48:49,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 273 events. 87/273 cut-off events. For 1527/1600 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1445 event pairs, 3 based on Foata normal form. 16/277 useless extension candidates. Maximal degree in co-relation 1170. Up to 116 conditions per place. [2022-12-06 07:48:49,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 90 transitions, 1025 flow [2022-12-06 07:48:49,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 07:48:49,591 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:49,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 07:48:49,592 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 90 transitions, 1025 flow [2022-12-06 07:48:49,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:49,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:49,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:49,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:48:49,592 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 07:48:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1510971701, now seen corresponding path program 1 times [2022-12-06 07:48:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:49,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288484539] [2022-12-06 07:48:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288484539] [2022-12-06 07:48:49,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288484539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460921792] [2022-12-06 07:48:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:49,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:49,908 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 07:48:49,937 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 07:48:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:49,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:48:49,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:50,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:50,004 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 07:48:50,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:48:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:50,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:50,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:50,101 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 86 treesize of output 74 [2022-12-06 07:48:50,105 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 57 treesize of output 51 [2022-12-06 07:48:50,107 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 51 treesize of output 45 [2022-12-06 07:48:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:50,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460921792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:50,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:50,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:48:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684397543] [2022-12-06 07:48:50,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:50,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:48:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:48:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:48:50,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 07:48:50,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 90 transitions, 1025 flow. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 07:48:50,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:50,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 07:48:50,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:50,415 INFO L130 PetriNetUnfolder]: 345/675 cut-off events. [2022-12-06 07:48:50,415 INFO L131 PetriNetUnfolder]: For 5373/5421 co-relation queries the response was YES. [2022-12-06 07:48:50,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 675 events. 345/675 cut-off events. For 5373/5421 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3360 event pairs, 79 based on Foata normal form. 23/685 useless extension candidates. Maximal degree in co-relation 3503. Up to 617 conditions per place. [2022-12-06 07:48:50,419 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 87 selfloop transitions, 17 changer transitions 2/107 dead transitions. [2022-12-06 07:48:50,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 1347 flow [2022-12-06 07:48:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:48:50,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 07:48:50,420 INFO L175 Difference]: Start difference. First operand has 62 places, 90 transitions, 1025 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:48:50,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 1347 flow [2022-12-06 07:48:50,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 107 transitions, 1317 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-06 07:48:50,431 INFO L231 Difference]: Finished difference. Result has 67 places, 94 transitions, 1105 flow [2022-12-06 07:48:50,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1105, PETRI_PLACES=67, PETRI_TRANSITIONS=94} [2022-12-06 07:48:50,432 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-06 07:48:50,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:50,432 INFO L89 Accepts]: Start accepts. Operand has 67 places, 94 transitions, 1105 flow [2022-12-06 07:48:50,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:50,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:50,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 94 transitions, 1105 flow [2022-12-06 07:48:50,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 94 transitions, 1105 flow [2022-12-06 07:48:50,454 INFO L130 PetriNetUnfolder]: 86/285 cut-off events. [2022-12-06 07:48:50,454 INFO L131 PetriNetUnfolder]: For 1794/1879 co-relation queries the response was YES. [2022-12-06 07:48:50,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 285 events. 86/285 cut-off events. For 1794/1879 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1611 event pairs, 1 based on Foata normal form. 17/292 useless extension candidates. Maximal degree in co-relation 1216. Up to 118 conditions per place. [2022-12-06 07:48:50,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 94 transitions, 1105 flow [2022-12-06 07:48:50,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 07:48:50,462 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:50,462 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:50,540 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:50,540 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:50,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:50,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:48:50,618 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 93 transitions, 1098 flow [2022-12-06 07:48:50,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 07:48:50,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:50,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:50,626 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 07:48:50,818 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,SelfDestructingSolverStorable15 [2022-12-06 07:48:50,818 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 07:48:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash -814112697, now seen corresponding path program 1 times [2022-12-06 07:48:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:50,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137139450] [2022-12-06 07:48:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:51,054 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 07:48:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137139450] [2022-12-06 07:48:51,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137139450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:51,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:51,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:48:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136193446] [2022-12-06 07:48:51,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:48:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:48:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:51,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 07:48:51,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 93 transitions, 1098 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:51,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:51,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 07:48:51,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:51,257 INFO L130 PetriNetUnfolder]: 338/662 cut-off events. [2022-12-06 07:48:51,257 INFO L131 PetriNetUnfolder]: For 5623/5651 co-relation queries the response was YES. [2022-12-06 07:48:51,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 662 events. 338/662 cut-off events. For 5623/5651 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3177 event pairs, 51 based on Foata normal form. 5/658 useless extension candidates. Maximal degree in co-relation 3479. Up to 487 conditions per place. [2022-12-06 07:48:51,262 INFO L137 encePairwiseOnDemand]: 16/35 looper letters, 77 selfloop transitions, 24 changer transitions 2/104 dead transitions. [2022-12-06 07:48:51,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 1356 flow [2022-12-06 07:48:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:48:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:48:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:48:51,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 07:48:51,263 INFO L175 Difference]: Start difference. First operand has 66 places, 93 transitions, 1098 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:48:51,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 1356 flow [2022-12-06 07:48:51,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 1295 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 07:48:51,273 INFO L231 Difference]: Finished difference. Result has 68 places, 92 transitions, 1084 flow [2022-12-06 07:48:51,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1084, PETRI_PLACES=68, PETRI_TRANSITIONS=92} [2022-12-06 07:48:51,273 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-06 07:48:51,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:51,273 INFO L89 Accepts]: Start accepts. Operand has 68 places, 92 transitions, 1084 flow [2022-12-06 07:48:51,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:51,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:51,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 92 transitions, 1084 flow [2022-12-06 07:48:51,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 92 transitions, 1084 flow [2022-12-06 07:48:51,301 INFO L130 PetriNetUnfolder]: 85/279 cut-off events. [2022-12-06 07:48:51,301 INFO L131 PetriNetUnfolder]: For 1837/1934 co-relation queries the response was YES. [2022-12-06 07:48:51,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 279 events. 85/279 cut-off events. For 1837/1934 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1541 event pairs, 1 based on Foata normal form. 17/286 useless extension candidates. Maximal degree in co-relation 1157. Up to 115 conditions per place. [2022-12-06 07:48:51,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 92 transitions, 1084 flow [2022-12-06 07:48:51,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 07:48:51,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:51,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 07:48:51,305 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 92 transitions, 1084 flow [2022-12-06 07:48:51,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 07:48:51,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:51,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:51,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:48:51,305 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:48:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1514218920, now seen corresponding path program 1 times [2022-12-06 07:48:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:51,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308139513] [2022-12-06 07:48:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:51,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308139513] [2022-12-06 07:48:51,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308139513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:51,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575690584] [2022-12-06 07:48:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:51,392 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 07:48:51,432 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 07:48:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:51,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:48:51,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:51,515 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 07:48:51,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:48:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575690584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:51,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:48:51,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 07:48:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097985103] [2022-12-06 07:48:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:51,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:48:51,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:48:51,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 92 transitions, 1084 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:51,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:51,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:48:51,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:51,656 INFO L130 PetriNetUnfolder]: 364/719 cut-off events. [2022-12-06 07:48:51,656 INFO L131 PetriNetUnfolder]: For 6493/6565 co-relation queries the response was YES. [2022-12-06 07:48:51,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 719 events. 364/719 cut-off events. For 6493/6565 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3655 event pairs, 45 based on Foata normal form. 21/730 useless extension candidates. Maximal degree in co-relation 4078. Up to 527 conditions per place. [2022-12-06 07:48:51,660 INFO L137 encePairwiseOnDemand]: 16/34 looper letters, 78 selfloop transitions, 33 changer transitions 5/117 dead transitions. [2022-12-06 07:48:51,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1533 flow [2022-12-06 07:48:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 07:48:51,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40441176470588236 [2022-12-06 07:48:51,661 INFO L175 Difference]: Start difference. First operand has 67 places, 92 transitions, 1084 flow. Second operand 4 states and 55 transitions. [2022-12-06 07:48:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1533 flow [2022-12-06 07:48:51,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 1495 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:48:51,674 INFO L231 Difference]: Finished difference. Result has 69 places, 94 transitions, 1179 flow [2022-12-06 07:48:51,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1179, PETRI_PLACES=69, PETRI_TRANSITIONS=94} [2022-12-06 07:48:51,674 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2022-12-06 07:48:51,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:51,674 INFO L89 Accepts]: Start accepts. Operand has 69 places, 94 transitions, 1179 flow [2022-12-06 07:48:51,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:51,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:51,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 94 transitions, 1179 flow [2022-12-06 07:48:51,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 94 transitions, 1179 flow [2022-12-06 07:48:51,699 INFO L130 PetriNetUnfolder]: 88/294 cut-off events. [2022-12-06 07:48:51,699 INFO L131 PetriNetUnfolder]: For 2143/2235 co-relation queries the response was YES. [2022-12-06 07:48:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 294 events. 88/294 cut-off events. For 2143/2235 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1673 event pairs, 2 based on Foata normal form. 16/297 useless extension candidates. Maximal degree in co-relation 1424. Up to 123 conditions per place. [2022-12-06 07:48:51,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 94 transitions, 1179 flow [2022-12-06 07:48:51,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 07:48:51,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_273| v_~q~0.base_188))) (and (not (= (ite (and (<= 0 v_~q_back~0_328) (< v_~q_back~0_328 v_~n~0_199)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_34| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_122| v_~N~0_137)) (< |v_thread1Thread1of1ForFork0_~i~0#1_122| (+ v_~N~0_137 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_122| 1) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_188 (* v_~q_back~0_326 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_188 (* v_~q_back~0_328 4))) 1) 1 0) 0)) (= v_~q_back~0_326 (+ 2 v_~q_back~0_328)) (not (= (ite (and (<= 1 v_~q_back~0_326) (< v_~q_back~0_326 (+ v_~n~0_199 1))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_328, #memory_int=|v_#memory_int_273|, ~N~0=v_~N~0_137, ~q~0.base=v_~q~0.base_188, ~n~0=v_~n~0_199, ~q~0.offset=v_~q~0.offset_188} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_34|, ~q_back~0=v_~q_back~0_326, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_52|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_68|, ~N~0=v_~N~0_137, ~q~0.base=v_~q~0.base_188, ~q~0.offset=v_~q~0.offset_188, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_72|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_68|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_122|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_199, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_34|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:48:51,837 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:51,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:48:51,841 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 93 transitions, 1175 flow [2022-12-06 07:48:51,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:51,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:51,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:51,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:48:52,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 07:48:52,046 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:48:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -826583320, now seen corresponding path program 1 times [2022-12-06 07:48:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:52,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616631386] [2022-12-06 07:48:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:52,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616631386] [2022-12-06 07:48:52,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616631386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093835076] [2022-12-06 07:48:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:52,405 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 07:48:52,432 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 07:48:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:52,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 07:48:52,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:52,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:52,503 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 07:48:52,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:48:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:52,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:52,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:52,602 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 82 treesize of output 70 [2022-12-06 07:48:52,607 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 53 treesize of output 47 [2022-12-06 07:48:52,609 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 47 treesize of output 41 [2022-12-06 07:48:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:52,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093835076] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:52,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:52,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-12-06 07:48:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331730284] [2022-12-06 07:48:52,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:52,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:48:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:48:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:48:52,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:48:52,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 93 transitions, 1175 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 07:48:52,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:52,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:48:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:52,891 INFO L130 PetriNetUnfolder]: 361/705 cut-off events. [2022-12-06 07:48:52,891 INFO L131 PetriNetUnfolder]: For 6914/7002 co-relation queries the response was YES. [2022-12-06 07:48:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 705 events. 361/705 cut-off events. For 6914/7002 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3512 event pairs, 63 based on Foata normal form. 33/728 useless extension candidates. Maximal degree in co-relation 4279. Up to 646 conditions per place. [2022-12-06 07:48:52,896 INFO L137 encePairwiseOnDemand]: 15/31 looper letters, 90 selfloop transitions, 21 changer transitions 2/114 dead transitions. [2022-12-06 07:48:52,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 1551 flow [2022-12-06 07:48:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:48:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:48:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-06 07:48:52,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2764976958525346 [2022-12-06 07:48:52,897 INFO L175 Difference]: Start difference. First operand has 68 places, 93 transitions, 1175 flow. Second operand 7 states and 60 transitions. [2022-12-06 07:48:52,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 1551 flow [2022-12-06 07:48:52,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 1479 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:52,907 INFO L231 Difference]: Finished difference. Result has 72 places, 97 transitions, 1246 flow [2022-12-06 07:48:52,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1246, PETRI_PLACES=72, PETRI_TRANSITIONS=97} [2022-12-06 07:48:52,907 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-06 07:48:52,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:52,907 INFO L89 Accepts]: Start accepts. Operand has 72 places, 97 transitions, 1246 flow [2022-12-06 07:48:52,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:52,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:52,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 97 transitions, 1246 flow [2022-12-06 07:48:52,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 97 transitions, 1246 flow [2022-12-06 07:48:52,931 INFO L130 PetriNetUnfolder]: 88/293 cut-off events. [2022-12-06 07:48:52,931 INFO L131 PetriNetUnfolder]: For 2153/2246 co-relation queries the response was YES. [2022-12-06 07:48:52,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 293 events. 88/293 cut-off events. For 2153/2246 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1681 event pairs, 2 based on Foata normal form. 19/304 useless extension candidates. Maximal degree in co-relation 1416. Up to 124 conditions per place. [2022-12-06 07:48:52,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 97 transitions, 1246 flow [2022-12-06 07:48:52,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 07:48:52,938 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:52,938 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:53,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:53,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:48:53,018 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 96 transitions, 1232 flow [2022-12-06 07:48:53,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 07:48:53,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:53,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:53,024 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 07:48:53,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:53,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:48:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash -575027323, now seen corresponding path program 1 times [2022-12-06 07:48:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:53,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389873562] [2022-12-06 07:48:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:53,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389873562] [2022-12-06 07:48:53,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389873562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:53,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324175013] [2022-12-06 07:48:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:53,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:53,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:53,445 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 07:48:53,477 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 07:48:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:53,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 07:48:53,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:53,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:53,675 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:48:53,676 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 27 treesize of output 16 [2022-12-06 07:48:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324175013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:53,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:53,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:48:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76559678] [2022-12-06 07:48:53,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:53,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:48:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:48:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:48:53,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 07:48:53,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 96 transitions, 1232 flow. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 07:48:53,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:53,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 07:48:53,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:54,150 INFO L130 PetriNetUnfolder]: 449/872 cut-off events. [2022-12-06 07:48:54,150 INFO L131 PetriNetUnfolder]: For 8923/8991 co-relation queries the response was YES. [2022-12-06 07:48:54,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 872 events. 449/872 cut-off events. For 8923/8991 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4611 event pairs, 86 based on Foata normal form. 73/935 useless extension candidates. Maximal degree in co-relation 4873. Up to 486 conditions per place. [2022-12-06 07:48:54,156 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 127 selfloop transitions, 40 changer transitions 1/169 dead transitions. [2022-12-06 07:48:54,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 169 transitions, 2230 flow [2022-12-06 07:48:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:48:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:48:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2022-12-06 07:48:54,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2897727272727273 [2022-12-06 07:48:54,157 INFO L175 Difference]: Start difference. First operand has 71 places, 96 transitions, 1232 flow. Second operand 11 states and 102 transitions. [2022-12-06 07:48:54,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 169 transitions, 2230 flow [2022-12-06 07:48:54,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 2134 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-06 07:48:54,174 INFO L231 Difference]: Finished difference. Result has 83 places, 110 transitions, 1494 flow [2022-12-06 07:48:54,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1494, PETRI_PLACES=83, PETRI_TRANSITIONS=110} [2022-12-06 07:48:54,175 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 07:48:54,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:54,175 INFO L89 Accepts]: Start accepts. Operand has 83 places, 110 transitions, 1494 flow [2022-12-06 07:48:54,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:54,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:54,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 110 transitions, 1494 flow [2022-12-06 07:48:54,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 110 transitions, 1494 flow [2022-12-06 07:48:54,207 INFO L130 PetriNetUnfolder]: 113/370 cut-off events. [2022-12-06 07:48:54,208 INFO L131 PetriNetUnfolder]: For 3296/3377 co-relation queries the response was YES. [2022-12-06 07:48:54,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 370 events. 113/370 cut-off events. For 3296/3377 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2257 event pairs, 2 based on Foata normal form. 22/383 useless extension candidates. Maximal degree in co-relation 1851. Up to 161 conditions per place. [2022-12-06 07:48:54,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 110 transitions, 1494 flow [2022-12-06 07:48:54,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 07:48:54,216 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,216 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,308 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,308 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,418 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,418 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,526 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,526 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,861 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,862 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,862 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:54,862 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:55,067 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:48:55,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 893 [2022-12-06 07:48:55,068 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 110 transitions, 1562 flow [2022-12-06 07:48:55,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 07:48:55,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:55,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:55,073 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 07:48:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:55,269 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:48:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1564588506, now seen corresponding path program 1 times [2022-12-06 07:48:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:55,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886610008] [2022-12-06 07:48:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:55,336 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 07:48:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886610008] [2022-12-06 07:48:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886610008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:55,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:55,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:48:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505609376] [2022-12-06 07:48:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:55,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:55,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:55,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:48:55,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 07:48:55,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 110 transitions, 1562 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:55,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:55,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 07:48:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:55,504 INFO L130 PetriNetUnfolder]: 432/846 cut-off events. [2022-12-06 07:48:55,504 INFO L131 PetriNetUnfolder]: For 10907/10950 co-relation queries the response was YES. [2022-12-06 07:48:55,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5711 conditions, 846 events. 432/846 cut-off events. For 10907/10950 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4506 event pairs, 67 based on Foata normal form. 35/870 useless extension candidates. Maximal degree in co-relation 5120. Up to 683 conditions per place. [2022-12-06 07:48:55,510 INFO L137 encePairwiseOnDemand]: 20/38 looper letters, 84 selfloop transitions, 38 changer transitions 4/127 dead transitions. [2022-12-06 07:48:55,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 127 transitions, 1946 flow [2022-12-06 07:48:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 07:48:55,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2022-12-06 07:48:55,511 INFO L175 Difference]: Start difference. First operand has 83 places, 110 transitions, 1562 flow. Second operand 4 states and 59 transitions. [2022-12-06 07:48:55,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 127 transitions, 1946 flow [2022-12-06 07:48:55,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 1815 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:55,528 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 1491 flow [2022-12-06 07:48:55,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1491, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2022-12-06 07:48:55,528 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 07:48:55,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:55,529 INFO L89 Accepts]: Start accepts. Operand has 83 places, 108 transitions, 1491 flow [2022-12-06 07:48:55,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:55,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:55,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 108 transitions, 1491 flow [2022-12-06 07:48:55,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 1491 flow [2022-12-06 07:48:55,558 INFO L130 PetriNetUnfolder]: 112/363 cut-off events. [2022-12-06 07:48:55,558 INFO L131 PetriNetUnfolder]: For 3298/3373 co-relation queries the response was YES. [2022-12-06 07:48:55,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 363 events. 112/363 cut-off events. For 3298/3373 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2216 event pairs, 3 based on Foata normal form. 19/372 useless extension candidates. Maximal degree in co-relation 1833. Up to 160 conditions per place. [2022-12-06 07:48:55,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 108 transitions, 1491 flow [2022-12-06 07:48:55,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 07:48:55,561 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:55,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 07:48:55,563 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 108 transitions, 1491 flow [2022-12-06 07:48:55,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:55,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:55,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:48:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:48:55,563 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:48:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 432994741, now seen corresponding path program 1 times [2022-12-06 07:48:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357266436] [2022-12-06 07:48:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357266436] [2022-12-06 07:48:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357266436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246592563] [2022-12-06 07:48:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:55,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:55,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:55,855 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 07:48:55,857 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 07:48:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:55,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:48:55,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:55,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:55,976 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 07:48:56,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:56,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 07:48:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:56,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:56,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:56,152 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 156 treesize of output 157 [2022-12-06 07:48:56,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:56,164 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 101 treesize of output 94 [2022-12-06 07:48:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:48:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246592563] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:56,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:56,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:48:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180203027] [2022-12-06 07:48:56,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:56,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:48:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:48:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:48:56,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 07:48:56,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 108 transitions, 1491 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:48:56,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:56,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 07:48:56,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:56,691 INFO L130 PetriNetUnfolder]: 464/898 cut-off events. [2022-12-06 07:48:56,691 INFO L131 PetriNetUnfolder]: For 10295/10336 co-relation queries the response was YES. [2022-12-06 07:48:56,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 898 events. 464/898 cut-off events. For 10295/10336 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4723 event pairs, 73 based on Foata normal form. 22/909 useless extension candidates. Maximal degree in co-relation 5689. Up to 710 conditions per place. [2022-12-06 07:48:56,697 INFO L137 encePairwiseOnDemand]: 15/36 looper letters, 90 selfloop transitions, 53 changer transitions 2/146 dead transitions. [2022-12-06 07:48:56,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 146 transitions, 2124 flow [2022-12-06 07:48:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:48:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:48:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-06 07:48:56,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2638888888888889 [2022-12-06 07:48:56,698 INFO L175 Difference]: Start difference. First operand has 82 places, 108 transitions, 1491 flow. Second operand 8 states and 76 transitions. [2022-12-06 07:48:56,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 146 transitions, 2124 flow [2022-12-06 07:48:56,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 146 transitions, 2015 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 07:48:56,715 INFO L231 Difference]: Finished difference. Result has 89 places, 120 transitions, 1735 flow [2022-12-06 07:48:56,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1735, PETRI_PLACES=89, PETRI_TRANSITIONS=120} [2022-12-06 07:48:56,715 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 68 predicate places. [2022-12-06 07:48:56,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:56,715 INFO L89 Accepts]: Start accepts. Operand has 89 places, 120 transitions, 1735 flow [2022-12-06 07:48:56,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:56,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:56,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 120 transitions, 1735 flow [2022-12-06 07:48:56,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 120 transitions, 1735 flow [2022-12-06 07:48:56,747 INFO L130 PetriNetUnfolder]: 121/384 cut-off events. [2022-12-06 07:48:56,747 INFO L131 PetriNetUnfolder]: For 3726/3808 co-relation queries the response was YES. [2022-12-06 07:48:56,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 384 events. 121/384 cut-off events. For 3726/3808 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2330 event pairs, 2 based on Foata normal form. 19/393 useless extension candidates. Maximal degree in co-relation 2073. Up to 176 conditions per place. [2022-12-06 07:48:56,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 120 transitions, 1735 flow [2022-12-06 07:48:56,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 07:48:56,754 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:56,754 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:56,834 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:48:56,834 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:00,135 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:00,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3420 [2022-12-06 07:49:00,135 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 119 transitions, 1752 flow [2022-12-06 07:49:00,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:00,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:00,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:00,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 07:49:00,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:00,340 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash -989187211, now seen corresponding path program 1 times [2022-12-06 07:49:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:00,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325872187] [2022-12-06 07:49:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325872187] [2022-12-06 07:49:00,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325872187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453706919] [2022-12-06 07:49:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:00,550 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 07:49:00,553 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 07:49:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:00,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 07:49:00,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:00,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:00,801 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:49:00,802 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 26 treesize of output 18 [2022-12-06 07:49:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:00,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453706919] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:00,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:00,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:49:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476032149] [2022-12-06 07:49:00,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:00,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:49:00,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 07:49:00,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 119 transitions, 1752 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:00,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:00,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 07:49:00,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:01,722 INFO L130 PetriNetUnfolder]: 584/1141 cut-off events. [2022-12-06 07:49:01,722 INFO L131 PetriNetUnfolder]: For 13631/13724 co-relation queries the response was YES. [2022-12-06 07:49:01,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 1141 events. 584/1141 cut-off events. For 13631/13724 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6539 event pairs, 27 based on Foata normal form. 39/1166 useless extension candidates. Maximal degree in co-relation 7747. Up to 587 conditions per place. [2022-12-06 07:49:01,729 INFO L137 encePairwiseOnDemand]: 14/39 looper letters, 132 selfloop transitions, 92 changer transitions 4/229 dead transitions. [2022-12-06 07:49:01,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 229 transitions, 3239 flow [2022-12-06 07:49:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:49:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:49:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2022-12-06 07:49:01,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 07:49:01,730 INFO L175 Difference]: Start difference. First operand has 88 places, 119 transitions, 1752 flow. Second operand 17 states and 156 transitions. [2022-12-06 07:49:01,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 229 transitions, 3239 flow [2022-12-06 07:49:01,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 229 transitions, 3154 flow, removed 37 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:01,753 INFO L231 Difference]: Finished difference. Result has 111 places, 147 transitions, 2530 flow [2022-12-06 07:49:01,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2530, PETRI_PLACES=111, PETRI_TRANSITIONS=147} [2022-12-06 07:49:01,753 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 90 predicate places. [2022-12-06 07:49:01,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:01,754 INFO L89 Accepts]: Start accepts. Operand has 111 places, 147 transitions, 2530 flow [2022-12-06 07:49:01,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:01,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:01,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 147 transitions, 2530 flow [2022-12-06 07:49:01,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 147 transitions, 2530 flow [2022-12-06 07:49:01,796 INFO L130 PetriNetUnfolder]: 142/475 cut-off events. [2022-12-06 07:49:01,796 INFO L131 PetriNetUnfolder]: For 5936/6020 co-relation queries the response was YES. [2022-12-06 07:49:01,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 475 events. 142/475 cut-off events. For 5936/6020 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3193 event pairs, 0 based on Foata normal form. 9/479 useless extension candidates. Maximal degree in co-relation 3110. Up to 228 conditions per place. [2022-12-06 07:49:01,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 147 transitions, 2530 flow [2022-12-06 07:49:01,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 07:49:01,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:01,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 07:49:01,802 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 147 transitions, 2530 flow [2022-12-06 07:49:01,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:01,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:01,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:01,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:02,006 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,SelfDestructingSolverStorable22 [2022-12-06 07:49:02,006 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1958788032, now seen corresponding path program 1 times [2022-12-06 07:49:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:02,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502002706] [2022-12-06 07:49:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:02,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502002706] [2022-12-06 07:49:02,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502002706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:02,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535071874] [2022-12-06 07:49:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:02,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:02,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:02,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:49:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:02,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:49:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:02,195 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 07:49:02,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:02,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535071874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:02,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:02,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:49:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936664014] [2022-12-06 07:49:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:02,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:02,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:02,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 07:49:02,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 147 transitions, 2530 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:02,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:02,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 07:49:02,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:02,387 INFO L130 PetriNetUnfolder]: 560/1087 cut-off events. [2022-12-06 07:49:02,387 INFO L131 PetriNetUnfolder]: For 18971/19063 co-relation queries the response was YES. [2022-12-06 07:49:02,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8620 conditions, 1087 events. 560/1087 cut-off events. For 18971/19063 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5991 event pairs, 199 based on Foata normal form. 9/1091 useless extension candidates. Maximal degree in co-relation 8575. Up to 889 conditions per place. [2022-12-06 07:49:02,396 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 154 selfloop transitions, 2 changer transitions 5/162 dead transitions. [2022-12-06 07:49:02,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 162 transitions, 2954 flow [2022-12-06 07:49:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 07:49:02,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2022-12-06 07:49:02,397 INFO L175 Difference]: Start difference. First operand has 110 places, 147 transitions, 2530 flow. Second operand 4 states and 59 transitions. [2022-12-06 07:49:02,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 162 transitions, 2954 flow [2022-12-06 07:49:02,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 162 transitions, 2634 flow, removed 140 selfloop flow, removed 4 redundant places. [2022-12-06 07:49:02,435 INFO L231 Difference]: Finished difference. Result has 110 places, 144 transitions, 2151 flow [2022-12-06 07:49:02,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2151, PETRI_PLACES=110, PETRI_TRANSITIONS=144} [2022-12-06 07:49:02,435 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:49:02,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:02,436 INFO L89 Accepts]: Start accepts. Operand has 110 places, 144 transitions, 2151 flow [2022-12-06 07:49:02,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:02,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:02,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 144 transitions, 2151 flow [2022-12-06 07:49:02,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 144 transitions, 2151 flow [2022-12-06 07:49:02,489 INFO L130 PetriNetUnfolder]: 142/456 cut-off events. [2022-12-06 07:49:02,489 INFO L131 PetriNetUnfolder]: For 4654/4721 co-relation queries the response was YES. [2022-12-06 07:49:02,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 456 events. 142/456 cut-off events. For 4654/4721 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2966 event pairs, 0 based on Foata normal form. 9/459 useless extension candidates. Maximal degree in co-relation 2622. Up to 206 conditions per place. [2022-12-06 07:49:02,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 144 transitions, 2151 flow [2022-12-06 07:49:02,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 07:49:02,769 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:02,769 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:02,769 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:02,769 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,027 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,028 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,028 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,028 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,028 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,028 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:03,582 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:49:03,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1147 [2022-12-06 07:49:03,582 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 144 transitions, 2221 flow [2022-12-06 07:49:03,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:03,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:03,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:03,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:03,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-06 07:49:03,783 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1035214489, now seen corresponding path program 1 times [2022-12-06 07:49:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:03,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609743403] [2022-12-06 07:49:03,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:03,829 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 07:49:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:03,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609743403] [2022-12-06 07:49:03,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609743403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:03,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:03,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:49:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014093237] [2022-12-06 07:49:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:03,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:49:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:49:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:49:03,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:49:03,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 144 transitions, 2221 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) 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 07:49:03,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:03,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:49:03,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:03,988 INFO L130 PetriNetUnfolder]: 541/1050 cut-off events. [2022-12-06 07:49:03,988 INFO L131 PetriNetUnfolder]: For 14329/14393 co-relation queries the response was YES. [2022-12-06 07:49:03,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 1050 events. 541/1050 cut-off events. For 14329/14393 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5808 event pairs, 195 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 7178. Up to 860 conditions per place. [2022-12-06 07:49:03,995 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 150 selfloop transitions, 2 changer transitions 1/154 dead transitions. [2022-12-06 07:49:03,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 154 transitions, 2572 flow [2022-12-06 07:49:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:49:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:49:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 07:49:03,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 07:49:03,995 INFO L175 Difference]: Start difference. First operand has 108 places, 144 transitions, 2221 flow. Second operand 3 states and 54 transitions. [2022-12-06 07:49:03,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 154 transitions, 2572 flow [2022-12-06 07:49:04,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 154 transitions, 2474 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-06 07:49:04,024 INFO L231 Difference]: Finished difference. Result has 103 places, 140 transitions, 2041 flow [2022-12-06 07:49:04,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2041, PETRI_PLACES=103, PETRI_TRANSITIONS=140} [2022-12-06 07:49:04,024 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 07:49:04,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:04,025 INFO L89 Accepts]: Start accepts. Operand has 103 places, 140 transitions, 2041 flow [2022-12-06 07:49:04,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:04,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:04,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 140 transitions, 2041 flow [2022-12-06 07:49:04,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 140 transitions, 2041 flow [2022-12-06 07:49:04,076 INFO L130 PetriNetUnfolder]: 138/447 cut-off events. [2022-12-06 07:49:04,076 INFO L131 PetriNetUnfolder]: For 4202/4259 co-relation queries the response was YES. [2022-12-06 07:49:04,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 447 events. 138/447 cut-off events. For 4202/4259 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2899 event pairs, 0 based on Foata normal form. 9/452 useless extension candidates. Maximal degree in co-relation 2562. Up to 203 conditions per place. [2022-12-06 07:49:04,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 140 transitions, 2041 flow [2022-12-06 07:49:04,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 07:49:04,080 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:04,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 07:49:04,082 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 140 transitions, 2041 flow [2022-12-06 07:49:04,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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 07:49:04,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:04,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:04,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:49:04,082 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1079276683, now seen corresponding path program 2 times [2022-12-06 07:49:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937925168] [2022-12-06 07:49:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:04,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937925168] [2022-12-06 07:49:04,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937925168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:04,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431472273] [2022-12-06 07:49:04,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:49:04,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:04,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:04,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:49:04,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:49:04,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:49:04,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:49:04,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:04,492 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-06 07:49:04,492 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 23 treesize of output 15 [2022-12-06 07:49:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:04,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:04,561 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:49:04,561 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 26 treesize of output 18 [2022-12-06 07:49:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:04,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431472273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:04,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:04,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:49:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558883204] [2022-12-06 07:49:04,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:04,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:49:04,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 07:49:04,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 140 transitions, 2041 flow. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 07:49:04,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:04,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 07:49:04,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:05,287 INFO L130 PetriNetUnfolder]: 526/1081 cut-off events. [2022-12-06 07:49:05,288 INFO L131 PetriNetUnfolder]: For 13505/13523 co-relation queries the response was YES. [2022-12-06 07:49:05,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 1081 events. 526/1081 cut-off events. For 13505/13523 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6360 event pairs, 52 based on Foata normal form. 91/1160 useless extension candidates. Maximal degree in co-relation 7221. Up to 488 conditions per place. [2022-12-06 07:49:05,294 INFO L137 encePairwiseOnDemand]: 9/36 looper letters, 119 selfloop transitions, 63 changer transitions 19/202 dead transitions. [2022-12-06 07:49:05,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 202 transitions, 2903 flow [2022-12-06 07:49:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:49:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:49:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2022-12-06 07:49:05,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.234375 [2022-12-06 07:49:05,295 INFO L175 Difference]: Start difference. First operand has 102 places, 140 transitions, 2041 flow. Second operand 16 states and 135 transitions. [2022-12-06 07:49:05,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 202 transitions, 2903 flow [2022-12-06 07:49:05,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 202 transitions, 2893 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:05,325 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 2072 flow [2022-12-06 07:49:05,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2072, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2022-12-06 07:49:05,325 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 98 predicate places. [2022-12-06 07:49:05,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:05,326 INFO L89 Accepts]: Start accepts. Operand has 119 places, 127 transitions, 2072 flow [2022-12-06 07:49:05,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:05,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:05,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 127 transitions, 2072 flow [2022-12-06 07:49:05,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 127 transitions, 2072 flow [2022-12-06 07:49:05,361 INFO L130 PetriNetUnfolder]: 108/407 cut-off events. [2022-12-06 07:49:05,361 INFO L131 PetriNetUnfolder]: For 4819/4880 co-relation queries the response was YES. [2022-12-06 07:49:05,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 407 events. 108/407 cut-off events. For 4819/4880 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2702 event pairs, 2 based on Foata normal form. 9/411 useless extension candidates. Maximal degree in co-relation 2362. Up to 174 conditions per place. [2022-12-06 07:49:05,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 127 transitions, 2072 flow [2022-12-06 07:49:05,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 07:49:05,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:05,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 07:49:05,585 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 127 transitions, 2076 flow [2022-12-06 07:49:05,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 07:49:05,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:05,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:05,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:05,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 07:49:05,786 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash -764301825, now seen corresponding path program 1 times [2022-12-06 07:49:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:05,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223365674] [2022-12-06 07:49:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:06,078 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 07:49:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:06,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223365674] [2022-12-06 07:49:06,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223365674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:06,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:06,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630626057] [2022-12-06 07:49:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:06,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:49:06,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 127 transitions, 2076 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:06,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:06,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:49:06,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:06,363 INFO L130 PetriNetUnfolder]: 565/1166 cut-off events. [2022-12-06 07:49:06,363 INFO L131 PetriNetUnfolder]: For 18299/18320 co-relation queries the response was YES. [2022-12-06 07:49:06,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8678 conditions, 1166 events. 565/1166 cut-off events. For 18299/18320 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6966 event pairs, 76 based on Foata normal form. 6/1160 useless extension candidates. Maximal degree in co-relation 7924. Up to 852 conditions per place. [2022-12-06 07:49:06,370 INFO L137 encePairwiseOnDemand]: 12/34 looper letters, 110 selfloop transitions, 59 changer transitions 0/170 dead transitions. [2022-12-06 07:49:06,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 170 transitions, 2898 flow [2022-12-06 07:49:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 07:49:06,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2022-12-06 07:49:06,371 INFO L175 Difference]: Start difference. First operand has 113 places, 127 transitions, 2076 flow. Second operand 5 states and 65 transitions. [2022-12-06 07:49:06,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 170 transitions, 2898 flow [2022-12-06 07:49:06,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 170 transitions, 2717 flow, removed 37 selfloop flow, removed 10 redundant places. [2022-12-06 07:49:06,409 INFO L231 Difference]: Finished difference. Result has 110 places, 146 transitions, 2440 flow [2022-12-06 07:49:06,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2440, PETRI_PLACES=110, PETRI_TRANSITIONS=146} [2022-12-06 07:49:06,409 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:49:06,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:06,410 INFO L89 Accepts]: Start accepts. Operand has 110 places, 146 transitions, 2440 flow [2022-12-06 07:49:06,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:06,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:06,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 146 transitions, 2440 flow [2022-12-06 07:49:06,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 146 transitions, 2440 flow [2022-12-06 07:49:06,464 INFO L130 PetriNetUnfolder]: 126/491 cut-off events. [2022-12-06 07:49:06,464 INFO L131 PetriNetUnfolder]: For 5756/5852 co-relation queries the response was YES. [2022-12-06 07:49:06,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 491 events. 126/491 cut-off events. For 5756/5852 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3521 event pairs, 3 based on Foata normal form. 20/504 useless extension candidates. Maximal degree in co-relation 2820. Up to 196 conditions per place. [2022-12-06 07:49:06,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 146 transitions, 2440 flow [2022-12-06 07:49:06,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-06 07:49:06,469 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:06,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 07:49:06,470 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 146 transitions, 2440 flow [2022-12-06 07:49:06,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:06,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:06,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:06,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:49:06,471 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 903569305, now seen corresponding path program 1 times [2022-12-06 07:49:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:06,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894963266] [2022-12-06 07:49:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:06,521 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 07:49:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:06,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894963266] [2022-12-06 07:49:06,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894963266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:06,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:06,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:49:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198843804] [2022-12-06 07:49:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:06,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:49:06,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:49:06,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 146 transitions, 2440 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 07:49:06,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:06,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:49:06,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:06,670 INFO L130 PetriNetUnfolder]: 360/763 cut-off events. [2022-12-06 07:49:06,670 INFO L131 PetriNetUnfolder]: For 13245/13281 co-relation queries the response was YES. [2022-12-06 07:49:06,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5780 conditions, 763 events. 360/763 cut-off events. For 13245/13281 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4203 event pairs, 141 based on Foata normal form. 38/797 useless extension candidates. Maximal degree in co-relation 5464. Up to 704 conditions per place. [2022-12-06 07:49:06,675 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 107 selfloop transitions, 0 changer transitions 18/126 dead transitions. [2022-12-06 07:49:06,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 126 transitions, 2293 flow [2022-12-06 07:49:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:49:06,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-06 07:49:06,676 INFO L175 Difference]: Start difference. First operand has 110 places, 146 transitions, 2440 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:49:06,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 126 transitions, 2293 flow [2022-12-06 07:49:06,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 126 transitions, 2181 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-06 07:49:06,701 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1687 flow [2022-12-06 07:49:06,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1687, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2022-12-06 07:49:06,701 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 83 predicate places. [2022-12-06 07:49:06,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:06,701 INFO L89 Accepts]: Start accepts. Operand has 104 places, 108 transitions, 1687 flow [2022-12-06 07:49:06,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:06,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:06,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 108 transitions, 1687 flow [2022-12-06 07:49:06,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 108 transitions, 1687 flow [2022-12-06 07:49:06,728 INFO L130 PetriNetUnfolder]: 82/315 cut-off events. [2022-12-06 07:49:06,728 INFO L131 PetriNetUnfolder]: For 3313/3383 co-relation queries the response was YES. [2022-12-06 07:49:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 315 events. 82/315 cut-off events. For 3313/3383 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1966 event pairs, 1 based on Foata normal form. 10/321 useless extension candidates. Maximal degree in co-relation 1823. Up to 124 conditions per place. [2022-12-06 07:49:06,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 108 transitions, 1687 flow [2022-12-06 07:49:06,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 07:49:06,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_293| v_~q~0.base_204))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_149| 1) |v_thread1Thread1of1ForFork0_~i~0#1_148|) (= v_~q_back~0_366 (+ v_~q_back~0_367 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_149| v_~N~0_153) (= (ite (and (< v_~q_front~0_244 v_~n~0_215) (< v_~q_front~0_244 v_~q_back~0_367) (<= 0 v_~q_front~0_244)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_93| v_~s~0_178) v_~s~0_177) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= (+ 1 v_~q_front~0_244) v_~q_front~0_243) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (= (select .cse0 (+ (* 4 v_~q_front~0_244) v_~q~0.offset_204)) |v_thread2Thread1of1ForFork1_~j~0#1_93|) (not (= (ite (and (< v_~q_back~0_367 v_~n~0_215) (<= 0 v_~q_back~0_367)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_367 4) v_~q~0.offset_204)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_93| 0)))) InVars {~q_back~0=v_~q_back~0_367, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_293|, ~N~0=v_~N~0_153, ~q~0.base=v_~q~0.base_204, ~n~0=v_~n~0_215, ~q~0.offset=v_~q~0.offset_204, ~s~0=v_~s~0_178, ~q_front~0=v_~q_front~0_244} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~q_back~0=v_~q_back~0_366, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_86|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_82|, ~N~0=v_~N~0_153, ~q~0.base=v_~q~0.base_204, ~q~0.offset=v_~q~0.offset_204, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_82|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_90|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_86|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, #memory_int=|v_#memory_int_293|, ~n~0=v_~n~0_215, ~s~0=v_~s~0_177, ~q_front~0=v_~q_front~0_243} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:06,741 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:06,741 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:06,741 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:06,741 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:06,741 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:06,741 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:07,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_271| v_~q~0.base_186)) (.cse2 (* v_~q_back~0_322 4))) (and (not (= (ite (let ((.cse0 (+ v_~q_back~0_322 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_197))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_135 1)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|) (not (= (ite (and (< v_~q_back~0_322 v_~n~0_197) (<= 0 v_~q_back~0_322)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (= (+ 2 v_~q_back~0_322) v_~q_back~0_320) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 2))) InVars {~q_back~0=v_~q_back~0_322, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_68|, ~q_back~0=v_~q_back~0_320, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:07,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_271| v_~q~0.base_186)) (.cse2 (* v_~q_back~0_322 4))) (and (not (= (ite (let ((.cse0 (+ v_~q_back~0_322 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_197))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_135 1)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|) (not (= (ite (and (< v_~q_back~0_322 v_~n~0_197) (<= 0 v_~q_back~0_322)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (= (+ 2 v_~q_back~0_322) v_~q_back~0_320) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 2))) InVars {~q_back~0=v_~q_back~0_322, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_68|, ~q_back~0=v_~q_back~0_320, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:49:07,405 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:07,406 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:07,406 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:07,406 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:07,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (+ v_~q_back~0_362 1)) (.cse1 (select |v_#memory_int_291| v_~q~0.base_202)) (.cse2 (* v_~q_back~0_362 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80| (ite (and (< v_~q_front~0_240 .cse0) (<= 0 v_~q_front~0_240) (< v_~q_front~0_240 v_~n~0_213)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_144| 2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_213)) 1 0) 0)) (= (select .cse1 (+ v_~q~0.offset_202 (* 4 v_~q_front~0_240))) |v_thread2Thread1of1ForFork1_~j~0#1_91|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_130| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|) (= (+ 2 v_~q_back~0_362) v_~q_back~0_360) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_202 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_130|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130| 0)) (= v_~s~0_173 (+ |v_thread2Thread1of1ForFork1_~j~0#1_91| v_~s~0_174)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (< 1 v_~N~0_151) (= (+ 1 v_~q_front~0_240) v_~q_front~0_239) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_202)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_91| 0)))) InVars {~q_back~0=v_~q_back~0_362, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_151, ~q~0.base=v_~q~0.base_202, ~n~0=v_~n~0_213, ~q~0.offset=v_~q~0.offset_202, ~s~0=v_~s~0_174, ~q_front~0=v_~q_front~0_240} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_91|, ~q_back~0=v_~q_back~0_360, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_82|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_80|, ~N~0=v_~N~0_151, ~q~0.base=v_~q~0.base_202, ~q~0.offset=v_~q~0.offset_202, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_130|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_86|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_82|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_144|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|, #memory_int=|v_#memory_int_291|, ~n~0=v_~n~0_213, ~s~0=v_~s~0_173, ~q_front~0=v_~q_front~0_239} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:08,364 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:08,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1664 [2022-12-06 07:49:08,365 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 107 transitions, 1779 flow [2022-12-06 07:49:08,365 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 07:49:08,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:08,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:08,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:49:08,365 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash 979834023, now seen corresponding path program 2 times [2022-12-06 07:49:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:08,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611110311] [2022-12-06 07:49:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:08,603 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 07:49:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:08,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611110311] [2022-12-06 07:49:08,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611110311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:08,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:08,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:49:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748321230] [2022-12-06 07:49:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:08,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:49:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:49:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:08,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 07:49:08,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 107 transitions, 1779 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:08,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:08,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 07:49:08,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:08,777 INFO L130 PetriNetUnfolder]: 385/786 cut-off events. [2022-12-06 07:49:08,777 INFO L131 PetriNetUnfolder]: For 12486/12560 co-relation queries the response was YES. [2022-12-06 07:49:08,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5873 conditions, 786 events. 385/786 cut-off events. For 12486/12560 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4323 event pairs, 77 based on Foata normal form. 37/819 useless extension candidates. Maximal degree in co-relation 5743. Up to 653 conditions per place. [2022-12-06 07:49:08,781 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 104 selfloop transitions, 27 changer transitions 4/136 dead transitions. [2022-12-06 07:49:08,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 2387 flow [2022-12-06 07:49:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:49:08,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 07:49:08,782 INFO L175 Difference]: Start difference. First operand has 92 places, 107 transitions, 1779 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:49:08,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 2387 flow [2022-12-06 07:49:08,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 136 transitions, 2225 flow, removed 72 selfloop flow, removed 7 redundant places. [2022-12-06 07:49:08,801 INFO L231 Difference]: Finished difference. Result has 91 places, 114 transitions, 1814 flow [2022-12-06 07:49:08,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1814, PETRI_PLACES=91, PETRI_TRANSITIONS=114} [2022-12-06 07:49:08,802 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 07:49:08,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:08,803 INFO L89 Accepts]: Start accepts. Operand has 91 places, 114 transitions, 1814 flow [2022-12-06 07:49:08,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:08,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:08,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 114 transitions, 1814 flow [2022-12-06 07:49:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 114 transitions, 1814 flow [2022-12-06 07:49:08,831 INFO L130 PetriNetUnfolder]: 92/339 cut-off events. [2022-12-06 07:49:08,831 INFO L131 PetriNetUnfolder]: For 4074/4192 co-relation queries the response was YES. [2022-12-06 07:49:08,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 339 events. 92/339 cut-off events. For 4074/4192 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2156 event pairs, 1 based on Foata normal form. 30/365 useless extension candidates. Maximal degree in co-relation 2019. Up to 130 conditions per place. [2022-12-06 07:49:08,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 114 transitions, 1814 flow [2022-12-06 07:49:08,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 07:49:08,833 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:08,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 07:49:08,835 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 114 transitions, 1814 flow [2022-12-06 07:49:08,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:08,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:08,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:08,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:49:08,835 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1976844517, now seen corresponding path program 3 times [2022-12-06 07:49:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:08,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183549120] [2022-12-06 07:49:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:09,072 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 07:49:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:09,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183549120] [2022-12-06 07:49:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183549120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:09,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410641904] [2022-12-06 07:49:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:09,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:09,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:49:09,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 114 transitions, 1814 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:09,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:09,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:49:09,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:09,242 INFO L130 PetriNetUnfolder]: 381/768 cut-off events. [2022-12-06 07:49:09,242 INFO L131 PetriNetUnfolder]: For 11167/11241 co-relation queries the response was YES. [2022-12-06 07:49:09,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 768 events. 381/768 cut-off events. For 11167/11241 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4102 event pairs, 46 based on Foata normal form. 38/802 useless extension candidates. Maximal degree in co-relation 5585. Up to 560 conditions per place. [2022-12-06 07:49:09,246 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 95 selfloop transitions, 37 changer transitions 2/135 dead transitions. [2022-12-06 07:49:09,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 2276 flow [2022-12-06 07:49:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 07:49:09,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2022-12-06 07:49:09,246 INFO L175 Difference]: Start difference. First operand has 89 places, 114 transitions, 1814 flow. Second operand 5 states and 58 transitions. [2022-12-06 07:49:09,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 2276 flow [2022-12-06 07:49:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 2139 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-06 07:49:09,266 INFO L231 Difference]: Finished difference. Result has 90 places, 115 transitions, 1808 flow [2022-12-06 07:49:09,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=90, PETRI_TRANSITIONS=115} [2022-12-06 07:49:09,266 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 07:49:09,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:09,267 INFO L89 Accepts]: Start accepts. Operand has 90 places, 115 transitions, 1808 flow [2022-12-06 07:49:09,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:09,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:09,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 115 transitions, 1808 flow [2022-12-06 07:49:09,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 115 transitions, 1808 flow [2022-12-06 07:49:09,293 INFO L130 PetriNetUnfolder]: 92/330 cut-off events. [2022-12-06 07:49:09,294 INFO L131 PetriNetUnfolder]: For 3919/4013 co-relation queries the response was YES. [2022-12-06 07:49:09,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 330 events. 92/330 cut-off events. For 3919/4013 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2048 event pairs, 1 based on Foata normal form. 29/355 useless extension candidates. Maximal degree in co-relation 1921. Up to 126 conditions per place. [2022-12-06 07:49:09,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 115 transitions, 1808 flow [2022-12-06 07:49:09,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 07:49:09,296 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:09,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 07:49:09,297 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 115 transitions, 1808 flow [2022-12-06 07:49:09,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:09,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:09,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:09,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:49:09,297 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 499908419, now seen corresponding path program 4 times [2022-12-06 07:49:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:09,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249960830] [2022-12-06 07:49:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:09,687 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 07:49:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:09,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249960830] [2022-12-06 07:49:09,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249960830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:09,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:09,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833056928] [2022-12-06 07:49:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:09,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:09,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:49:09,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 115 transitions, 1808 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:09,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:09,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:49:09,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:09,923 INFO L130 PetriNetUnfolder]: 389/775 cut-off events. [2022-12-06 07:49:09,923 INFO L131 PetriNetUnfolder]: For 11360/11414 co-relation queries the response was YES. [2022-12-06 07:49:09,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5663 conditions, 775 events. 389/775 cut-off events. For 11360/11414 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4062 event pairs, 44 based on Foata normal form. 32/803 useless extension candidates. Maximal degree in co-relation 5527. Up to 566 conditions per place. [2022-12-06 07:49:09,927 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 90 selfloop transitions, 44 changer transitions 0/135 dead transitions. [2022-12-06 07:49:09,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 2260 flow [2022-12-06 07:49:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 07:49:09,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2022-12-06 07:49:09,928 INFO L175 Difference]: Start difference. First operand has 90 places, 115 transitions, 1808 flow. Second operand 5 states and 57 transitions. [2022-12-06 07:49:09,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 2260 flow [2022-12-06 07:49:09,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 2195 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 07:49:09,945 INFO L231 Difference]: Finished difference. Result has 92 places, 119 transitions, 1928 flow [2022-12-06 07:49:09,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1729, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1928, PETRI_PLACES=92, PETRI_TRANSITIONS=119} [2022-12-06 07:49:09,945 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2022-12-06 07:49:09,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:09,946 INFO L89 Accepts]: Start accepts. Operand has 92 places, 119 transitions, 1928 flow [2022-12-06 07:49:09,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:09,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:09,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 119 transitions, 1928 flow [2022-12-06 07:49:09,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 119 transitions, 1928 flow [2022-12-06 07:49:09,975 INFO L130 PetriNetUnfolder]: 96/336 cut-off events. [2022-12-06 07:49:09,975 INFO L131 PetriNetUnfolder]: For 4040/4126 co-relation queries the response was YES. [2022-12-06 07:49:09,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 336 events. 96/336 cut-off events. For 4040/4126 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2073 event pairs, 1 based on Foata normal form. 25/357 useless extension candidates. Maximal degree in co-relation 1803. Up to 131 conditions per place. [2022-12-06 07:49:09,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 119 transitions, 1928 flow [2022-12-06 07:49:09,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 07:49:09,978 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:09,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 07:49:09,978 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 119 transitions, 1928 flow [2022-12-06 07:49:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:09,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:09,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:09,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:49:09,978 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1030656879, now seen corresponding path program 1 times [2022-12-06 07:49:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:09,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348621938] [2022-12-06 07:49:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348621938] [2022-12-06 07:49:10,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348621938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666388147] [2022-12-06 07:49:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:10,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:10,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:49:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:10,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:49:10,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:10,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:10,434 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 19 treesize of output 21 [2022-12-06 07:49:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:10,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:10,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:10,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 07:49:10,590 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 25 treesize of output 18 [2022-12-06 07:49:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:10,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666388147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:10,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:10,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:49:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132242461] [2022-12-06 07:49:10,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:10,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:49:10,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:49:10,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 119 transitions, 1928 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:10,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:10,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:49:10,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:11,261 INFO L130 PetriNetUnfolder]: 440/886 cut-off events. [2022-12-06 07:49:11,262 INFO L131 PetriNetUnfolder]: For 14779/14833 co-relation queries the response was YES. [2022-12-06 07:49:11,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 886 events. 440/886 cut-off events. For 14779/14833 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4943 event pairs, 69 based on Foata normal form. 39/921 useless extension candidates. Maximal degree in co-relation 5860. Up to 401 conditions per place. [2022-12-06 07:49:11,267 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 127 selfloop transitions, 53 changer transitions 0/181 dead transitions. [2022-12-06 07:49:11,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 181 transitions, 2846 flow [2022-12-06 07:49:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:49:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:49:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-12-06 07:49:11,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29301075268817206 [2022-12-06 07:49:11,268 INFO L175 Difference]: Start difference. First operand has 92 places, 119 transitions, 1928 flow. Second operand 12 states and 109 transitions. [2022-12-06 07:49:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 181 transitions, 2846 flow [2022-12-06 07:49:11,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 181 transitions, 2787 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:11,288 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 2238 flow [2022-12-06 07:49:11,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2238, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2022-12-06 07:49:11,288 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 07:49:11,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:11,289 INFO L89 Accepts]: Start accepts. Operand has 107 places, 129 transitions, 2238 flow [2022-12-06 07:49:11,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:11,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:11,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 129 transitions, 2238 flow [2022-12-06 07:49:11,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 129 transitions, 2238 flow [2022-12-06 07:49:11,322 INFO L130 PetriNetUnfolder]: 103/372 cut-off events. [2022-12-06 07:49:11,322 INFO L131 PetriNetUnfolder]: For 5494/5611 co-relation queries the response was YES. [2022-12-06 07:49:11,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 372 events. 103/372 cut-off events. For 5494/5611 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2416 event pairs, 1 based on Foata normal form. 28/394 useless extension candidates. Maximal degree in co-relation 2366. Up to 148 conditions per place. [2022-12-06 07:49:11,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 129 transitions, 2238 flow [2022-12-06 07:49:11,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 07:49:11,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:11,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:11,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:49:11,475 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 128 transitions, 2232 flow [2022-12-06 07:49:11,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:11,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:11,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:11,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:11,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-06 07:49:11,676 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 399427691, now seen corresponding path program 1 times [2022-12-06 07:49:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:11,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217449659] [2022-12-06 07:49:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217449659] [2022-12-06 07:49:12,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217449659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397946743] [2022-12-06 07:49:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:12,075 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:12,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:49:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:12,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 07:49:12,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:12,188 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-12-06 07:49:12,189 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 1 case distinctions, treesize of input 30 treesize of output 49 [2022-12-06 07:49:12,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:12,193 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 25 treesize of output 27 [2022-12-06 07:49:12,224 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 07:49:12,347 INFO L321 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2022-12-06 07:49:12,347 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 47 treesize of output 18 [2022-12-06 07:49:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:12,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:12,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397946743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:12,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:12,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:49:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099503182] [2022-12-06 07:49:12,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:12,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2022-12-06 07:49:12,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 07:49:12,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 128 transitions, 2232 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 07:49:12,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:12,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 07:49:12,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:13,131 INFO L130 PetriNetUnfolder]: 437/881 cut-off events. [2022-12-06 07:49:13,132 INFO L131 PetriNetUnfolder]: For 16643/16661 co-relation queries the response was YES. [2022-12-06 07:49:13,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6879 conditions, 881 events. 437/881 cut-off events. For 16643/16661 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4842 event pairs, 81 based on Foata normal form. 7/886 useless extension candidates. Maximal degree in co-relation 6612. Up to 440 conditions per place. [2022-12-06 07:49:13,136 INFO L137 encePairwiseOnDemand]: 10/32 looper letters, 131 selfloop transitions, 36 changer transitions 2/170 dead transitions. [2022-12-06 07:49:13,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 170 transitions, 2924 flow [2022-12-06 07:49:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:49:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:49:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-12-06 07:49:13,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.284375 [2022-12-06 07:49:13,138 INFO L175 Difference]: Start difference. First operand has 106 places, 128 transitions, 2232 flow. Second operand 10 states and 91 transitions. [2022-12-06 07:49:13,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 170 transitions, 2924 flow [2022-12-06 07:49:13,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 170 transitions, 2846 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 07:49:13,164 INFO L231 Difference]: Finished difference. Result has 114 places, 132 transitions, 2339 flow [2022-12-06 07:49:13,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2155, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2339, PETRI_PLACES=114, PETRI_TRANSITIONS=132} [2022-12-06 07:49:13,165 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 07:49:13,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:13,165 INFO L89 Accepts]: Start accepts. Operand has 114 places, 132 transitions, 2339 flow [2022-12-06 07:49:13,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:13,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:13,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 132 transitions, 2339 flow [2022-12-06 07:49:13,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 132 transitions, 2339 flow [2022-12-06 07:49:13,198 INFO L130 PetriNetUnfolder]: 103/370 cut-off events. [2022-12-06 07:49:13,198 INFO L131 PetriNetUnfolder]: For 5434/5532 co-relation queries the response was YES. [2022-12-06 07:49:13,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 370 events. 103/370 cut-off events. For 5434/5532 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2381 event pairs, 1 based on Foata normal form. 25/389 useless extension candidates. Maximal degree in co-relation 2326. Up to 148 conditions per place. [2022-12-06 07:49:13,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 132 transitions, 2339 flow [2022-12-06 07:49:13,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 07:49:13,206 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,206 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_396| v_~q~0.base_271)) (.cse1 (* v_~q_back~0_517 4))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_175| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_66| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_158| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_158|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_158| (ite (and (<= 0 v_~q_front~0_370) (< v_~q_front~0_370 v_~n~0_282) (< v_~q_front~0_370 (+ v_~q_back~0_517 1))) 1 0)) (= (+ v_~s~0_296 |v_thread2Thread1of1ForFork1_~j~0#1_175|) v_~s~0_295) (= (select .cse0 (+ (* 4 v_~q_front~0_370) v_~q~0.offset_271)) |v_thread2Thread1of1ForFork1_~j~0#1_175|) (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_271 .cse1)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_227| v_~N~0_200)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_214| 0)) (= (+ 1 v_~q_front~0_370) v_~q_front~0_369) (= |v_thread1Thread1of1ForFork0_~i~0#1_227| 2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_158| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_271 .cse1)) 1) 1 0) 0)) (= (+ 3 v_~q_back~0_517) v_~q_back~0_515) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_214|) (= |v_thread1Thread1of1ForFork0_#res#1.base_66| 0) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_271 4 .cse1)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_517))) (and (< .cse2 v_~n~0_282) (<= 0 .cse2))) 1 0) 0)) (< 1 v_~N~0_200))) InVars {~q_back~0=v_~q_back~0_517, #memory_int=|v_#memory_int_396|, ~N~0=v_~N~0_200, ~q~0.base=v_~q~0.base_271, ~n~0=v_~n~0_282, ~q~0.offset=v_~q~0.offset_271, ~s~0=v_~s~0_296, ~q_front~0=v_~q_front~0_370} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_175|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_66|, ~q_back~0=v_~q_back~0_515, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_158|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_151|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_158|, ~N~0=v_~N~0_200, ~q~0.base=v_~q~0.base_271, ~q~0.offset=v_~q~0.offset_271, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_158|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_155|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_151|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_227|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_214|, #memory_int=|v_#memory_int_396|, ~n~0=v_~n~0_282, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_66|, ~s~0=v_~s~0_295, ~q_front~0=v_~q_front~0_369} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:13,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] L65-2-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_382| v_~q~0.base_259)) (.cse2 (* v_~q_back~0_487 4))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_62| 0) (= (+ v_~s~0_282 |v_thread2Thread1of1ForFork1_~j~0#1_167|) v_~s~0_281) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_211| v_~N~0_188)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_62| 0) (not (= (ite (let ((.cse0 (+ v_~q_back~0_487 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_270))) 1 0) 0)) (= (+ 2 v_~q_back~0_487) v_~q_back~0_485) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_150| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_150|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_259)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_212| v_~N~0_188) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_150| (ite (and (< v_~q_front~0_356 v_~q_back~0_487) (<= 0 v_~q_front~0_356) (< v_~q_front~0_356 v_~n~0_270)) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_167| (select .cse1 (+ (* 4 v_~q_front~0_356) v_~q~0.offset_259))) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_259 4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_150| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|) (= (+ 1 v_~q_front~0_356) v_~q_front~0_355) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_167| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_211| (+ |v_thread1Thread1of1ForFork0_~i~0#1_212| 1)))) InVars {~q_back~0=v_~q_back~0_487, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_212|, #memory_int=|v_#memory_int_382|, ~N~0=v_~N~0_188, ~q~0.base=v_~q~0.base_259, ~n~0=v_~n~0_270, ~q~0.offset=v_~q~0.offset_259, ~s~0=v_~s~0_282, ~q_front~0=v_~q_front~0_356} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_167|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_62|, ~q_back~0=v_~q_back~0_485, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_150|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_137|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_150|, ~N~0=v_~N~0_188, ~q~0.base=v_~q~0.base_259, ~q~0.offset=v_~q~0.offset_259, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_150|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_150|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_141|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_137|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_211|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|, #memory_int=|v_#memory_int_382|, ~n~0=v_~n~0_270, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_62|, ~s~0=v_~s~0_281, ~q_front~0=v_~q_front~0_355} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,700 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:13,701 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:14,004 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:14,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 839 [2022-12-06 07:49:14,004 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 2311 flow [2022-12-06 07:49:14,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 07:49:14,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:14,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:14,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 07:49:14,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:14,223 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash 884715389, now seen corresponding path program 1 times [2022-12-06 07:49:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:14,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131555674] [2022-12-06 07:49:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131555674] [2022-12-06 07:49:14,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131555674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:14,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607384065] [2022-12-06 07:49:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:14,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:14,837 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:14,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:49:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:14,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 07:49:14,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:14,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:14,961 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 19 treesize of output 21 [2022-12-06 07:49:15,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:15,004 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 46 treesize of output 12 [2022-12-06 07:49:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:15,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:15,149 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-06 07:49:15,150 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 152 treesize of output 139 [2022-12-06 07:49:15,162 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-06 07:49:15,162 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 97 treesize of output 76 [2022-12-06 07:49:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:15,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607384065] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:15,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:15,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:49:15,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053952257] [2022-12-06 07:49:15,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:15,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:49:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:15,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:49:15,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:49:15,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 07:49:15,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 2311 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:15,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:15,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 07:49:15,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:16,092 INFO L130 PetriNetUnfolder]: 547/1087 cut-off events. [2022-12-06 07:49:16,092 INFO L131 PetriNetUnfolder]: For 25906/25941 co-relation queries the response was YES. [2022-12-06 07:49:16,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9101 conditions, 1087 events. 547/1087 cut-off events. For 25906/25941 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6345 event pairs, 74 based on Foata normal form. 20/1107 useless extension candidates. Maximal degree in co-relation 8364. Up to 683 conditions per place. [2022-12-06 07:49:16,097 INFO L137 encePairwiseOnDemand]: 7/32 looper letters, 126 selfloop transitions, 60 changer transitions 5/192 dead transitions. [2022-12-06 07:49:16,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 192 transitions, 3444 flow [2022-12-06 07:49:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:49:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:49:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2022-12-06 07:49:16,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2682291666666667 [2022-12-06 07:49:16,098 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 2311 flow. Second operand 12 states and 103 transitions. [2022-12-06 07:49:16,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 192 transitions, 3444 flow [2022-12-06 07:49:16,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 192 transitions, 3348 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 07:49:16,130 INFO L231 Difference]: Finished difference. Result has 124 places, 153 transitions, 2944 flow [2022-12-06 07:49:16,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2944, PETRI_PLACES=124, PETRI_TRANSITIONS=153} [2022-12-06 07:49:16,130 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 07:49:16,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:16,130 INFO L89 Accepts]: Start accepts. Operand has 124 places, 153 transitions, 2944 flow [2022-12-06 07:49:16,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:16,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:16,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 153 transitions, 2944 flow [2022-12-06 07:49:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 153 transitions, 2944 flow [2022-12-06 07:49:16,173 INFO L130 PetriNetUnfolder]: 125/437 cut-off events. [2022-12-06 07:49:16,173 INFO L131 PetriNetUnfolder]: For 8107/8246 co-relation queries the response was YES. [2022-12-06 07:49:16,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 437 events. 125/437 cut-off events. For 8107/8246 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2950 event pairs, 1 based on Foata normal form. 30/464 useless extension candidates. Maximal degree in co-relation 3211. Up to 190 conditions per place. [2022-12-06 07:49:16,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 153 transitions, 2944 flow [2022-12-06 07:49:16,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-06 07:49:16,181 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,181 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,573 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,574 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:16,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:16,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 863 [2022-12-06 07:49:16,994 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 2943 flow [2022-12-06 07:49:16,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:16,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:16,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:16,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 07:49:17,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:17,194 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 250881904, now seen corresponding path program 1 times [2022-12-06 07:49:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:17,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032052741] [2022-12-06 07:49:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:17,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032052741] [2022-12-06 07:49:17,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032052741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:17,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096541402] [2022-12-06 07:49:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:17,266 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:17,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 07:49:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:17,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:49:17,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:17,380 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 07:49:17,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:17,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096541402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:17,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:17,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:49:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047910978] [2022-12-06 07:49:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:17,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:17,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 07:49:17,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 2943 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 07:49:17,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:17,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 07:49:17,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:17,557 INFO L130 PetriNetUnfolder]: 504/997 cut-off events. [2022-12-06 07:49:17,557 INFO L131 PetriNetUnfolder]: For 25563/25660 co-relation queries the response was YES. [2022-12-06 07:49:17,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8697 conditions, 997 events. 504/997 cut-off events. For 25563/25660 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5613 event pairs, 195 based on Foata normal form. 26/1022 useless extension candidates. Maximal degree in co-relation 8584. Up to 667 conditions per place. [2022-12-06 07:49:17,563 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 159 selfloop transitions, 1 changer transitions 4/165 dead transitions. [2022-12-06 07:49:17,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 165 transitions, 3272 flow [2022-12-06 07:49:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 07:49:17,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 07:49:17,564 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 2943 flow. Second operand 4 states and 52 transitions. [2022-12-06 07:49:17,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 165 transitions, 3272 flow [2022-12-06 07:49:17,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 165 transitions, 3105 flow, removed 69 selfloop flow, removed 5 redundant places. [2022-12-06 07:49:17,603 INFO L231 Difference]: Finished difference. Result has 120 places, 147 transitions, 2605 flow [2022-12-06 07:49:17,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2605, PETRI_PLACES=120, PETRI_TRANSITIONS=147} [2022-12-06 07:49:17,604 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 07:49:17,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:17,604 INFO L89 Accepts]: Start accepts. Operand has 120 places, 147 transitions, 2605 flow [2022-12-06 07:49:17,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:17,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:17,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 147 transitions, 2605 flow [2022-12-06 07:49:17,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 147 transitions, 2605 flow [2022-12-06 07:49:17,654 INFO L130 PetriNetUnfolder]: 120/414 cut-off events. [2022-12-06 07:49:17,655 INFO L131 PetriNetUnfolder]: For 7048/7160 co-relation queries the response was YES. [2022-12-06 07:49:17,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 414 events. 120/414 cut-off events. For 7048/7160 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2722 event pairs, 2 based on Foata normal form. 28/439 useless extension candidates. Maximal degree in co-relation 2581. Up to 149 conditions per place. [2022-12-06 07:49:17,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 147 transitions, 2605 flow [2022-12-06 07:49:17,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 07:49:17,658 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:17,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 07:49:17,659 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 147 transitions, 2605 flow [2022-12-06 07:49:17,659 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 07:49:17,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:17,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:17,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 07:49:17,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 07:49:17,863 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2081964557, now seen corresponding path program 1 times [2022-12-06 07:49:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:17,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327051414] [2022-12-06 07:49:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327051414] [2022-12-06 07:49:18,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327051414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:18,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091555800] [2022-12-06 07:49:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:18,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:18,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:18,297 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:18,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 07:49:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:18,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 07:49:18,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:18,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:18,433 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 07:49:18,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:18,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 07:49:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:18,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:18,721 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-06 07:49:18,722 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 152 treesize of output 139 [2022-12-06 07:49:18,746 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-06 07:49:18,746 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 97 treesize of output 76 [2022-12-06 07:49:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:18,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091555800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:18,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:18,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:49:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453422006] [2022-12-06 07:49:18,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:18,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:49:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:18,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:49:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:49:18,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:49:18,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 147 transitions, 2605 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:18,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:18,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:49:18,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:19,365 INFO L130 PetriNetUnfolder]: 548/1080 cut-off events. [2022-12-06 07:49:19,365 INFO L131 PetriNetUnfolder]: For 24447/24520 co-relation queries the response was YES. [2022-12-06 07:49:19,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8869 conditions, 1080 events. 548/1080 cut-off events. For 24447/24520 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6213 event pairs, 157 based on Foata normal form. 22/1101 useless extension candidates. Maximal degree in co-relation 8039. Up to 846 conditions per place. [2022-12-06 07:49:19,372 INFO L137 encePairwiseOnDemand]: 9/29 looper letters, 137 selfloop transitions, 42 changer transitions 11/191 dead transitions. [2022-12-06 07:49:19,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 3407 flow [2022-12-06 07:49:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:49:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:49:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-12-06 07:49:19,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2827586206896552 [2022-12-06 07:49:19,376 INFO L175 Difference]: Start difference. First operand has 119 places, 147 transitions, 2605 flow. Second operand 10 states and 82 transitions. [2022-12-06 07:49:19,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 3407 flow [2022-12-06 07:49:19,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 191 transitions, 3398 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:19,411 INFO L231 Difference]: Finished difference. Result has 130 places, 155 transitions, 2874 flow [2022-12-06 07:49:19,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2600, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2874, PETRI_PLACES=130, PETRI_TRANSITIONS=155} [2022-12-06 07:49:19,411 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-06 07:49:19,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:19,411 INFO L89 Accepts]: Start accepts. Operand has 130 places, 155 transitions, 2874 flow [2022-12-06 07:49:19,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:19,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:19,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 155 transitions, 2874 flow [2022-12-06 07:49:19,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 155 transitions, 2874 flow [2022-12-06 07:49:19,453 INFO L130 PetriNetUnfolder]: 131/433 cut-off events. [2022-12-06 07:49:19,454 INFO L131 PetriNetUnfolder]: For 8123/8212 co-relation queries the response was YES. [2022-12-06 07:49:19,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 433 events. 131/433 cut-off events. For 8123/8212 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2830 event pairs, 2 based on Foata normal form. 21/451 useless extension candidates. Maximal degree in co-relation 3143. Up to 169 conditions per place. [2022-12-06 07:49:19,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 155 transitions, 2874 flow [2022-12-06 07:49:19,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 07:49:19,458 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:19,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 07:49:19,458 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 155 transitions, 2874 flow [2022-12-06 07:49:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:19,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:19,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:19,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:19,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:19,663 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash 842933033, now seen corresponding path program 1 times [2022-12-06 07:49:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:19,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98495880] [2022-12-06 07:49:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98495880] [2022-12-06 07:49:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98495880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001910703] [2022-12-06 07:49:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:19,821 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:19,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 07:49:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:19,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:49:19,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:19,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:19,956 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 19 treesize of output 21 [2022-12-06 07:49:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:20,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:20,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:20,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 07:49:20,051 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 25 treesize of output 18 [2022-12-06 07:49:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:20,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001910703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:20,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:20,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:49:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907619111] [2022-12-06 07:49:20,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:20,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:20,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:20,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=142, Unknown=3, NotChecked=0, Total=182 [2022-12-06 07:49:20,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:49:20,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 155 transitions, 2874 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:20,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:20,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:49:20,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:20,475 INFO L130 PetriNetUnfolder]: 539/1066 cut-off events. [2022-12-06 07:49:20,475 INFO L131 PetriNetUnfolder]: For 24944/25003 co-relation queries the response was YES. [2022-12-06 07:49:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9076 conditions, 1066 events. 539/1066 cut-off events. For 24944/25003 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6088 event pairs, 63 based on Foata normal form. 50/1116 useless extension candidates. Maximal degree in co-relation 8957. Up to 477 conditions per place. [2022-12-06 07:49:20,480 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 149 selfloop transitions, 45 changer transitions 0/195 dead transitions. [2022-12-06 07:49:20,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 195 transitions, 3635 flow [2022-12-06 07:49:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:49:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:49:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-06 07:49:20,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32567049808429116 [2022-12-06 07:49:20,481 INFO L175 Difference]: Start difference. First operand has 128 places, 155 transitions, 2874 flow. Second operand 9 states and 85 transitions. [2022-12-06 07:49:20,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 195 transitions, 3635 flow [2022-12-06 07:49:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 195 transitions, 3578 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 07:49:20,517 INFO L231 Difference]: Finished difference. Result has 132 places, 158 transitions, 2979 flow [2022-12-06 07:49:20,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=132, PETRI_TRANSITIONS=158} [2022-12-06 07:49:20,518 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 111 predicate places. [2022-12-06 07:49:20,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:20,518 INFO L89 Accepts]: Start accepts. Operand has 132 places, 158 transitions, 2979 flow [2022-12-06 07:49:20,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:20,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:20,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 158 transitions, 2979 flow [2022-12-06 07:49:20,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 158 transitions, 2979 flow [2022-12-06 07:49:20,561 INFO L130 PetriNetUnfolder]: 129/437 cut-off events. [2022-12-06 07:49:20,561 INFO L131 PetriNetUnfolder]: For 8828/8914 co-relation queries the response was YES. [2022-12-06 07:49:20,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 437 events. 129/437 cut-off events. For 8828/8914 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2912 event pairs, 2 based on Foata normal form. 17/451 useless extension candidates. Maximal degree in co-relation 3009. Up to 174 conditions per place. [2022-12-06 07:49:20,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 158 transitions, 2979 flow [2022-12-06 07:49:20,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 07:49:20,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:20,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 07:49:20,566 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 158 transitions, 2979 flow [2022-12-06 07:49:20,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:20,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:20,566 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:20,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:20,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:20,770 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1754713461, now seen corresponding path program 2 times [2022-12-06 07:49:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:20,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537561441] [2022-12-06 07:49:20,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:20,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537561441] [2022-12-06 07:49:20,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537561441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:20,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929516435] [2022-12-06 07:49:20,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:49:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:20,826 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:20,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 07:49:20,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 07:49:20,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:49:20,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 07:49:20,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:20,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:20,948 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 07:49:21,018 INFO L321 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-12-06 07:49:21,018 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 35 treesize of output 28 [2022-12-06 07:49:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:49:21,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:21,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929516435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:21,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:21,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 07:49:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056807221] [2022-12-06 07:49:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:21,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:49:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:49:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:49:21,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:49:21,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 158 transitions, 2979 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:21,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:21,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:49:21,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:21,272 INFO L130 PetriNetUnfolder]: 364/757 cut-off events. [2022-12-06 07:49:21,272 INFO L131 PetriNetUnfolder]: For 20195/20295 co-relation queries the response was YES. [2022-12-06 07:49:21,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6393 conditions, 757 events. 364/757 cut-off events. For 20195/20295 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4043 event pairs, 116 based on Foata normal form. 101/858 useless extension candidates. Maximal degree in co-relation 5940. Up to 306 conditions per place. [2022-12-06 07:49:21,276 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 127 selfloop transitions, 11 changer transitions 21/160 dead transitions. [2022-12-06 07:49:21,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 3097 flow [2022-12-06 07:49:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 07:49:21,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42758620689655175 [2022-12-06 07:49:21,277 INFO L175 Difference]: Start difference. First operand has 132 places, 158 transitions, 2979 flow. Second operand 5 states and 62 transitions. [2022-12-06 07:49:21,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 3097 flow [2022-12-06 07:49:21,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 160 transitions, 2830 flow, removed 26 selfloop flow, removed 13 redundant places. [2022-12-06 07:49:21,307 INFO L231 Difference]: Finished difference. Result has 125 places, 113 transitions, 1891 flow [2022-12-06 07:49:21,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1891, PETRI_PLACES=125, PETRI_TRANSITIONS=113} [2022-12-06 07:49:21,308 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 104 predicate places. [2022-12-06 07:49:21,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:21,308 INFO L89 Accepts]: Start accepts. Operand has 125 places, 113 transitions, 1891 flow [2022-12-06 07:49:21,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:21,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:21,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 113 transitions, 1891 flow [2022-12-06 07:49:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 113 transitions, 1891 flow [2022-12-06 07:49:21,334 INFO L130 PetriNetUnfolder]: 74/288 cut-off events. [2022-12-06 07:49:21,334 INFO L131 PetriNetUnfolder]: For 5276/5323 co-relation queries the response was YES. [2022-12-06 07:49:21,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 288 events. 74/288 cut-off events. For 5276/5323 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1680 event pairs, 1 based on Foata normal form. 18/305 useless extension candidates. Maximal degree in co-relation 1700. Up to 95 conditions per place. [2022-12-06 07:49:21,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 113 transitions, 1891 flow [2022-12-06 07:49:21,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 07:49:21,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_392| v_~q~0.base_267)) (.cse1 (* v_~q_back~0_507 4))) (and (= v_~q_back~0_505 (+ 3 v_~q_back~0_507)) (not (= (ite (and (<= 1 v_~q_back~0_505) (< v_~q_back~0_505 (+ v_~n~0_278 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_223| (+ v_~N~0_196 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_64| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_223| v_~N~0_196)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_267)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_223| 2) (not (= (ite (and (< v_~q_back~0_507 v_~n~0_278) (<= 0 v_~q_back~0_507)) 1 0) 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_505 4) (- 4) v_~q~0.offset_267)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_267 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_64| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|))) InVars {~q_back~0=v_~q_back~0_507, #memory_int=|v_#memory_int_392|, ~N~0=v_~N~0_196, ~q~0.base=v_~q~0.base_267, ~n~0=v_~n~0_278, ~q~0.offset=v_~q~0.offset_267} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_64|, ~q_back~0=v_~q_back~0_505, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_82|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_147|, ~N~0=v_~N~0_196, ~q~0.base=v_~q~0.base_267, ~q~0.offset=v_~q~0.offset_267, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_151|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_147|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_223|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|, #memory_int=|v_#memory_int_392|, ~n~0=v_~n~0_278, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_64|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:49:21,475 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:21,475 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:21,547 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:21,547 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:21,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [622] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_380| v_~q~0.base_257))) (let ((.cse1 (select .cse0 (+ (* 4 v_~q_front~0_351) v_~q~0.offset_257)))) (and (not (= (ite (and (< v_~q_back~0_482 v_~n~0_268) (<= 0 v_~q_back~0_482)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_207| (+ |v_thread1Thread1of1ForFork0_~i~0#1_208| 1)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_482 4) v_~q~0.offset_257)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|) (= (+ .cse1 v_~s~0_277 |v_thread2Thread1of1ForFork1_~j~0#1_163|) v_~s~0_275) (< |v_thread1Thread1of1ForFork0_~i~0#1_208| v_~N~0_186) (= (+ 2 v_~q_front~0_351) v_~q_front~0_349) (not (= (ite (and (< v_~q_front~0_351 v_~q_back~0_482) (< v_~q_front~0_351 v_~n~0_268) (<= 0 v_~q_front~0_351)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| (ite (and (< v_~q_front~0_349 (+ v_~q_back~0_481 1)) (<= 1 v_~q_front~0_349) (< v_~q_front~0_349 (+ v_~n~0_268 1))) 1 0)) (= v_~q_back~0_481 (+ v_~q_back~0_482 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|) (not (= .cse1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_163| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|) (= |v_thread2Thread1of1ForFork1_~j~0#1_163| (select .cse0 (+ (* 4 v_~q_front~0_349) (- 4) v_~q~0.offset_257)))))) InVars {~q_back~0=v_~q_back~0_482, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_208|, #memory_int=|v_#memory_int_380|, ~N~0=v_~N~0_186, ~q~0.base=v_~q~0.base_257, ~n~0=v_~n~0_268, ~q~0.offset=v_~q~0.offset_257, ~s~0=v_~s~0_277, ~q_front~0=v_~q_front~0_351} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_163|, ~q_back~0=v_~q_back~0_481, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_146|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_135|, ~N~0=v_~N~0_186, ~q~0.base=v_~q~0.base_257, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_146|, ~q~0.offset=v_~q~0.offset_257, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_139|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_135|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_207|, #memory_int=|v_#memory_int_380|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|, ~n~0=v_~n~0_268, ~s~0=v_~s~0_275, ~q_front~0=v_~q_front~0_349} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:22,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-2-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_430| v_~q~0.base_291))) (let ((.cse1 (select .cse2 (+ (* 4 v_~q_front~0_437) v_~q~0.offset_291))) (.cse0 (+ v_~n~0_302 1))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_227| 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 1) v_~N~0_214) (not (= 0 (ite (and (<= 1 v_~q_back~0_567) (< v_~q_back~0_567 .cse0)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|) (not (= .cse1 0)) (= (+ 2 v_~q_front~0_437) v_~q_front~0_436) (= (ite (= (select .cse2 (+ (* v_~q_back~0_567 4) (- 4) v_~q~0.offset_291)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244|) (= (+ 2 v_~q_back~0_569) v_~q_back~0_567) (= |v_thread1Thread1of1ForFork0_~i~0#1_259| (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 2)) (not (= 0 (ite (and (< v_~q_front~0_437 v_~q_back~0_569) (<= 0 v_~q_front~0_437) (< v_~q_front~0_437 v_~n~0_302)) 1 0))) (= (select .cse2 (+ (- 4) v_~q~0.offset_291 (* 4 v_~q_front~0_436))) |v_thread2Thread1of1ForFork1_~j~0#1_227|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_244|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_244| 0)) (= (+ .cse1 v_~s~0_362 |v_thread2Thread1of1ForFork1_~j~0#1_227|) v_~s~0_361) (not (= (ite (= (select .cse2 (+ (* v_~q_back~0_569 4) v_~q~0.offset_291)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| (ite (and (<= 1 v_~q_front~0_436) (< v_~q_front~0_436 v_~q_back~0_567) (< v_~q_front~0_436 .cse0)) 1 0))))) InVars {~q_back~0=v_~q_back~0_569, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, #memory_int=|v_#memory_int_430|, ~N~0=v_~N~0_214, ~q~0.base=v_~q~0.base_291, ~n~0=v_~n~0_302, ~q~0.offset=v_~q~0.offset_291, ~s~0=v_~s~0_362, ~q_front~0=v_~q_front~0_437} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_227|, ~q_back~0=v_~q_back~0_567, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_175|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_205|, ~N~0=v_~N~0_214, ~q~0.base=v_~q~0.base_291, ~q~0.offset=v_~q~0.offset_291, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_205|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_179|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_175|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_259|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_244|, #memory_int=|v_#memory_int_430|, ~n~0=v_~n~0_302, ~s~0=v_~s~0_361, ~q_front~0=v_~q_front~0_436} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:22,204 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:22,204 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:22,204 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:22,204 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:22,204 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:22,204 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:22,508 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:49:22,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1201 [2022-12-06 07:49:22,509 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 1915 flow [2022-12-06 07:49:22,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:22,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:22,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:22,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 07:49:22,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:22,709 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash 545248297, now seen corresponding path program 1 times [2022-12-06 07:49:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:22,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186356882] [2022-12-06 07:49:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:22,974 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 07:49:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186356882] [2022-12-06 07:49:22,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186356882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:22,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:22,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483263645] [2022-12-06 07:49:22,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:22,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:22,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:49:22,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 1915 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:49:22,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:22,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:49:22,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:23,130 INFO L130 PetriNetUnfolder]: 337/688 cut-off events. [2022-12-06 07:49:23,130 INFO L131 PetriNetUnfolder]: For 15859/15883 co-relation queries the response was YES. [2022-12-06 07:49:23,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5545 conditions, 688 events. 337/688 cut-off events. For 15859/15883 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3560 event pairs, 86 based on Foata normal form. 26/714 useless extension candidates. Maximal degree in co-relation 4812. Up to 593 conditions per place. [2022-12-06 07:49:23,134 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 100 selfloop transitions, 25 changer transitions 0/126 dead transitions. [2022-12-06 07:49:23,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 126 transitions, 2335 flow [2022-12-06 07:49:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 07:49:23,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33793103448275863 [2022-12-06 07:49:23,135 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 1915 flow. Second operand 5 states and 49 transitions. [2022-12-06 07:49:23,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 126 transitions, 2335 flow [2022-12-06 07:49:23,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 126 transitions, 2111 flow, removed 73 selfloop flow, removed 15 redundant places. [2022-12-06 07:49:23,157 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 1855 flow [2022-12-06 07:49:23,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1855, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2022-12-06 07:49:23,157 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:49:23,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:23,157 INFO L89 Accepts]: Start accepts. Operand has 109 places, 114 transitions, 1855 flow [2022-12-06 07:49:23,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:23,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:23,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 114 transitions, 1855 flow [2022-12-06 07:49:23,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 114 transitions, 1855 flow [2022-12-06 07:49:23,183 INFO L130 PetriNetUnfolder]: 82/303 cut-off events. [2022-12-06 07:49:23,184 INFO L131 PetriNetUnfolder]: For 3905/3970 co-relation queries the response was YES. [2022-12-06 07:49:23,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 303 events. 82/303 cut-off events. For 3905/3970 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1809 event pairs, 1 based on Foata normal form. 30/332 useless extension candidates. Maximal degree in co-relation 1699. Up to 103 conditions per place. [2022-12-06 07:49:23,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 114 transitions, 1855 flow [2022-12-06 07:49:23,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 07:49:23,186 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:23,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:49:23,187 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 114 transitions, 1855 flow [2022-12-06 07:49:23,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:49:23,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:23,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:23,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:49:23,187 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -978574720, now seen corresponding path program 1 times [2022-12-06 07:49:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:23,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258918348] [2022-12-06 07:49:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:23,229 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 07:49:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:23,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258918348] [2022-12-06 07:49:23,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258918348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:23,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:23,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:49:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590137673] [2022-12-06 07:49:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:23,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:49:23,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:49:23,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 114 transitions, 1855 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:23,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:23,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:49:23,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:23,373 INFO L130 PetriNetUnfolder]: 335/690 cut-off events. [2022-12-06 07:49:23,373 INFO L131 PetriNetUnfolder]: For 11714/11714 co-relation queries the response was YES. [2022-12-06 07:49:23,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 690 events. 335/690 cut-off events. For 11714/11714 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3595 event pairs, 128 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 4412. Up to 349 conditions per place. [2022-12-06 07:49:23,376 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 120 selfloop transitions, 6 changer transitions 0/127 dead transitions. [2022-12-06 07:49:23,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 127 transitions, 2195 flow [2022-12-06 07:49:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 07:49:23,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2022-12-06 07:49:23,377 INFO L175 Difference]: Start difference. First operand has 109 places, 114 transitions, 1855 flow. Second operand 4 states and 46 transitions. [2022-12-06 07:49:23,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 127 transitions, 2195 flow [2022-12-06 07:49:23,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 2175 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:49:23,392 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 1818 flow [2022-12-06 07:49:23,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1818, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2022-12-06 07:49:23,392 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 90 predicate places. [2022-12-06 07:49:23,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:23,393 INFO L89 Accepts]: Start accepts. Operand has 111 places, 113 transitions, 1818 flow [2022-12-06 07:49:23,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:23,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:23,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 113 transitions, 1818 flow [2022-12-06 07:49:23,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 113 transitions, 1818 flow [2022-12-06 07:49:23,419 INFO L130 PetriNetUnfolder]: 81/305 cut-off events. [2022-12-06 07:49:23,419 INFO L131 PetriNetUnfolder]: For 3903/3939 co-relation queries the response was YES. [2022-12-06 07:49:23,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 305 events. 81/305 cut-off events. For 3903/3939 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1834 event pairs, 1 based on Foata normal form. 22/327 useless extension candidates. Maximal degree in co-relation 1673. Up to 102 conditions per place. [2022-12-06 07:49:23,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 113 transitions, 1818 flow [2022-12-06 07:49:23,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 07:49:23,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:23,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:23,746 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:23,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 355 [2022-12-06 07:49:23,747 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 1850 flow [2022-12-06 07:49:23,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:23,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:23,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:23,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:49:23,747 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1456395772, now seen corresponding path program 1 times [2022-12-06 07:49:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:23,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884023937] [2022-12-06 07:49:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:23,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:24,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884023937] [2022-12-06 07:49:24,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884023937] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:24,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774081872] [2022-12-06 07:49:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:24,034 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:24,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 07:49:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:24,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:49:24,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:24,163 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 31 treesize of output 31 [2022-12-06 07:49:24,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:24,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:49:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:24,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:24,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:24,332 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 135 treesize of output 136 [2022-12-06 07:49:24,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:24,340 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 75 treesize of output 62 [2022-12-06 07:49:24,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:24,345 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 62 treesize of output 49 [2022-12-06 07:49:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:24,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774081872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:24,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:24,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:49:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668685688] [2022-12-06 07:49:24,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:24,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:49:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:24,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:49:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:49:24,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:49:24,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 1850 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:24,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:24,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:49:24,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:24,794 INFO L130 PetriNetUnfolder]: 343/715 cut-off events. [2022-12-06 07:49:24,794 INFO L131 PetriNetUnfolder]: For 12279/12300 co-relation queries the response was YES. [2022-12-06 07:49:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 715 events. 343/715 cut-off events. For 12279/12300 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3825 event pairs, 83 based on Foata normal form. 18/733 useless extension candidates. Maximal degree in co-relation 4664. Up to 608 conditions per place. [2022-12-06 07:49:24,798 INFO L137 encePairwiseOnDemand]: 11/30 looper letters, 106 selfloop transitions, 29 changer transitions 3/139 dead transitions. [2022-12-06 07:49:24,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 139 transitions, 2305 flow [2022-12-06 07:49:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:49:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:49:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-06 07:49:24,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 07:49:24,798 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 1850 flow. Second operand 8 states and 75 transitions. [2022-12-06 07:49:24,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 139 transitions, 2305 flow [2022-12-06 07:49:24,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 2298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:24,815 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 1937 flow [2022-12-06 07:49:24,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1937, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2022-12-06 07:49:24,816 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2022-12-06 07:49:24,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:24,816 INFO L89 Accepts]: Start accepts. Operand has 118 places, 114 transitions, 1937 flow [2022-12-06 07:49:24,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:24,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:24,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 114 transitions, 1937 flow [2022-12-06 07:49:24,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 114 transitions, 1937 flow [2022-12-06 07:49:24,844 INFO L130 PetriNetUnfolder]: 81/313 cut-off events. [2022-12-06 07:49:24,844 INFO L131 PetriNetUnfolder]: For 4308/4369 co-relation queries the response was YES. [2022-12-06 07:49:24,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 313 events. 81/313 cut-off events. For 4308/4369 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1949 event pairs, 1 based on Foata normal form. 29/342 useless extension candidates. Maximal degree in co-relation 1800. Up to 107 conditions per place. [2022-12-06 07:49:24,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 114 transitions, 1937 flow [2022-12-06 07:49:24,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 07:49:24,851 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:24,851 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:24,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:24,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:49:24,988 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 1927 flow [2022-12-06 07:49:24,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:24,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:24,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:24,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 07:49:25,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-06 07:49:25,192 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 689373885, now seen corresponding path program 1 times [2022-12-06 07:49:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:25,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794382324] [2022-12-06 07:49:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:25,249 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 07:49:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:25,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794382324] [2022-12-06 07:49:25,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794382324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:25,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:25,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627000586] [2022-12-06 07:49:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:25,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:25,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:25,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:49:25,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 1927 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:25,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:25,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:49:25,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:25,394 INFO L130 PetriNetUnfolder]: 268/562 cut-off events. [2022-12-06 07:49:25,394 INFO L131 PetriNetUnfolder]: For 10807/10851 co-relation queries the response was YES. [2022-12-06 07:49:25,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 562 events. 268/562 cut-off events. For 10807/10851 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2817 event pairs, 103 based on Foata normal form. 18/580 useless extension candidates. Maximal degree in co-relation 4132. Up to 349 conditions per place. [2022-12-06 07:49:25,397 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 109 selfloop transitions, 5 changer transitions 3/118 dead transitions. [2022-12-06 07:49:25,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 2075 flow [2022-12-06 07:49:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:49:25,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:49:25,398 INFO L175 Difference]: Start difference. First operand has 116 places, 113 transitions, 1927 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:49:25,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 2075 flow [2022-12-06 07:49:25,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 118 transitions, 1987 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 07:49:25,414 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 1559 flow [2022-12-06 07:49:25,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1559, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-12-06 07:49:25,414 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 07:49:25,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:25,414 INFO L89 Accepts]: Start accepts. Operand has 113 places, 97 transitions, 1559 flow [2022-12-06 07:49:25,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:25,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:25,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 97 transitions, 1559 flow [2022-12-06 07:49:25,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 97 transitions, 1559 flow [2022-12-06 07:49:25,436 INFO L130 PetriNetUnfolder]: 63/246 cut-off events. [2022-12-06 07:49:25,436 INFO L131 PetriNetUnfolder]: For 3181/3239 co-relation queries the response was YES. [2022-12-06 07:49:25,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 246 events. 63/246 cut-off events. For 3181/3239 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1396 event pairs, 1 based on Foata normal form. 26/272 useless extension candidates. Maximal degree in co-relation 1443. Up to 74 conditions per place. [2022-12-06 07:49:25,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 97 transitions, 1559 flow [2022-12-06 07:49:25,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 07:49:25,439 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:25,439 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:25,439 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:25,439 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:25,439 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:25,439 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:25,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:25,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 07:49:25,734 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 1586 flow [2022-12-06 07:49:25,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:25,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:25,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:25,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:49:25,734 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash -33509372, now seen corresponding path program 1 times [2022-12-06 07:49:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:25,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349787175] [2022-12-06 07:49:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:25,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:25,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349787175] [2022-12-06 07:49:25,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349787175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:25,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614485405] [2022-12-06 07:49:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:25,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:25,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:25,789 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:25,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 07:49:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:25,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:49:25,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:25,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 07:49:25,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:25,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614485405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:25,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:25,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:49:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454352985] [2022-12-06 07:49:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:25,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:25,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:49:25,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 1586 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:25,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:25,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:49:25,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:26,063 INFO L130 PetriNetUnfolder]: 259/541 cut-off events. [2022-12-06 07:49:26,063 INFO L131 PetriNetUnfolder]: For 9962/10037 co-relation queries the response was YES. [2022-12-06 07:49:26,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3950 conditions, 541 events. 259/541 cut-off events. For 9962/10037 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2680 event pairs, 98 based on Foata normal form. 23/564 useless extension candidates. Maximal degree in co-relation 3861. Up to 349 conditions per place. [2022-12-06 07:49:26,066 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 101 selfloop transitions, 1 changer transitions 5/108 dead transitions. [2022-12-06 07:49:26,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1860 flow [2022-12-06 07:49:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 07:49:26,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-06 07:49:26,067 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 1586 flow. Second operand 4 states and 45 transitions. [2022-12-06 07:49:26,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1860 flow [2022-12-06 07:49:26,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 1794 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 07:49:26,080 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 1476 flow [2022-12-06 07:49:26,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1476, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2022-12-06 07:49:26,081 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:49:26,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:26,081 INFO L89 Accepts]: Start accepts. Operand has 109 places, 95 transitions, 1476 flow [2022-12-06 07:49:26,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:26,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:26,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 95 transitions, 1476 flow [2022-12-06 07:49:26,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 95 transitions, 1476 flow [2022-12-06 07:49:26,112 INFO L130 PetriNetUnfolder]: 62/235 cut-off events. [2022-12-06 07:49:26,112 INFO L131 PetriNetUnfolder]: For 3237/3316 co-relation queries the response was YES. [2022-12-06 07:49:26,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 235 events. 62/235 cut-off events. For 3237/3316 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1314 event pairs, 1 based on Foata normal form. 33/268 useless extension candidates. Maximal degree in co-relation 1231. Up to 56 conditions per place. [2022-12-06 07:49:26,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 95 transitions, 1476 flow [2022-12-06 07:49:26,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 07:49:26,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:26,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:49:26,115 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 95 transitions, 1476 flow [2022-12-06 07:49:26,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:26,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:26,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:26,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:26,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:26,319 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash -51900758, now seen corresponding path program 1 times [2022-12-06 07:49:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:26,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246622325] [2022-12-06 07:49:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:26,612 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 07:49:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:26,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246622325] [2022-12-06 07:49:26,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246622325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:26,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:26,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030935143] [2022-12-06 07:49:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:26,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:49:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:49:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:49:26,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 07:49:26,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 95 transitions, 1476 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:49:26,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:26,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 07:49:26,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:26,763 INFO L130 PetriNetUnfolder]: 262/542 cut-off events. [2022-12-06 07:49:26,763 INFO L131 PetriNetUnfolder]: For 9439/9481 co-relation queries the response was YES. [2022-12-06 07:49:26,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 542 events. 262/542 cut-off events. For 9439/9481 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2645 event pairs, 94 based on Foata normal form. 13/555 useless extension candidates. Maximal degree in co-relation 3235. Up to 508 conditions per place. [2022-12-06 07:49:26,765 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 95 selfloop transitions, 8 changer transitions 2/106 dead transitions. [2022-12-06 07:49:26,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 1734 flow [2022-12-06 07:49:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 07:49:26,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 07:49:26,766 INFO L175 Difference]: Start difference. First operand has 106 places, 95 transitions, 1476 flow. Second operand 5 states and 42 transitions. [2022-12-06 07:49:26,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 1734 flow [2022-12-06 07:49:26,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 1718 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 07:49:26,778 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 1501 flow [2022-12-06 07:49:26,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1501, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2022-12-06 07:49:26,778 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:49:26,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:26,778 INFO L89 Accepts]: Start accepts. Operand has 109 places, 97 transitions, 1501 flow [2022-12-06 07:49:26,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:26,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:26,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 97 transitions, 1501 flow [2022-12-06 07:49:26,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 97 transitions, 1501 flow [2022-12-06 07:49:26,799 INFO L130 PetriNetUnfolder]: 62/240 cut-off events. [2022-12-06 07:49:26,799 INFO L131 PetriNetUnfolder]: For 3029/3083 co-relation queries the response was YES. [2022-12-06 07:49:26,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 240 events. 62/240 cut-off events. For 3029/3083 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1353 event pairs, 1 based on Foata normal form. 26/266 useless extension candidates. Maximal degree in co-relation 1310. Up to 56 conditions per place. [2022-12-06 07:49:26,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 97 transitions, 1501 flow [2022-12-06 07:49:26,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 07:49:26,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:26,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_444| v_~q~0.base_303)) (.cse2 (* v_~q_back~0_596 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_279| (+ v_~N~0_224 1)) (not (= (ite (let ((.cse0 (+ v_~q_back~0_596 1))) (and (< .cse0 v_~n~0_314) (<= 0 .cse0))) 1 0) 0)) (= (select .cse1 (+ (- 4) v_~q~0.offset_303 (* 4 v_~q_front~0_466))) |v_thread2Thread1of1ForFork1_~j~0#1_247|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_247| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_224| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260| 0)) (= (+ 2 v_~q_front~0_468) v_~q_front~0_466) (= v_~s~0_393 (+ (select .cse1 (+ (* 4 v_~q_front~0_468) v_~q~0.offset_303)) v_~s~0_395 |v_thread2Thread1of1ForFork1_~j~0#1_247|)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_303 .cse2)) 1) 1 0) 0)) (= v_~q_back~0_595 (+ 2 v_~q_back~0_596)) (not (= (ite (and (< v_~q_front~0_468 v_~q_back~0_595) (< v_~q_front~0_468 v_~n~0_314) (<= 0 v_~q_front~0_468)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_279| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_260| (ite (= (select .cse1 (+ v_~q~0.offset_303 4 .cse2)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_260| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_224| (ite (and (< v_~q_front~0_466 (+ v_~q_back~0_595 1)) (< v_~q_front~0_466 (+ v_~n~0_314 1)) (<= 1 v_~q_front~0_466)) 1 0)) (not (= (+ v_~s~0_395 |v_thread2Thread1of1ForFork1_~j~0#1_247|) v_~s~0_393)))) InVars {~q_back~0=v_~q_back~0_596, #memory_int=|v_#memory_int_444|, ~N~0=v_~N~0_224, ~q~0.base=v_~q~0.base_303, ~n~0=v_~n~0_314, ~q~0.offset=v_~q~0.offset_303, ~s~0=v_~s~0_395, ~q_front~0=v_~q_front~0_468} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_247|, ~q_back~0=v_~q_back~0_595, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_224|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_224|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_185|, ~N~0=v_~N~0_224, ~q~0.base=v_~q~0.base_303, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_224|, ~q~0.offset=v_~q~0.offset_303, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_260|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_189|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_185|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_279|, #memory_int=|v_#memory_int_444|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|, ~n~0=v_~n~0_314, ~s~0=v_~s~0_393, ~q_front~0=v_~q_front~0_466} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [656] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_446| v_~q~0.base_305))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|) (= (select .cse0 (+ v_~q~0.offset_305 (* 4 v_~q_front~0_475))) |v_thread2Thread1of1ForFork1_~j~0#1_251|) (= (+ 1 v_~q_front~0_475) v_~q_front~0_474) (= (+ v_~s~0_400 |v_thread2Thread1of1ForFork1_~j~0#1_251|) v_~s~0_399) (= |v_thread1Thread1of1ForFork0_#res#1.offset_98| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_228| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| (ite (= (select .cse0 (+ (* v_~q_back~0_600 4) v_~q~0.offset_305)) 0) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_251| 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_281| v_~N~0_226)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_228|) (= (ite (and (< v_~q_front~0_475 v_~q_back~0_599) (< v_~q_front~0_475 v_~n~0_316) (<= 0 v_~q_front~0_475)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262| 0)) (not (= (ite (and (< v_~q_back~0_600 v_~n~0_316) (<= 0 v_~q_back~0_600)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_98| 0) (= v_~q_back~0_599 (+ v_~q_back~0_600 1)))) InVars {~q_back~0=v_~q_back~0_600, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_281|, #memory_int=|v_#memory_int_446|, ~N~0=v_~N~0_226, ~q~0.base=v_~q~0.base_305, ~n~0=v_~n~0_316, ~q~0.offset=v_~q~0.offset_305, ~s~0=v_~s~0_400, ~q_front~0=v_~q_front~0_475} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_251|, ~q_back~0=v_~q_back~0_599, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_98|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_116|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_228|, ~N~0=v_~N~0_226, ~q~0.base=v_~q~0.base_305, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_228|, ~q~0.offset=v_~q~0.offset_305, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_281|, #memory_int=|v_#memory_int_446|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_116|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|, ~n~0=v_~n~0_316, ~s~0=v_~s~0_399, ~q_front~0=v_~q_front~0_474, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_98|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:26,957 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:26,957 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:27,485 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:27,485 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:27,814 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:49:27,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1037 [2022-12-06 07:49:27,815 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 96 transitions, 1547 flow [2022-12-06 07:49:27,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:49:27,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:27,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:27,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:49:27,815 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:27,815 INFO L85 PathProgramCache]: Analyzing trace with hash 147710832, now seen corresponding path program 1 times [2022-12-06 07:49:27,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223948237] [2022-12-06 07:49:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:28,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223948237] [2022-12-06 07:49:28,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223948237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:28,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911192571] [2022-12-06 07:49:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:28,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:28,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:28,195 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:28,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 07:49:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:28,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-06 07:49:28,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:28,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 07:49:28,324 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 07:49:28,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:28,363 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 30 treesize of output 30 [2022-12-06 07:49:28,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:28,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 07:49:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:28,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:28,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911192571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:28,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:28,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:49:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887359433] [2022-12-06 07:49:28,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:28,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:28,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:28,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=139, Unknown=2, NotChecked=0, Total=182 [2022-12-06 07:49:28,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:49:28,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 96 transitions, 1547 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 07:49:28,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:28,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:49:28,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:29,116 INFO L130 PetriNetUnfolder]: 258/538 cut-off events. [2022-12-06 07:49:29,116 INFO L131 PetriNetUnfolder]: For 9471/9502 co-relation queries the response was YES. [2022-12-06 07:49:29,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 538 events. 258/538 cut-off events. For 9471/9502 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2616 event pairs, 73 based on Foata normal form. 13/551 useless extension candidates. Maximal degree in co-relation 3651. Up to 471 conditions per place. [2022-12-06 07:49:29,119 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 85 selfloop transitions, 24 changer transitions 6/116 dead transitions. [2022-12-06 07:49:29,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 1841 flow [2022-12-06 07:49:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:49:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:49:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-12-06 07:49:29,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3173076923076923 [2022-12-06 07:49:29,119 INFO L175 Difference]: Start difference. First operand has 108 places, 96 transitions, 1547 flow. Second operand 8 states and 66 transitions. [2022-12-06 07:49:29,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 1841 flow [2022-12-06 07:49:29,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 1820 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 07:49:29,131 INFO L231 Difference]: Finished difference. Result has 113 places, 95 transitions, 1475 flow [2022-12-06 07:49:29,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1475, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2022-12-06 07:49:29,132 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 07:49:29,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:29,132 INFO L89 Accepts]: Start accepts. Operand has 113 places, 95 transitions, 1475 flow [2022-12-06 07:49:29,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:29,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:29,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 95 transitions, 1475 flow [2022-12-06 07:49:29,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 95 transitions, 1475 flow [2022-12-06 07:49:29,153 INFO L130 PetriNetUnfolder]: 67/252 cut-off events. [2022-12-06 07:49:29,154 INFO L131 PetriNetUnfolder]: For 3939/4011 co-relation queries the response was YES. [2022-12-06 07:49:29,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 252 events. 67/252 cut-off events. For 3939/4011 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1437 event pairs, 3 based on Foata normal form. 30/281 useless extension candidates. Maximal degree in co-relation 1477. Up to 65 conditions per place. [2022-12-06 07:49:29,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 95 transitions, 1475 flow [2022-12-06 07:49:29,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 07:49:29,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:29,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_426| v_~q~0.base_287))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_287 (* 4 v_~q_front~0_426))))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_219| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197| (ite (and (<= 1 v_~q_front~0_424) (< v_~q_front~0_424 (+ v_~q_back~0_563 1)) (< v_~q_front~0_424 (+ v_~n~0_298 1))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (= (+ .cse0 v_~s~0_351 |v_thread2Thread1of1ForFork1_~j~0#1_219|) v_~s~0_349) (= (+ 2 v_~q_front~0_426) v_~q_front~0_424) (= (select .cse1 (+ (- 4) (* 4 v_~q_front~0_424) v_~q~0.offset_287)) |v_thread2Thread1of1ForFork1_~j~0#1_219|) (not (= .cse0 0)) (not (= (ite (and (< v_~q_front~0_426 v_~n~0_298) (<= 0 v_~q_front~0_426) (< v_~q_front~0_426 v_~q_back~0_563)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_563, #memory_int=|v_#memory_int_426|, ~q~0.base=v_~q~0.base_287, ~n~0=v_~n~0_298, ~q~0.offset=v_~q~0.offset_287, ~s~0=v_~s~0_351, ~q_front~0=v_~q_front~0_426} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_219|, ~q_back~0=v_~q_back~0_563, #memory_int=|v_#memory_int_426|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_197|, ~q~0.base=v_~q~0.base_287, ~n~0=v_~n~0_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_197|, ~q~0.offset=v_~q~0.offset_287, ~s~0=v_~s~0_349, ~q_front~0=v_~q_front~0_424} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:29,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:29,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 372 [2022-12-06 07:49:29,504 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 1538 flow [2022-12-06 07:49:29,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 07:49:29,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:29,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:29,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:29,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:29,705 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1535768899, now seen corresponding path program 2 times [2022-12-06 07:49:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:29,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493561435] [2022-12-06 07:49:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:30,054 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 07:49:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493561435] [2022-12-06 07:49:30,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493561435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:30,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:30,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:49:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741983415] [2022-12-06 07:49:30,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:30,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:49:30,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:30,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:49:30,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:49:30,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:49:30,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 1538 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 07:49:30,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:30,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:49:30,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:30,211 INFO L130 PetriNetUnfolder]: 270/563 cut-off events. [2022-12-06 07:49:30,211 INFO L131 PetriNetUnfolder]: For 9466/9492 co-relation queries the response was YES. [2022-12-06 07:49:30,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 563 events. 270/563 cut-off events. For 9466/9492 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2761 event pairs, 60 based on Foata normal form. 11/574 useless extension candidates. Maximal degree in co-relation 3932. Up to 399 conditions per place. [2022-12-06 07:49:30,214 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 81 selfloop transitions, 28 changer transitions 0/110 dead transitions. [2022-12-06 07:49:30,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 1852 flow [2022-12-06 07:49:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 07:49:30,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.352 [2022-12-06 07:49:30,215 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 1538 flow. Second operand 5 states and 44 transitions. [2022-12-06 07:49:30,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 1852 flow [2022-12-06 07:49:30,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 1762 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-06 07:49:30,228 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 1542 flow [2022-12-06 07:49:30,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1542, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2022-12-06 07:49:30,228 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:49:30,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:30,228 INFO L89 Accepts]: Start accepts. Operand has 110 places, 98 transitions, 1542 flow [2022-12-06 07:49:30,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:30,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:30,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 98 transitions, 1542 flow [2022-12-06 07:49:30,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 98 transitions, 1542 flow [2022-12-06 07:49:30,251 INFO L130 PetriNetUnfolder]: 69/265 cut-off events. [2022-12-06 07:49:30,252 INFO L131 PetriNetUnfolder]: For 4449/4530 co-relation queries the response was YES. [2022-12-06 07:49:30,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 265 events. 69/265 cut-off events. For 4449/4530 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1545 event pairs, 6 based on Foata normal form. 34/298 useless extension candidates. Maximal degree in co-relation 1532. Up to 66 conditions per place. [2022-12-06 07:49:30,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 98 transitions, 1542 flow [2022-12-06 07:49:30,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 07:49:30,254 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:30,254 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:30,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:30,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:49:30,407 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 1563 flow [2022-12-06 07:49:30,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 07:49:30,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:30,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:30,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 07:49:30,407 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash 743211732, now seen corresponding path program 1 times [2022-12-06 07:49:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074244091] [2022-12-06 07:49:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:30,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074244091] [2022-12-06 07:49:30,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074244091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:30,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537565855] [2022-12-06 07:49:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:30,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:30,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:30,793 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:30,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 07:49:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:30,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 07:49:30,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:30,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:30,944 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 07:49:31,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:31,007 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 46 treesize of output 12 [2022-12-06 07:49:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:31,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:31,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:31,122 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 156 treesize of output 157 [2022-12-06 07:49:31,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:31,133 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 101 treesize of output 94 [2022-12-06 07:49:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:31,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537565855] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:31,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:31,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:49:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049170285] [2022-12-06 07:49:31,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:49:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:49:31,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:49:31,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:49:31,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 1563 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:31,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:31,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:49:31,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:31,885 INFO L130 PetriNetUnfolder]: 285/601 cut-off events. [2022-12-06 07:49:31,885 INFO L131 PetriNetUnfolder]: For 9693/9710 co-relation queries the response was YES. [2022-12-06 07:49:31,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 601 events. 285/601 cut-off events. For 9693/9710 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3076 event pairs, 49 based on Foata normal form. 18/615 useless extension candidates. Maximal degree in co-relation 4286. Up to 479 conditions per place. [2022-12-06 07:49:31,888 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 102 selfloop transitions, 28 changer transitions 6/137 dead transitions. [2022-12-06 07:49:31,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 137 transitions, 2069 flow [2022-12-06 07:49:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:49:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:49:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-12-06 07:49:31,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27384615384615385 [2022-12-06 07:49:31,889 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 1563 flow. Second operand 13 states and 89 transitions. [2022-12-06 07:49:31,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 137 transitions, 2069 flow [2022-12-06 07:49:31,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 2031 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 07:49:31,903 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 1668 flow [2022-12-06 07:49:31,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1668, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2022-12-06 07:49:31,904 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 07:49:31,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:31,904 INFO L89 Accepts]: Start accepts. Operand has 124 places, 102 transitions, 1668 flow [2022-12-06 07:49:31,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:31,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:31,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 102 transitions, 1668 flow [2022-12-06 07:49:31,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 102 transitions, 1668 flow [2022-12-06 07:49:31,929 INFO L130 PetriNetUnfolder]: 71/280 cut-off events. [2022-12-06 07:49:31,929 INFO L131 PetriNetUnfolder]: For 4764/4834 co-relation queries the response was YES. [2022-12-06 07:49:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 280 events. 71/280 cut-off events. For 4764/4834 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1663 event pairs, 8 based on Foata normal form. 29/307 useless extension candidates. Maximal degree in co-relation 1718. Up to 70 conditions per place. [2022-12-06 07:49:31,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 102 transitions, 1668 flow [2022-12-06 07:49:31,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 07:49:31,936 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:31,936 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:33,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L65-2-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_455| v_~q~0.base_311))) (and (= v_~q_front~0_493 (+ 1 v_~q_front~0_494)) (not (= 0 (ite (and (< v_~q_back~0_617 v_~n~0_322) (<= 0 v_~q_back~0_617)) 1 0))) (= (select .cse0 (+ (* 4 v_~q_front~0_494) v_~q~0.offset_311)) |v_thread2Thread1of1ForFork1_~j~0#1_265|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_617 4) v_~q~0.offset_311)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_104| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_289| v_~N~0_232)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_241| 0)) (= v_~q_back~0_616 (+ v_~q_back~0_617 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_104| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_265| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|) (= (+ v_~s~0_420 |v_thread2Thread1of1ForFork1_~j~0#1_265|) v_~s~0_419) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| (ite (and (<= 0 v_~q_front~0_494) (< v_~q_front~0_494 v_~n~0_322) (< v_~q_front~0_494 v_~q_back~0_617)) 1 0)))) InVars {~q_back~0=v_~q_back~0_617, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, #memory_int=|v_#memory_int_455|, ~N~0=v_~N~0_232, ~q~0.base=v_~q~0.base_311, ~n~0=v_~n~0_322, ~q~0.offset=v_~q~0.offset_311, ~s~0=v_~s~0_420, ~q_front~0=v_~q_front~0_494} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_265|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_104|, ~q_back~0=v_~q_back~0_616, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_241|, ~N~0=v_~N~0_232, ~q~0.base=v_~q~0.base_311, ~q~0.offset=v_~q~0.offset_311, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_241|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_122|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|, #memory_int=|v_#memory_int_455|, ~n~0=v_~n~0_322, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_104|, ~s~0=v_~s~0_419, ~q_front~0=v_~q_front~0_493} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:33,891 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:33,892 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:33,892 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:33,892 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:33,892 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:33,892 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:34,141 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:34,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2237 [2022-12-06 07:49:34,141 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 101 transitions, 1689 flow [2022-12-06 07:49:34,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:34,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:34,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:34,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:34,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:34,342 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash 835926819, now seen corresponding path program 1 times [2022-12-06 07:49:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:34,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010494399] [2022-12-06 07:49:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:34,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010494399] [2022-12-06 07:49:34,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010494399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:34,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720231608] [2022-12-06 07:49:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:34,394 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:34,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 07:49:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:34,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:49:34,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:34,528 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 07:49:34,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:34,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720231608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:34,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:34,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:49:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326539965] [2022-12-06 07:49:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:34,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:34,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:34,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 07:49:34,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 101 transitions, 1689 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 07:49:34,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:34,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 07:49:34,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:34,634 INFO L130 PetriNetUnfolder]: 267/560 cut-off events. [2022-12-06 07:49:34,634 INFO L131 PetriNetUnfolder]: For 10838/10871 co-relation queries the response was YES. [2022-12-06 07:49:34,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 560 events. 267/560 cut-off events. For 10838/10871 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2766 event pairs, 100 based on Foata normal form. 16/576 useless extension candidates. Maximal degree in co-relation 4123. Up to 386 conditions per place. [2022-12-06 07:49:34,637 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 105 selfloop transitions, 1 changer transitions 4/111 dead transitions. [2022-12-06 07:49:34,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 111 transitions, 1942 flow [2022-12-06 07:49:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 07:49:34,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:49:34,637 INFO L175 Difference]: Start difference. First operand has 122 places, 101 transitions, 1689 flow. Second operand 4 states and 45 transitions. [2022-12-06 07:49:34,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 111 transitions, 1942 flow [2022-12-06 07:49:34,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1838 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-06 07:49:34,651 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 1527 flow [2022-12-06 07:49:34,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1527, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2022-12-06 07:49:34,651 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 07:49:34,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:34,652 INFO L89 Accepts]: Start accepts. Operand has 115 places, 99 transitions, 1527 flow [2022-12-06 07:49:34,652 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:34,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:34,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 99 transitions, 1527 flow [2022-12-06 07:49:34,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 99 transitions, 1527 flow [2022-12-06 07:49:34,674 INFO L130 PetriNetUnfolder]: 66/263 cut-off events. [2022-12-06 07:49:34,674 INFO L131 PetriNetUnfolder]: For 4661/4737 co-relation queries the response was YES. [2022-12-06 07:49:34,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 263 events. 66/263 cut-off events. For 4661/4737 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1532 event pairs, 5 based on Foata normal form. 34/296 useless extension candidates. Maximal degree in co-relation 1491. Up to 63 conditions per place. [2022-12-06 07:49:34,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 99 transitions, 1527 flow [2022-12-06 07:49:34,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 07:49:34,676 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:34,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 07:49:34,677 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 99 transitions, 1527 flow [2022-12-06 07:49:34,677 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 07:49:34,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:34,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:34,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 07:49:34,877 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 179431310, now seen corresponding path program 1 times [2022-12-06 07:49:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:34,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337711081] [2022-12-06 07:49:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:34,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337711081] [2022-12-06 07:49:34,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337711081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508428038] [2022-12-06 07:49:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:34,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:34,933 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:34,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 07:49:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:35,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:49:35,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:35,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:35,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508428038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:35,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:35,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 07:49:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558924417] [2022-12-06 07:49:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:35,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:49:35,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:49:35,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 99 transitions, 1527 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:35,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:35,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:49:35,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:35,273 INFO L130 PetriNetUnfolder]: 262/550 cut-off events. [2022-12-06 07:49:35,273 INFO L131 PetriNetUnfolder]: For 10330/10365 co-relation queries the response was YES. [2022-12-06 07:49:35,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 550 events. 262/550 cut-off events. For 10330/10365 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2676 event pairs, 85 based on Foata normal form. 10/560 useless extension candidates. Maximal degree in co-relation 3757. Up to 386 conditions per place. [2022-12-06 07:49:35,276 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 101 selfloop transitions, 7 changer transitions 2/111 dead transitions. [2022-12-06 07:49:35,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 1802 flow [2022-12-06 07:49:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 07:49:35,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.376 [2022-12-06 07:49:35,276 INFO L175 Difference]: Start difference. First operand has 113 places, 99 transitions, 1527 flow. Second operand 5 states and 47 transitions. [2022-12-06 07:49:35,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 1802 flow [2022-12-06 07:49:35,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1795 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:49:35,290 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 1514 flow [2022-12-06 07:49:35,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1514, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2022-12-06 07:49:35,291 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 07:49:35,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:35,291 INFO L89 Accepts]: Start accepts. Operand has 114 places, 98 transitions, 1514 flow [2022-12-06 07:49:35,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:35,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:35,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 98 transitions, 1514 flow [2022-12-06 07:49:35,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 98 transitions, 1514 flow [2022-12-06 07:49:35,313 INFO L130 PetriNetUnfolder]: 65/260 cut-off events. [2022-12-06 07:49:35,313 INFO L131 PetriNetUnfolder]: For 4539/4620 co-relation queries the response was YES. [2022-12-06 07:49:35,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 260 events. 65/260 cut-off events. For 4539/4620 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1494 event pairs, 4 based on Foata normal form. 34/293 useless extension candidates. Maximal degree in co-relation 1332. Up to 63 conditions per place. [2022-12-06 07:49:35,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 98 transitions, 1514 flow [2022-12-06 07:49:35,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 07:49:35,315 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:35,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 07:49:35,316 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 1514 flow [2022-12-06 07:49:35,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:35,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:35,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:35,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:35,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 07:49:35,520 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash -240603722, now seen corresponding path program 1 times [2022-12-06 07:49:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:35,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071121420] [2022-12-06 07:49:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:35,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:35,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071121420] [2022-12-06 07:49:35,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071121420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:35,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253715702] [2022-12-06 07:49:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:35,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:35,845 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:35,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 07:49:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:35,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:49:35,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:36,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:49:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:36,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:36,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:36,131 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 30 [2022-12-06 07:49:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:36,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253715702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:36,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:36,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 07:49:36,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217198119] [2022-12-06 07:49:36,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:36,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:49:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:36,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:49:36,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:49:36,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 07:49:36,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 1514 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:36,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:36,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 07:49:36,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:36,515 INFO L130 PetriNetUnfolder]: 279/600 cut-off events. [2022-12-06 07:49:36,516 INFO L131 PetriNetUnfolder]: For 10622/10658 co-relation queries the response was YES. [2022-12-06 07:49:36,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 600 events. 279/600 cut-off events. For 10622/10658 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3099 event pairs, 55 based on Foata normal form. 41/641 useless extension candidates. Maximal degree in co-relation 3727. Up to 465 conditions per place. [2022-12-06 07:49:36,519 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 103 selfloop transitions, 36 changer transitions 6/146 dead transitions. [2022-12-06 07:49:36,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 146 transitions, 2130 flow [2022-12-06 07:49:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:49:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:49:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2022-12-06 07:49:36,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 07:49:36,520 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 1514 flow. Second operand 13 states and 96 transitions. [2022-12-06 07:49:36,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 146 transitions, 2130 flow [2022-12-06 07:49:36,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 146 transitions, 2120 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 07:49:36,537 INFO L231 Difference]: Finished difference. Result has 128 places, 109 transitions, 1754 flow [2022-12-06 07:49:36,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1754, PETRI_PLACES=128, PETRI_TRANSITIONS=109} [2022-12-06 07:49:36,537 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2022-12-06 07:49:36,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:36,537 INFO L89 Accepts]: Start accepts. Operand has 128 places, 109 transitions, 1754 flow [2022-12-06 07:49:36,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:36,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:36,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 109 transitions, 1754 flow [2022-12-06 07:49:36,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 109 transitions, 1754 flow [2022-12-06 07:49:36,585 INFO L130 PetriNetUnfolder]: 68/290 cut-off events. [2022-12-06 07:49:36,585 INFO L131 PetriNetUnfolder]: For 5298/5375 co-relation queries the response was YES. [2022-12-06 07:49:36,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 290 events. 68/290 cut-off events. For 5298/5375 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1791 event pairs, 5 based on Foata normal form. 33/322 useless extension candidates. Maximal degree in co-relation 1665. Up to 73 conditions per place. [2022-12-06 07:49:36,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 109 transitions, 1754 flow [2022-12-06 07:49:36,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 07:49:36,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:49:36,689 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:36,690 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:36,919 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:36,919 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:36,920 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:36,920 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:37,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:49:37,295 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,296 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,345 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,345 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:37,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:37,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:37,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_384| v_~q~0.base_261)) (.cse2 (* v_~q_back~0_492 4))) (and (not (= (ite (let ((.cse0 (+ v_~q_back~0_492 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_272))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|) (= (+ v_~s~0_286 |v_thread2Thread1of1ForFork1_~j~0#1_169|) v_~s~0_285) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_169| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (<= 0 v_~q_front~0_360) (< v_~q_front~0_360 v_~n~0_272) (< v_~q_front~0_360 v_~q_back~0_491)) 1 0)) (= (+ 2 v_~q_back~0_492) v_~q_back~0_491) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152| 0)) (= (+ 1 v_~q_front~0_360) v_~q_front~0_359) (= (select .cse1 (+ (* 4 v_~q_front~0_360) v_~q~0.offset_261)) |v_thread2Thread1of1ForFork1_~j~0#1_169|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_261)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_261 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (= |v_thread1Thread1of1ForFork0_~i~0#1_215| 2) (not (= (ite (and (< v_~q_back~0_492 v_~n~0_272) (<= 0 v_~q_back~0_492)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_215| (+ v_~N~0_190 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| 0)))) InVars {~q_back~0=v_~q_back~0_492, #memory_int=|v_#memory_int_384|, ~N~0=v_~N~0_190, ~q~0.base=v_~q~0.base_261, ~n~0=v_~n~0_272, ~q~0.offset=v_~q~0.offset_261, ~s~0=v_~s~0_286, ~q_front~0=v_~q_front~0_360} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_169|, ~q_back~0=v_~q_back~0_491, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_152|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_139|, ~N~0=v_~N~0_190, ~q~0.base=v_~q~0.base_261, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_152|, ~q~0.offset=v_~q~0.offset_261, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_143|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_139|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_215|, #memory_int=|v_#memory_int_384|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|, ~n~0=v_~n~0_272, ~s~0=v_~s~0_285, ~q_front~0=v_~q_front~0_359} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [683] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_498| v_~q~0.base_343))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_120| 0) (= (+ v_~q_back~0_677 1) v_~q_back~0_676) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303| 0)) (= (+ v_~s~0_480 |v_thread2Thread1of1ForFork1_~j~0#1_304|) v_~s~0_479) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_313| v_~N~0_252)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_120| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278| (ite (and (<= 0 v_~q_front~0_556) (< v_~q_front~0_556 v_~n~0_352) (< v_~q_front~0_556 v_~q_back~0_676)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_304| 0)) (= (+ 1 v_~q_front~0_556) v_~q_front~0_555) (not (= (ite (and (< v_~q_back~0_677 v_~n~0_352) (<= 0 v_~q_back~0_677)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303| (ite (= (select .cse0 (+ (* v_~q_back~0_677 4) v_~q~0.offset_343)) 0) 1 0)) (= (select .cse0 (+ v_~q~0.offset_343 (* 4 v_~q_front~0_556))) |v_thread2Thread1of1ForFork1_~j~0#1_304|))) InVars {~q_back~0=v_~q_back~0_677, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, #memory_int=|v_#memory_int_498|, ~N~0=v_~N~0_252, ~q~0.base=v_~q~0.base_343, ~n~0=v_~n~0_352, ~q~0.offset=v_~q~0.offset_343, ~s~0=v_~s~0_480, ~q_front~0=v_~q_front~0_556} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_304|, ~q_back~0=v_~q_back~0_676, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_120|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_138|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_278|, ~N~0=v_~N~0_252, ~q~0.base=v_~q~0.base_343, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_278|, ~q~0.offset=v_~q~0.offset_343, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, #memory_int=|v_#memory_int_498|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_138|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303|, ~n~0=v_~n~0_352, ~s~0=v_~s~0_479, ~q_front~0=v_~q_front~0_555, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_120|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:37,680 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,680 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,681 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,681 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,681 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,681 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,973 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,973 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,973 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,973 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,973 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:37,974 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:38,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [684] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_500| v_~q~0.base_345))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_681 4) v_~q~0.offset_345)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|) (= (+ v_~q_back~0_681 1) v_~q_back~0_680) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_315| v_~N~0_254)) (= (+ 1 v_~q_front~0_560) v_~q_front~0_559) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280| (ite (and (< v_~q_front~0_560 v_~n~0_354) (< v_~q_front~0_560 v_~q_back~0_680) (<= 0 v_~q_front~0_560)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_306| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_122| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280| 0)) (= v_~s~0_483 (+ v_~s~0_484 |v_thread2Thread1of1ForFork1_~j~0#1_306|)) (= (select .cse0 (+ (* 4 v_~q_front~0_560) v_~q~0.offset_345)) |v_thread2Thread1of1ForFork1_~j~0#1_306|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_122| 0) (not (= (ite (and (< v_~q_back~0_681 v_~n~0_354) (<= 0 v_~q_back~0_681)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_681, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_500|, ~N~0=v_~N~0_254, ~q~0.base=v_~q~0.base_345, ~n~0=v_~n~0_354, ~q~0.offset=v_~q~0.offset_345, ~s~0=v_~s~0_484, ~q_front~0=v_~q_front~0_560} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_306|, ~q_back~0=v_~q_back~0_680, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_122|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_140|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_280|, ~N~0=v_~N~0_254, ~q~0.base=v_~q~0.base_345, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_280|, ~q~0.offset=v_~q~0.offset_345, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|, ~n~0=v_~n~0_354, ~s~0=v_~s~0_483, ~q_front~0=v_~q_front~0_559, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_122|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:38,347 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:38,347 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:38,512 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 07:49:38,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1976 [2022-12-06 07:49:38,513 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 103 transitions, 1807 flow [2022-12-06 07:49:38,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:38,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:38,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:38,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:38,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 07:49:38,718 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:38,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1095701216, now seen corresponding path program 2 times [2022-12-06 07:49:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:38,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157354117] [2022-12-06 07:49:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157354117] [2022-12-06 07:49:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157354117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414076781] [2022-12-06 07:49:39,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:49:39,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:39,014 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:39,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 07:49:39,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:49:39,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:49:39,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:49:39,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:39,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:49:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:39,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:39,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:39,253 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 40 treesize of output 28 [2022-12-06 07:49:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:39,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414076781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:39,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:39,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:49:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718426785] [2022-12-06 07:49:39,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:39,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:49:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:39,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:49:39,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:49:39,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:49:39,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 103 transitions, 1807 flow. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:39,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:39,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:49:39,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:39,479 INFO L130 PetriNetUnfolder]: 248/536 cut-off events. [2022-12-06 07:49:39,479 INFO L131 PetriNetUnfolder]: For 11152/11182 co-relation queries the response was YES. [2022-12-06 07:49:39,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 536 events. 248/536 cut-off events. For 11152/11182 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2711 event pairs, 50 based on Foata normal form. 33/569 useless extension candidates. Maximal degree in co-relation 4020. Up to 441 conditions per place. [2022-12-06 07:49:39,483 INFO L137 encePairwiseOnDemand]: 12/34 looper letters, 84 selfloop transitions, 27 changer transitions 8/120 dead transitions. [2022-12-06 07:49:39,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 2074 flow [2022-12-06 07:49:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:49:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:49:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 07:49:39,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2689075630252101 [2022-12-06 07:49:39,485 INFO L175 Difference]: Start difference. First operand has 121 places, 103 transitions, 1807 flow. Second operand 7 states and 64 transitions. [2022-12-06 07:49:39,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 2074 flow [2022-12-06 07:49:39,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 1877 flow, removed 72 selfloop flow, removed 9 redundant places. [2022-12-06 07:49:39,505 INFO L231 Difference]: Finished difference. Result has 120 places, 101 transitions, 1587 flow [2022-12-06 07:49:39,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1587, PETRI_PLACES=120, PETRI_TRANSITIONS=101} [2022-12-06 07:49:39,506 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 07:49:39,506 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:39,506 INFO L89 Accepts]: Start accepts. Operand has 120 places, 101 transitions, 1587 flow [2022-12-06 07:49:39,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:39,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:39,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 101 transitions, 1587 flow [2022-12-06 07:49:39,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 101 transitions, 1587 flow [2022-12-06 07:49:39,529 INFO L130 PetriNetUnfolder]: 65/256 cut-off events. [2022-12-06 07:49:39,529 INFO L131 PetriNetUnfolder]: For 4088/4185 co-relation queries the response was YES. [2022-12-06 07:49:39,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 256 events. 65/256 cut-off events. For 4088/4185 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1466 event pairs, 2 based on Foata normal form. 41/297 useless extension candidates. Maximal degree in co-relation 1472. Up to 57 conditions per place. [2022-12-06 07:49:39,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 101 transitions, 1587 flow [2022-12-06 07:49:39,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 07:49:39,543 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:39,543 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:39,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [685] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_502| v_~q~0.base_347))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_124| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_317| v_~N~0_256)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_307| (ite (= (select .cse0 (+ (* v_~q_back~0_685 4) v_~q~0.offset_347)) 0) 1 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_564) v_~q~0.offset_347)) |v_thread2Thread1of1ForFork1_~j~0#1_308|) (not (= (ite (and (<= 0 v_~q_back~0_685) (< v_~q_back~0_685 v_~n~0_356)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| (ite (and (< v_~q_front~0_564 v_~q_back~0_684) (< v_~q_front~0_564 v_~n~0_356) (<= 0 v_~q_front~0_564)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|) (= (+ v_~q_back~0_685 1) v_~q_back~0_684) (= |v_thread1Thread1of1ForFork0_#res#1.base_124| 0) (= (+ v_~s~0_488 |v_thread2Thread1of1ForFork1_~j~0#1_308|) v_~s~0_487) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_307| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_308| 0)) (= (+ 1 v_~q_front~0_564) v_~q_front~0_563) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307| 0)))) InVars {~q_back~0=v_~q_back~0_685, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_317|, #memory_int=|v_#memory_int_502|, ~N~0=v_~N~0_256, ~q~0.base=v_~q~0.base_347, ~n~0=v_~n~0_356, ~q~0.offset=v_~q~0.offset_347, ~s~0=v_~s~0_488, ~q_front~0=v_~q_front~0_564} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_308|, ~q_back~0=v_~q_back~0_684, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_124|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_142|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_282|, ~N~0=v_~N~0_256, ~q~0.base=v_~q~0.base_347, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_282|, ~q~0.offset=v_~q~0.offset_347, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_307|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_317|, #memory_int=|v_#memory_int_502|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_142|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|, ~n~0=v_~n~0_356, ~s~0=v_~s~0_487, ~q_front~0=v_~q_front~0_563, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_124|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:39,597 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:39,597 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:39,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:39,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:40,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:40,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_488| v_~q~0.base_335))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_294| 0)) (= (+ v_~s~0_464 |v_thread2Thread1of1ForFork1_~j~0#1_294|) v_~s~0_463) (= (+ v_~q_back~0_665 1) v_~q_back~0_664) (not (= (ite (and (< v_~q_back~0_665 v_~n~0_344) (<= 0 v_~q_back~0_665)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_309| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_299| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_299|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_665 4) v_~q~0.offset_335)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_299|) (= |v_thread2Thread1of1ForFork1_~j~0#1_294| (select .cse0 (+ (* 4 v_~q_front~0_540) v_~q~0.offset_335))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| (ite (and (< v_~q_front~0_540 v_~n~0_344) (<= 0 v_~q_front~0_540) (< v_~q_front~0_540 v_~q_back~0_664)) 1 0)) (= (+ 1 v_~q_front~0_540) v_~q_front~0_539) (< |v_thread1Thread1of1ForFork0_~i~0#1_309| (+ v_~N~0_248 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_299| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268| 0)))) InVars {~q_back~0=v_~q_back~0_665, #memory_int=|v_#memory_int_488|, ~N~0=v_~N~0_248, ~q~0.base=v_~q~0.base_335, ~n~0=v_~n~0_344, ~q~0.offset=v_~q~0.offset_335, ~s~0=v_~s~0_464, ~q_front~0=v_~q_front~0_540} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_294|, ~q_back~0=v_~q_back~0_664, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_268|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_205|, ~N~0=v_~N~0_248, ~q~0.base=v_~q~0.base_335, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_268|, ~q~0.offset=v_~q~0.offset_335, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_299|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_209|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_205|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_309|, #memory_int=|v_#memory_int_488|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_299|, ~n~0=v_~n~0_344, ~s~0=v_~s~0_463, ~q_front~0=v_~q_front~0_539} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:40,078 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:40,078 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:40,078 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:40,078 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:40,078 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:40,078 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:40,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:40,302 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:40,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 797 [2022-12-06 07:49:40,303 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 1673 flow [2022-12-06 07:49:40,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:40,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:40,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:40,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:40,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:40,509 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1762199450, now seen corresponding path program 1 times [2022-12-06 07:49:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:40,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537783190] [2022-12-06 07:49:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:40,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537783190] [2022-12-06 07:49:40,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537783190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:40,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522034630] [2022-12-06 07:49:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:40,867 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:40,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 07:49:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:40,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:49:40,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:41,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:41,026 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 07:49:41,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:41,053 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 46 treesize of output 12 [2022-12-06 07:49:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:41,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:41,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:41,119 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 156 treesize of output 157 [2022-12-06 07:49:41,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:41,128 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 101 treesize of output 94 [2022-12-06 07:49:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:41,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522034630] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:41,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:41,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:49:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866694939] [2022-12-06 07:49:41,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:41,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:49:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:49:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:49:41,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 07:49:41,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 1673 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:41,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:41,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 07:49:41,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:41,503 INFO L130 PetriNetUnfolder]: 254/547 cut-off events. [2022-12-06 07:49:41,503 INFO L131 PetriNetUnfolder]: For 9475/9509 co-relation queries the response was YES. [2022-12-06 07:49:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 547 events. 254/547 cut-off events. For 9475/9509 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2831 event pairs, 49 based on Foata normal form. 31/578 useless extension candidates. Maximal degree in co-relation 4023. Up to 443 conditions per place. [2022-12-06 07:49:41,506 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 100 selfloop transitions, 17 changer transitions 9/127 dead transitions. [2022-12-06 07:49:41,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 127 transitions, 2129 flow [2022-12-06 07:49:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:49:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:49:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 07:49:41,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2744360902255639 [2022-12-06 07:49:41,508 INFO L175 Difference]: Start difference. First operand has 116 places, 100 transitions, 1673 flow. Second operand 7 states and 73 transitions. [2022-12-06 07:49:41,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 127 transitions, 2129 flow [2022-12-06 07:49:41,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 2008 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-06 07:49:41,527 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 1574 flow [2022-12-06 07:49:41,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1574, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2022-12-06 07:49:41,527 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 07:49:41,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:41,527 INFO L89 Accepts]: Start accepts. Operand has 115 places, 99 transitions, 1574 flow [2022-12-06 07:49:41,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:41,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:41,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 99 transitions, 1574 flow [2022-12-06 07:49:41,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 99 transitions, 1574 flow [2022-12-06 07:49:41,550 INFO L130 PetriNetUnfolder]: 67/263 cut-off events. [2022-12-06 07:49:41,550 INFO L131 PetriNetUnfolder]: For 4095/4199 co-relation queries the response was YES. [2022-12-06 07:49:41,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 263 events. 67/263 cut-off events. For 4095/4199 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1535 event pairs, 3 based on Foata normal form. 34/296 useless extension candidates. Maximal degree in co-relation 1488. Up to 60 conditions per place. [2022-12-06 07:49:41,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 99 transitions, 1574 flow [2022-12-06 07:49:41,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 07:49:41,557 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,557 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,557 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,557 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,557 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,557 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,790 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,791 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,791 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,791 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,791 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:41,791 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:42,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [673] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_480| v_~q~0.base_329))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_116| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_301| 1) (= v_~q_back~0_646 (+ 2 v_~q_back~0_648)) (not (= 0 (ite (and (< v_~q_back~0_648 v_~n~0_338) (<= 0 v_~q_back~0_648)) 1 0))) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_648 4) v_~q~0.offset_329)) 1) 1 0) 0)) (not (= (ite (and (<= 1 v_~q_back~0_646) (< v_~q_back~0_646 (+ v_~n~0_338 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_301| (+ v_~N~0_242 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| (ite (= (select .cse0 (+ (* v_~q_back~0_646 4) (- 4) v_~q~0.offset_329)) 0) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_116| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_301| v_~N~0_242)))) InVars {~q_back~0=v_~q_back~0_648, #memory_int=|v_#memory_int_480|, ~N~0=v_~N~0_242, ~q~0.base=v_~q~0.base_329, ~n~0=v_~n~0_338, ~q~0.offset=v_~q~0.offset_329} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_116|, ~q_back~0=v_~q_back~0_646, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_134|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_197|, ~N~0=v_~N~0_242, ~q~0.base=v_~q~0.base_329, ~q~0.offset=v_~q~0.offset_329, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_201|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_197|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_134|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|, #memory_int=|v_#memory_int_480|, ~n~0=v_~n~0_338, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_116|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [549] L108-6-->L92-2: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| v_~q~0.base_114) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|) (= |v_ULTIMATE.start_main_#t~pre12#1_45| |v_#pthreadsForks_34|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| v_~q~0.offset_114) (= (ite (<= 0 v_~N~0_77) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (store |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre12#1_45|)) |v_#memory_int_152|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, #memory_int=|v_#memory_int_153|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~q~0.base=v_~q~0.base_114, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~q~0.offset=v_~q~0.offset_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_45|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_43|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_43|, #memory_int=|v_#memory_int_152|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:49:42,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_485| v_~q~0.base_333)) (.cse1 (* v_~q_back~0_660 4))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_295| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_333 4)) 0) 1 0)) (not (= (ite (and (< v_~q_back~0_660 v_~n~0_342) (<= 0 v_~q_back~0_660)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_144| |v_#pthreadsForks_174|) (= |v_thread1Thread1of1ForFork0_~i~0#1_307| 1) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_333)) 1) 1 0))) (= (+ 2 v_~q_back~0_660) v_~q_back~0_658) (< |v_thread1Thread1of1ForFork0_~i~0#1_307| (+ v_~N~0_246 1)) (= (+ |v_#pthreadsForks_174| 1) |v_#pthreadsForks_173|) (not (= (ite (let ((.cse2 (+ v_~q_back~0_660 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_342))) 1 0) 0)) (= (store |v_#memory_int_485| |v_ULTIMATE.start_main_~#t2~0#1.base_108| (store (select |v_#memory_int_485| |v_ULTIMATE.start_main_~#t2~0#1.base_108|) |v_ULTIMATE.start_main_~#t2~0#1.offset_106| |v_ULTIMATE.start_main_#t~pre14#1_144|)) |v_#memory_int_484|) (= |v_thread1Thread1of1ForFork0_#res#1.base_118| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_307| v_~N~0_246)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_118| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_295|))) InVars {~q_back~0=v_~q_back~0_660, #pthreadsForks=|v_#pthreadsForks_174|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_106|, #memory_int=|v_#memory_int_485|, ~N~0=v_~N~0_246, ~q~0.base=v_~q~0.base_333, ~n~0=v_~n~0_342, ~q~0.offset=v_~q~0.offset_333, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_108|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_118|, ~q_back~0=v_~q_back~0_658, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_136|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_106|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_203|, ~N~0=v_~N~0_246, ~q~0.base=v_~q~0.base_333, ~q~0.offset=v_~q~0.offset_333, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_144|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_144|, #pthreadsForks=|v_#pthreadsForks_173|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_207|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_203|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_307|, #memory_int=|v_#memory_int_484|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_118|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_295|, ~n~0=v_~n~0_342, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_108|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_118|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [549] L108-6-->L92-2: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| v_~q~0.base_114) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|) (= |v_ULTIMATE.start_main_#t~pre12#1_45| |v_#pthreadsForks_34|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| v_~q~0.offset_114) (= (ite (<= 0 v_~N~0_77) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (store |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre12#1_45|)) |v_#memory_int_152|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, #memory_int=|v_#memory_int_153|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~q~0.base=v_~q~0.base_114, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~q~0.offset=v_~q~0.offset_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_45|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_43|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_43|, #memory_int=|v_#memory_int_152|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:49:42,441 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:49:42,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 915 [2022-12-06 07:49:42,442 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 1646 flow [2022-12-06 07:49:42,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:42,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:42,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:42,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:42,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:42,647 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 218061805, now seen corresponding path program 1 times [2022-12-06 07:49:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:42,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483835308] [2022-12-06 07:49:42,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:42,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:42,979 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 07:49:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:42,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483835308] [2022-12-06 07:49:42,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483835308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:42,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:42,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:49:42,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611359938] [2022-12-06 07:49:42,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:42,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:42,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:49:42,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 07:49:42,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:42,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:49:42,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:43,211 INFO L130 PetriNetUnfolder]: 244/521 cut-off events. [2022-12-06 07:49:43,211 INFO L131 PetriNetUnfolder]: For 9645/9710 co-relation queries the response was YES. [2022-12-06 07:49:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 521 events. 244/521 cut-off events. For 9645/9710 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2626 event pairs, 80 based on Foata normal form. 9/530 useless extension candidates. Maximal degree in co-relation 3609. Up to 472 conditions per place. [2022-12-06 07:49:43,214 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 93 selfloop transitions, 10 changer transitions 10/114 dead transitions. [2022-12-06 07:49:43,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 1912 flow [2022-12-06 07:49:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:49:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:49:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 07:49:43,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2625 [2022-12-06 07:49:43,215 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 1646 flow. Second operand 6 states and 63 transitions. [2022-12-06 07:49:43,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 114 transitions, 1912 flow [2022-12-06 07:49:43,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 114 transitions, 1808 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-12-06 07:49:43,229 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 1552 flow [2022-12-06 07:49:43,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1552, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2022-12-06 07:49:43,229 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:49:43,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:43,229 INFO L89 Accepts]: Start accepts. Operand has 110 places, 100 transitions, 1552 flow [2022-12-06 07:49:43,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:43,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:43,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 100 transitions, 1552 flow [2022-12-06 07:49:43,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 100 transitions, 1552 flow [2022-12-06 07:49:43,252 INFO L130 PetriNetUnfolder]: 67/256 cut-off events. [2022-12-06 07:49:43,252 INFO L131 PetriNetUnfolder]: For 3232/3326 co-relation queries the response was YES. [2022-12-06 07:49:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 256 events. 67/256 cut-off events. For 3232/3326 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1478 event pairs, 3 based on Foata normal form. 35/291 useless extension candidates. Maximal degree in co-relation 1436. Up to 58 conditions per place. [2022-12-06 07:49:43,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 100 transitions, 1552 flow [2022-12-06 07:49:43,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 07:49:43,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_511| v_~q~0.base_355)) (.cse2 (* 4 v_~q_front~0_590))) (let ((.cse3 (select .cse1 (+ .cse2 v_~q~0.offset_355)))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_326| 0)) (= (+ 2 v_~q_front~0_590) v_~q_front~0_588) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| (ite (let ((.cse0 (+ 1 v_~q_front~0_590))) (and (<= 0 .cse0) (< .cse0 v_~n~0_364) (< .cse0 v_~q_back~0_704))) 1 0)) (not (= (ite (and (< v_~q_front~0_590 v_~n~0_364) (< v_~q_front~0_590 v_~q_back~0_704) (<= 0 v_~q_front~0_590)) 1 0) 0)) (= (select .cse1 (+ .cse2 v_~q~0.offset_355 4)) |v_thread2Thread1of1ForFork1_~j~0#1_326|) (= (+ v_~s~0_515 |v_thread2Thread1of1ForFork1_~j~0#1_326| .cse3) v_~s~0_513) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299| 0)) (not (= 0 .cse3))))) InVars {~q_back~0=v_~q_back~0_704, #memory_int=|v_#memory_int_511|, ~q~0.base=v_~q~0.base_355, ~n~0=v_~n~0_364, ~q~0.offset=v_~q~0.offset_355, ~s~0=v_~s~0_515, ~q_front~0=v_~q_front~0_590} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_326|, ~q_back~0=v_~q_back~0_704, #memory_int=|v_#memory_int_511|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_299|, ~q~0.base=v_~q~0.base_355, ~n~0=v_~n~0_364, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_299|, ~q~0.offset=v_~q~0.offset_355, ~s~0=v_~s~0_513, ~q_front~0=v_~q_front~0_588} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [697] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_517| v_~q~0.base_361))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324| (ite (= (select .cse0 (+ (* v_~q_back~0_715 4) v_~q~0.offset_361)) 0) 1 0)) (= v_~q_back~0_714 (+ v_~q_back~0_715 1)) (= (select .cse0 (+ (* 4 v_~q_front~0_605) v_~q~0.offset_361)) |v_thread2Thread1of1ForFork1_~j~0#1_336|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_138| 0) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_336| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324| 0)) (not (= (ite (and (<= 0 v_~q_back~0_715) (< v_~q_back~0_715 v_~n~0_370)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_138| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309| 0)) (= (+ v_~s~0_530 |v_thread2Thread1of1ForFork1_~j~0#1_336|) v_~s~0_529) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309| (ite (and (< v_~q_front~0_605 v_~n~0_370) (< v_~q_front~0_605 v_~q_back~0_714) (<= 0 v_~q_front~0_605)) 1 0)) (= (+ 1 v_~q_front~0_605) v_~q_front~0_604) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_331| v_~N~0_268)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|))) InVars {~q_back~0=v_~q_back~0_715, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_517|, ~N~0=v_~N~0_268, ~q~0.base=v_~q~0.base_361, ~n~0=v_~n~0_370, ~q~0.offset=v_~q~0.offset_361, ~s~0=v_~s~0_530, ~q_front~0=v_~q_front~0_605} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_336|, ~q_back~0=v_~q_back~0_714, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_138|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_156|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_309|, ~N~0=v_~N~0_268, ~q~0.base=v_~q~0.base_361, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_309|, ~q~0.offset=v_~q~0.offset_361, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_517|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_156|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324|, ~n~0=v_~n~0_370, ~s~0=v_~s~0_529, ~q_front~0=v_~q_front~0_604, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_138|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:43,255 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:43,255 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:43,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:43,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 360 [2022-12-06 07:49:43,589 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 1567 flow [2022-12-06 07:49:43,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 07:49:43,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:43,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:43,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:49:43,589 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 398901620, now seen corresponding path program 1 times [2022-12-06 07:49:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:43,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086768029] [2022-12-06 07:49:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:43,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086768029] [2022-12-06 07:49:43,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086768029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:43,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095649488] [2022-12-06 07:49:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:43,653 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:43,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 07:49:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:43,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:49:43,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:43,793 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 07:49:43,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:43,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095649488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:43,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:43,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:49:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987873728] [2022-12-06 07:49:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:43,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:43,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:43,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 07:49:43,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 1567 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:43,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:43,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 07:49:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:43,908 INFO L130 PetriNetUnfolder]: 237/509 cut-off events. [2022-12-06 07:49:43,908 INFO L131 PetriNetUnfolder]: For 8162/8210 co-relation queries the response was YES. [2022-12-06 07:49:43,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 509 events. 237/509 cut-off events. For 8162/8210 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2557 event pairs, 84 based on Foata normal form. 18/527 useless extension candidates. Maximal degree in co-relation 3471. Up to 431 conditions per place. [2022-12-06 07:49:43,911 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 101 selfloop transitions, 1 changer transitions 2/105 dead transitions. [2022-12-06 07:49:43,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 1732 flow [2022-12-06 07:49:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:49:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:49:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 07:49:43,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 07:49:43,912 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 1567 flow. Second operand 3 states and 52 transitions. [2022-12-06 07:49:43,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 1732 flow [2022-12-06 07:49:43,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 1704 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 07:49:43,924 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 1422 flow [2022-12-06 07:49:43,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1422, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2022-12-06 07:49:43,924 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 07:49:43,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:43,924 INFO L89 Accepts]: Start accepts. Operand has 107 places, 96 transitions, 1422 flow [2022-12-06 07:49:43,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:43,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:43,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 96 transitions, 1422 flow [2022-12-06 07:49:43,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 96 transitions, 1422 flow [2022-12-06 07:49:43,945 INFO L130 PetriNetUnfolder]: 64/249 cut-off events. [2022-12-06 07:49:43,945 INFO L131 PetriNetUnfolder]: For 3176/3270 co-relation queries the response was YES. [2022-12-06 07:49:43,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 249 events. 64/249 cut-off events. For 3176/3270 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1432 event pairs, 2 based on Foata normal form. 35/284 useless extension candidates. Maximal degree in co-relation 1318. Up to 57 conditions per place. [2022-12-06 07:49:43,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 96 transitions, 1422 flow [2022-12-06 07:49:43,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 07:49:43,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_387| v_~q~0.base_263)) (.cse1 (* v_~q_back~0_496 4))) (and (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_263)) 1) 1 0))) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_263 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_202|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_202| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|) (= |v_thread1Thread1of1ForFork0_~i~0#1_217| 2) (= (+ 2 v_~q_back~0_496) v_~q_back~0_495) (= (store |v_#memory_int_387| |v_ULTIMATE.start_main_~#t2~0#1.base_100| (store (select |v_#memory_int_387| |v_ULTIMATE.start_main_~#t2~0#1.base_100|) |v_ULTIMATE.start_main_~#t2~0#1.offset_98| |v_ULTIMATE.start_main_#t~pre14#1_118|)) |v_#memory_int_386|) (= (+ |v_#pthreadsForks_149| 1) |v_#pthreadsForks_148|) (= |v_ULTIMATE.start_main_#t~pre14#1_118| |v_#pthreadsForks_149|) (not (= (ite (let ((.cse2 (+ v_~q_back~0_496 1))) (and (< .cse2 v_~n~0_274) (<= 0 .cse2))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_217| (+ v_~N~0_192 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202| 0)) (not (= (ite (and (<= 0 v_~q_back~0_496) (< v_~q_back~0_496 v_~n~0_274)) 1 0) 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_149|, ~q_back~0=v_~q_back~0_496, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_98|, #memory_int=|v_#memory_int_387|, ~N~0=v_~N~0_192, ~q~0.base=v_~q~0.base_263, ~n~0=v_~n~0_274, ~q~0.offset=v_~q~0.offset_263, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_100|} OutVars{~q_back~0=v_~q_back~0_495, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_98|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_141|, ~N~0=v_~N~0_192, ~q~0.base=v_~q~0.base_263, ~q~0.offset=v_~q~0.offset_263, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_125|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_202|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_118|, #pthreadsForks=|v_#pthreadsForks_148|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_145|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_217|, #memory_int=|v_#memory_int_386|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|, ~n~0=v_~n~0_274, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_100|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:49:44,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:44,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 07:49:44,186 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 1437 flow [2022-12-06 07:49:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:44,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:44,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:44,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:44,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:44,387 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1256132338, now seen corresponding path program 1 times [2022-12-06 07:49:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:44,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415754567] [2022-12-06 07:49:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:44,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415754567] [2022-12-06 07:49:44,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415754567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:44,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266788315] [2022-12-06 07:49:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:44,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:44,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:44,681 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:44,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 07:49:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:44,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:49:44,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:44,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:44,848 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 07:49:44,857 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 07:49:44,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:44,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266788315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:44,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:44,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 07:49:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93585924] [2022-12-06 07:49:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:44,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:49:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:49:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:49:44,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 07:49:44,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 1437 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:44,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:44,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 07:49:44,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:45,012 INFO L130 PetriNetUnfolder]: 245/513 cut-off events. [2022-12-06 07:49:45,012 INFO L131 PetriNetUnfolder]: For 8352/8374 co-relation queries the response was YES. [2022-12-06 07:49:45,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 513 events. 245/513 cut-off events. For 8352/8374 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2496 event pairs, 40 based on Foata normal form. 28/540 useless extension candidates. Maximal degree in co-relation 3425. Up to 332 conditions per place. [2022-12-06 07:49:45,014 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 70 selfloop transitions, 41 changer transitions 0/112 dead transitions. [2022-12-06 07:49:45,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 112 transitions, 1813 flow [2022-12-06 07:49:45,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 07:49:45,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2022-12-06 07:49:45,015 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 1437 flow. Second operand 4 states and 50 transitions. [2022-12-06 07:49:45,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 112 transitions, 1813 flow [2022-12-06 07:49:45,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 112 transitions, 1806 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:49:45,026 INFO L231 Difference]: Finished difference. Result has 108 places, 100 transitions, 1619 flow [2022-12-06 07:49:45,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1619, PETRI_PLACES=108, PETRI_TRANSITIONS=100} [2022-12-06 07:49:45,027 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 87 predicate places. [2022-12-06 07:49:45,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:45,027 INFO L89 Accepts]: Start accepts. Operand has 108 places, 100 transitions, 1619 flow [2022-12-06 07:49:45,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:45,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:45,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 1619 flow [2022-12-06 07:49:45,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 1619 flow [2022-12-06 07:49:45,064 INFO L130 PetriNetUnfolder]: 67/257 cut-off events. [2022-12-06 07:49:45,064 INFO L131 PetriNetUnfolder]: For 3674/3756 co-relation queries the response was YES. [2022-12-06 07:49:45,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 257 events. 67/257 cut-off events. For 3674/3756 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1469 event pairs, 3 based on Foata normal form. 36/293 useless extension candidates. Maximal degree in co-relation 1470. Up to 59 conditions per place. [2022-12-06 07:49:45,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 1619 flow [2022-12-06 07:49:45,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 07:49:45,066 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:45,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 07:49:45,066 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 100 transitions, 1619 flow [2022-12-06 07:49:45,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:45,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:45,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:45,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:45,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-06 07:49:45,271 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1426880937, now seen corresponding path program 1 times [2022-12-06 07:49:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:45,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512499072] [2022-12-06 07:49:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:45,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512499072] [2022-12-06 07:49:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512499072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582822347] [2022-12-06 07:49:45,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:45,356 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:45,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 07:49:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:45,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 07:49:45,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:45,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:49:45,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582822347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:45,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:49:45,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 07:49:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679496934] [2022-12-06 07:49:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:45,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:49:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:45,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:49:45,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:49:45,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 07:49:45,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 100 transitions, 1619 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:45,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:45,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 07:49:45,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:45,640 INFO L130 PetriNetUnfolder]: 230/479 cut-off events. [2022-12-06 07:49:45,640 INFO L131 PetriNetUnfolder]: For 9046/9146 co-relation queries the response was YES. [2022-12-06 07:49:45,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 479 events. 230/479 cut-off events. For 9046/9146 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2299 event pairs, 71 based on Foata normal form. 29/508 useless extension candidates. Maximal degree in co-relation 3366. Up to 435 conditions per place. [2022-12-06 07:49:45,642 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 87 selfloop transitions, 0 changer transitions 18/106 dead transitions. [2022-12-06 07:49:45,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 1793 flow [2022-12-06 07:49:45,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 07:49:45,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 07:49:45,643 INFO L175 Difference]: Start difference. First operand has 108 places, 100 transitions, 1619 flow. Second operand 5 states and 54 transitions. [2022-12-06 07:49:45,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 1793 flow [2022-12-06 07:49:45,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 106 transitions, 1738 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:49:45,655 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 1353 flow [2022-12-06 07:49:45,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1353, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2022-12-06 07:49:45,655 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:49:45,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:45,655 INFO L89 Accepts]: Start accepts. Operand has 110 places, 88 transitions, 1353 flow [2022-12-06 07:49:45,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:45,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:45,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 88 transitions, 1353 flow [2022-12-06 07:49:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 1353 flow [2022-12-06 07:49:45,674 INFO L130 PetriNetUnfolder]: 62/218 cut-off events. [2022-12-06 07:49:45,674 INFO L131 PetriNetUnfolder]: For 3242/3328 co-relation queries the response was YES. [2022-12-06 07:49:45,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 218 events. 62/218 cut-off events. For 3242/3328 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1163 event pairs, 3 based on Foata normal form. 38/256 useless extension candidates. Maximal degree in co-relation 1210. Up to 55 conditions per place. [2022-12-06 07:49:45,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 88 transitions, 1353 flow [2022-12-06 07:49:45,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 07:49:45,676 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:45,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:49:45,676 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 1353 flow [2022-12-06 07:49:45,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:45,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:45,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:45,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:45,877 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1413979856, now seen corresponding path program 1 times [2022-12-06 07:49:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:45,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665018162] [2022-12-06 07:49:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:46,258 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 07:49:46,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:46,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665018162] [2022-12-06 07:49:46,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665018162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:46,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059014125] [2022-12-06 07:49:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:46,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:46,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:46,260 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:46,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 07:49:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:46,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:49:46,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:46,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:46,422 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 07:49:46,451 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 07:49:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:49:46,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:46,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:46,522 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 86 treesize of output 74 [2022-12-06 07:49:46,526 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 57 treesize of output 51 [2022-12-06 07:49:46,528 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 51 treesize of output 45 [2022-12-06 07:49:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:49:46,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059014125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:46,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:46,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-06 07:49:46,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468082423] [2022-12-06 07:49:46,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:46,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:49:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:46,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:49:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:49:46,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:49:46,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 1353 flow. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 07:49:46,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:46,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:49:46,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:46,987 INFO L130 PetriNetUnfolder]: 254/514 cut-off events. [2022-12-06 07:49:46,987 INFO L131 PetriNetUnfolder]: For 8434/8466 co-relation queries the response was YES. [2022-12-06 07:49:46,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 514 events. 254/514 cut-off events. For 8434/8466 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2458 event pairs, 36 based on Foata normal form. 34/548 useless extension candidates. Maximal degree in co-relation 3598. Up to 419 conditions per place. [2022-12-06 07:49:46,990 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 98 selfloop transitions, 25 changer transitions 4/128 dead transitions. [2022-12-06 07:49:46,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 128 transitions, 1947 flow [2022-12-06 07:49:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:49:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:49:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-12-06 07:49:46,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2827586206896552 [2022-12-06 07:49:46,991 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 1353 flow. Second operand 10 states and 82 transitions. [2022-12-06 07:49:46,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 128 transitions, 1947 flow [2022-12-06 07:49:47,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1835 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-12-06 07:49:47,002 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 1521 flow [2022-12-06 07:49:47,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1521, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2022-12-06 07:49:47,003 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 65 predicate places. [2022-12-06 07:49:47,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:47,003 INFO L89 Accepts]: Start accepts. Operand has 86 places, 100 transitions, 1521 flow [2022-12-06 07:49:47,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:47,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:47,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 100 transitions, 1521 flow [2022-12-06 07:49:47,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 100 transitions, 1521 flow [2022-12-06 07:49:47,023 INFO L130 PetriNetUnfolder]: 70/253 cut-off events. [2022-12-06 07:49:47,023 INFO L131 PetriNetUnfolder]: For 2952/3049 co-relation queries the response was YES. [2022-12-06 07:49:47,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 253 events. 70/253 cut-off events. For 2952/3049 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1411 event pairs, 5 based on Foata normal form. 45/298 useless extension candidates. Maximal degree in co-relation 1279. Up to 60 conditions per place. [2022-12-06 07:49:47,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 100 transitions, 1521 flow [2022-12-06 07:49:47,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 07:49:47,029 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:47,029 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:47,215 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:47,215 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:47,291 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:47,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 288 [2022-12-06 07:49:47,291 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 98 transitions, 1499 flow [2022-12-06 07:49:47,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 07:49:47,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:47,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:47,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-06 07:49:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:47,492 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1378661204, now seen corresponding path program 1 times [2022-12-06 07:49:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:47,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554473346] [2022-12-06 07:49:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:47,555 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 07:49:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554473346] [2022-12-06 07:49:47,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554473346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:47,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:47,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:49:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094758507] [2022-12-06 07:49:47,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:47,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:49:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:49:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:47,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 07:49:47,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 98 transitions, 1499 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:47,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:47,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 07:49:47,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:47,686 INFO L130 PetriNetUnfolder]: 366/721 cut-off events. [2022-12-06 07:49:47,686 INFO L131 PetriNetUnfolder]: For 9883/10004 co-relation queries the response was YES. [2022-12-06 07:49:47,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 721 events. 366/721 cut-off events. For 9883/10004 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3760 event pairs, 14 based on Foata normal form. 76/797 useless extension candidates. Maximal degree in co-relation 4707. Up to 308 conditions per place. [2022-12-06 07:49:47,689 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 74 selfloop transitions, 64 changer transitions 12/151 dead transitions. [2022-12-06 07:49:47,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 151 transitions, 2415 flow [2022-12-06 07:49:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 07:49:47,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43125 [2022-12-06 07:49:47,690 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 1499 flow. Second operand 5 states and 69 transitions. [2022-12-06 07:49:47,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 151 transitions, 2415 flow [2022-12-06 07:49:47,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 151 transitions, 2323 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-12-06 07:49:47,701 INFO L231 Difference]: Finished difference. Result has 84 places, 118 transitions, 1970 flow [2022-12-06 07:49:47,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1970, PETRI_PLACES=84, PETRI_TRANSITIONS=118} [2022-12-06 07:49:47,702 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 63 predicate places. [2022-12-06 07:49:47,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:47,702 INFO L89 Accepts]: Start accepts. Operand has 84 places, 118 transitions, 1970 flow [2022-12-06 07:49:47,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:47,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:47,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 118 transitions, 1970 flow [2022-12-06 07:49:47,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 118 transitions, 1970 flow [2022-12-06 07:49:47,727 INFO L130 PetriNetUnfolder]: 93/308 cut-off events. [2022-12-06 07:49:47,727 INFO L131 PetriNetUnfolder]: For 3730/3877 co-relation queries the response was YES. [2022-12-06 07:49:47,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 308 events. 93/308 cut-off events. For 3730/3877 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1761 event pairs, 3 based on Foata normal form. 60/366 useless extension candidates. Maximal degree in co-relation 1756. Up to 95 conditions per place. [2022-12-06 07:49:47,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 118 transitions, 1970 flow [2022-12-06 07:49:47,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 07:49:47,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:47,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:49:47,730 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 118 transitions, 1970 flow [2022-12-06 07:49:47,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:47,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:47,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:47,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 07:49:47,730 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:47,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1977543985, now seen corresponding path program 1 times [2022-12-06 07:49:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:47,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548598040] [2022-12-06 07:49:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548598040] [2022-12-06 07:49:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548598040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678857304] [2022-12-06 07:49:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:48,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:48,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:48,215 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:48,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 07:49:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:48,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 07:49:48,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:48,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:48,388 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 07:49:48,439 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 07:49:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:48,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:48,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:48,535 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 86 treesize of output 74 [2022-12-06 07:49:48,538 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 57 treesize of output 51 [2022-12-06 07:49:48,540 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 51 treesize of output 45 [2022-12-06 07:49:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678857304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:48,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:48,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:49:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828584170] [2022-12-06 07:49:48,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:48,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:49:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:49:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:49:48,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:49:48,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 118 transitions, 1970 flow. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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 07:49:48,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:48,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:49:48,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:49,124 INFO L130 PetriNetUnfolder]: 361/718 cut-off events. [2022-12-06 07:49:49,125 INFO L131 PetriNetUnfolder]: For 9872/9904 co-relation queries the response was YES. [2022-12-06 07:49:49,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 718 events. 361/718 cut-off events. For 9872/9904 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3683 event pairs, 54 based on Foata normal form. 35/752 useless extension candidates. Maximal degree in co-relation 5157. Up to 581 conditions per place. [2022-12-06 07:49:49,128 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 104 selfloop transitions, 30 changer transitions 35/170 dead transitions. [2022-12-06 07:49:49,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 2693 flow [2022-12-06 07:49:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:49:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:49:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-12-06 07:49:49,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-06 07:49:49,129 INFO L175 Difference]: Start difference. First operand has 80 places, 118 transitions, 1970 flow. Second operand 15 states and 105 transitions. [2022-12-06 07:49:49,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 2693 flow [2022-12-06 07:49:49,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 170 transitions, 2511 flow, removed 85 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:49,144 INFO L231 Difference]: Finished difference. Result has 98 places, 120 transitions, 1961 flow [2022-12-06 07:49:49,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1961, PETRI_PLACES=98, PETRI_TRANSITIONS=120} [2022-12-06 07:49:49,144 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 07:49:49,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:49,144 INFO L89 Accepts]: Start accepts. Operand has 98 places, 120 transitions, 1961 flow [2022-12-06 07:49:49,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:49,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:49,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 120 transitions, 1961 flow [2022-12-06 07:49:49,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 120 transitions, 1961 flow [2022-12-06 07:49:49,169 INFO L130 PetriNetUnfolder]: 92/308 cut-off events. [2022-12-06 07:49:49,169 INFO L131 PetriNetUnfolder]: For 3778/3895 co-relation queries the response was YES. [2022-12-06 07:49:49,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 308 events. 92/308 cut-off events. For 3778/3895 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1775 event pairs, 3 based on Foata normal form. 55/362 useless extension candidates. Maximal degree in co-relation 1669. Up to 86 conditions per place. [2022-12-06 07:49:49,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 120 transitions, 1961 flow [2022-12-06 07:49:49,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 07:49:54,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [678] $Ultimate##0-->L93-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_311| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| 0)) (= (+ |v_#pthreadsForks_178| 1) |v_#pthreadsForks_177|) (= (store |v_#memory_int_491| |v_ULTIMATE.start_main_~#t2~0#1.base_110| (store (select |v_#memory_int_491| |v_ULTIMATE.start_main_~#t2~0#1.base_110|) |v_ULTIMATE.start_main_~#t2~0#1.offset_108| |v_ULTIMATE.start_main_#t~pre14#1_146|)) |v_#memory_int_490|) (= (+ v_~q_back~0_669 1) v_~q_back~0_668) (not (= (ite (and (< v_~q_back~0_669 v_~n~0_346) (<= 0 v_~q_back~0_669)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|) (= |v_ULTIMATE.start_main_#t~pre14#1_146| |v_#pthreadsForks_178|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| (ite (= (select (select |v_#memory_int_491| v_~q~0.base_337) (+ v_~q~0.offset_337 (* v_~q_back~0_669 4))) 1) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_311| (+ v_~N~0_250 1))) InVars {#pthreadsForks=|v_#pthreadsForks_178|, ~q_back~0=v_~q_back~0_669, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_108|, #memory_int=|v_#memory_int_491|, ~N~0=v_~N~0_250, ~q~0.base=v_~q~0.base_337, ~n~0=v_~n~0_346, ~q~0.offset=v_~q~0.offset_337, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_110|} OutVars{~q_back~0=v_~q_back~0_668, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_108|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_207|, ~N~0=v_~N~0_250, ~q~0.base=v_~q~0.base_337, ~q~0.offset=v_~q~0.offset_337, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_146|, #pthreadsForks=|v_#pthreadsForks_177|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_211|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_207|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_490|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_120|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|, ~n~0=v_~n~0_346, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_110|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:54,230 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:54,231 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:54,231 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:54,231 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:49:54,356 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:49:54,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5213 [2022-12-06 07:49:54,357 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 120 transitions, 1994 flow [2022-12-06 07:49:54,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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 07:49:54,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:54,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:54,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:54,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-06 07:49:54,562 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash -345913168, now seen corresponding path program 1 times [2022-12-06 07:49:54,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:54,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685729970] [2022-12-06 07:49:54,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685729970] [2022-12-06 07:49:54,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685729970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700335434] [2022-12-06 07:49:54,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:54,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:54,807 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:54,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 07:49:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:54,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 07:49:54,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:54,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:54,997 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:49:54,998 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 26 treesize of output 18 [2022-12-06 07:49:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:55,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700335434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:55,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:55,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 07:49:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760640256] [2022-12-06 07:49:55,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:55,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:49:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:49:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:49:55,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 07:49:55,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 120 transitions, 1994 flow. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:55,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:55,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 07:49:55,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:55,234 INFO L130 PetriNetUnfolder]: 333/649 cut-off events. [2022-12-06 07:49:55,234 INFO L131 PetriNetUnfolder]: For 9358/9409 co-relation queries the response was YES. [2022-12-06 07:49:55,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 649 events. 333/649 cut-off events. For 9358/9409 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3198 event pairs, 27 based on Foata normal form. 64/712 useless extension candidates. Maximal degree in co-relation 4353. Up to 410 conditions per place. [2022-12-06 07:49:55,238 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 85 selfloop transitions, 63 changer transitions 1/150 dead transitions. [2022-12-06 07:49:55,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 150 transitions, 2461 flow [2022-12-06 07:49:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:49:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:49:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-12-06 07:49:55,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32098765432098764 [2022-12-06 07:49:55,238 INFO L175 Difference]: Start difference. First operand has 93 places, 120 transitions, 1994 flow. Second operand 9 states and 78 transitions. [2022-12-06 07:49:55,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 150 transitions, 2461 flow [2022-12-06 07:49:55,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 150 transitions, 2384 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-06 07:49:55,252 INFO L231 Difference]: Finished difference. Result has 95 places, 122 transitions, 2119 flow [2022-12-06 07:49:55,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2119, PETRI_PLACES=95, PETRI_TRANSITIONS=122} [2022-12-06 07:49:55,253 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 74 predicate places. [2022-12-06 07:49:55,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:55,253 INFO L89 Accepts]: Start accepts. Operand has 95 places, 122 transitions, 2119 flow [2022-12-06 07:49:55,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:55,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:55,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 122 transitions, 2119 flow [2022-12-06 07:49:55,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 122 transitions, 2119 flow [2022-12-06 07:49:55,278 INFO L130 PetriNetUnfolder]: 94/307 cut-off events. [2022-12-06 07:49:55,279 INFO L131 PetriNetUnfolder]: For 4248/4376 co-relation queries the response was YES. [2022-12-06 07:49:55,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 307 events. 94/307 cut-off events. For 4248/4376 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1752 event pairs, 3 based on Foata normal form. 57/363 useless extension candidates. Maximal degree in co-relation 1745. Up to 88 conditions per place. [2022-12-06 07:49:55,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 122 transitions, 2119 flow [2022-12-06 07:49:55,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 07:49:55,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:55,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:49:55,281 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 122 transitions, 2119 flow [2022-12-06 07:49:55,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:55,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:55,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:55,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:55,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-06 07:49:55,486 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2039348344, now seen corresponding path program 1 times [2022-12-06 07:49:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461011229] [2022-12-06 07:49:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:55,874 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 07:49:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:55,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461011229] [2022-12-06 07:49:55,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461011229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:55,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:49:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345764897] [2022-12-06 07:49:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:49:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:49:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:49:55,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:49:55,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 122 transitions, 2119 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:55,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:55,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:49:55,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:56,089 INFO L130 PetriNetUnfolder]: 404/774 cut-off events. [2022-12-06 07:49:56,089 INFO L131 PetriNetUnfolder]: For 11566/11594 co-relation queries the response was YES. [2022-12-06 07:49:56,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5493 conditions, 774 events. 404/774 cut-off events. For 11566/11594 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3868 event pairs, 60 based on Foata normal form. 36/810 useless extension candidates. Maximal degree in co-relation 5323. Up to 462 conditions per place. [2022-12-06 07:49:56,093 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 109 selfloop transitions, 47 changer transitions 0/157 dead transitions. [2022-12-06 07:49:56,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 157 transitions, 2848 flow [2022-12-06 07:49:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 07:49:56,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2022-12-06 07:49:56,093 INFO L175 Difference]: Start difference. First operand has 94 places, 122 transitions, 2119 flow. Second operand 5 states and 54 transitions. [2022-12-06 07:49:56,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 157 transitions, 2848 flow [2022-12-06 07:49:56,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 2613 flow, removed 39 selfloop flow, removed 9 redundant places. [2022-12-06 07:49:56,112 INFO L231 Difference]: Finished difference. Result has 91 places, 135 transitions, 2297 flow [2022-12-06 07:49:56,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2297, PETRI_PLACES=91, PETRI_TRANSITIONS=135} [2022-12-06 07:49:56,112 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 07:49:56,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:56,112 INFO L89 Accepts]: Start accepts. Operand has 91 places, 135 transitions, 2297 flow [2022-12-06 07:49:56,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:56,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:56,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 135 transitions, 2297 flow [2022-12-06 07:49:56,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 135 transitions, 2297 flow [2022-12-06 07:49:56,141 INFO L130 PetriNetUnfolder]: 113/352 cut-off events. [2022-12-06 07:49:56,141 INFO L131 PetriNetUnfolder]: For 4976/5105 co-relation queries the response was YES. [2022-12-06 07:49:56,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 352 events. 113/352 cut-off events. For 4976/5105 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2047 event pairs, 4 based on Foata normal form. 63/413 useless extension candidates. Maximal degree in co-relation 1912. Up to 104 conditions per place. [2022-12-06 07:49:56,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 135 transitions, 2297 flow [2022-12-06 07:49:56,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 07:49:56,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:49:56,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:56,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 07:49:56,234 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 135 transitions, 2308 flow [2022-12-06 07:49:56,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:49:56,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:56,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:56,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 07:49:56,234 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1627661180, now seen corresponding path program 1 times [2022-12-06 07:49:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:56,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610917129] [2022-12-06 07:49:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:56,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:56,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610917129] [2022-12-06 07:49:56,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610917129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:56,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038278535] [2022-12-06 07:49:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:56,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:56,637 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 07:49:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:56,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 07:49:56,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:56,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:56,814 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 07:49:56,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:49:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:56,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:56,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:56,943 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 82 treesize of output 70 [2022-12-06 07:49:56,945 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 53 treesize of output 47 [2022-12-06 07:49:56,947 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 47 treesize of output 41 [2022-12-06 07:49:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:56,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038278535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:56,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:49:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518657904] [2022-12-06 07:49:56,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:56,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:49:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:49:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:49:56,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 07:49:56,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 135 transitions, 2308 flow. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 07:49:56,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:56,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 07:49:56,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:57,345 INFO L130 PetriNetUnfolder]: 440/872 cut-off events. [2022-12-06 07:49:57,346 INFO L131 PetriNetUnfolder]: For 12559/12601 co-relation queries the response was YES. [2022-12-06 07:49:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 872 events. 440/872 cut-off events. For 12559/12601 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4695 event pairs, 83 based on Foata normal form. 46/918 useless extension candidates. Maximal degree in co-relation 5639. Up to 713 conditions per place. [2022-12-06 07:49:57,350 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 132 selfloop transitions, 34 changer transitions 22/189 dead transitions. [2022-12-06 07:49:57,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 189 transitions, 3060 flow [2022-12-06 07:49:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:49:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:49:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2022-12-06 07:49:57,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31986531986531985 [2022-12-06 07:49:57,351 INFO L175 Difference]: Start difference. First operand has 91 places, 135 transitions, 2308 flow. Second operand 11 states and 95 transitions. [2022-12-06 07:49:57,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 189 transitions, 3060 flow [2022-12-06 07:49:57,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 189 transitions, 2971 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:57,369 INFO L231 Difference]: Finished difference. Result has 106 places, 146 transitions, 2471 flow [2022-12-06 07:49:57,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2471, PETRI_PLACES=106, PETRI_TRANSITIONS=146} [2022-12-06 07:49:57,369 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 85 predicate places. [2022-12-06 07:49:57,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:57,369 INFO L89 Accepts]: Start accepts. Operand has 106 places, 146 transitions, 2471 flow [2022-12-06 07:49:57,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:57,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:57,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 146 transitions, 2471 flow [2022-12-06 07:49:57,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 146 transitions, 2471 flow [2022-12-06 07:49:57,402 INFO L130 PetriNetUnfolder]: 115/376 cut-off events. [2022-12-06 07:49:57,402 INFO L131 PetriNetUnfolder]: For 5495/5675 co-relation queries the response was YES. [2022-12-06 07:49:57,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 376 events. 115/376 cut-off events. For 5495/5675 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2294 event pairs, 6 based on Foata normal form. 77/451 useless extension candidates. Maximal degree in co-relation 2143. Up to 104 conditions per place. [2022-12-06 07:49:57,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 146 transitions, 2471 flow [2022-12-06 07:49:57,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 07:49:57,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:57,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:57,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:49:57,706 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:49:57,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-06 07:49:57,707 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 145 transitions, 2471 flow [2022-12-06 07:49:57,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 07:49:57,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:57,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:57,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:57,912 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1251140953, now seen corresponding path program 1 times [2022-12-06 07:49:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672469638] [2022-12-06 07:49:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:58,194 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 07:49:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:58,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672469638] [2022-12-06 07:49:58,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672469638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:58,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:58,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:49:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531137887] [2022-12-06 07:49:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:49:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:49:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:49:58,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:49:58,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 145 transitions, 2471 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:58,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:58,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:49:58,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:58,396 INFO L130 PetriNetUnfolder]: 450/859 cut-off events. [2022-12-06 07:49:58,397 INFO L131 PetriNetUnfolder]: For 13271/13327 co-relation queries the response was YES. [2022-12-06 07:49:58,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6037 conditions, 859 events. 450/859 cut-off events. For 13271/13327 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4484 event pairs, 92 based on Foata normal form. 52/911 useless extension candidates. Maximal degree in co-relation 5936. Up to 652 conditions per place. [2022-12-06 07:49:58,401 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 118 selfloop transitions, 49 changer transitions 0/168 dead transitions. [2022-12-06 07:49:58,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 168 transitions, 3003 flow [2022-12-06 07:49:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:49:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:49:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:49:58,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:49:58,402 INFO L175 Difference]: Start difference. First operand has 102 places, 145 transitions, 2471 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:49:58,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 168 transitions, 3003 flow [2022-12-06 07:49:58,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 168 transitions, 2942 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-06 07:49:58,422 INFO L231 Difference]: Finished difference. Result has 101 places, 154 transitions, 2704 flow [2022-12-06 07:49:58,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2704, PETRI_PLACES=101, PETRI_TRANSITIONS=154} [2022-12-06 07:49:58,422 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 07:49:58,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:58,422 INFO L89 Accepts]: Start accepts. Operand has 101 places, 154 transitions, 2704 flow [2022-12-06 07:49:58,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:58,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:58,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 154 transitions, 2704 flow [2022-12-06 07:49:58,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 154 transitions, 2704 flow [2022-12-06 07:49:58,456 INFO L130 PetriNetUnfolder]: 125/390 cut-off events. [2022-12-06 07:49:58,456 INFO L131 PetriNetUnfolder]: For 5732/5876 co-relation queries the response was YES. [2022-12-06 07:49:58,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 390 events. 125/390 cut-off events. For 5732/5876 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2385 event pairs, 5 based on Foata normal form. 64/452 useless extension candidates. Maximal degree in co-relation 2256. Up to 114 conditions per place. [2022-12-06 07:49:58,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 154 transitions, 2704 flow [2022-12-06 07:49:58,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 07:49:58,459 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:58,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 07:49:58,460 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 154 transitions, 2704 flow [2022-12-06 07:49:58,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:49:58,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:58,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:58,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 07:49:58,460 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -64208467, now seen corresponding path program 1 times [2022-12-06 07:49:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673578571] [2022-12-06 07:49:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:58,857 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 07:49:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:58,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673578571] [2022-12-06 07:49:58,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673578571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:58,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387539063] [2022-12-06 07:49:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:58,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:58,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:58,859 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:58,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 07:49:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:59,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:49:59,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:59,045 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 07:49:59,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:59,076 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:49:59,076 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 26 treesize of output 18 [2022-12-06 07:49:59,086 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 07:49:59,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387539063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:59,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:59,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 07:49:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296010087] [2022-12-06 07:49:59,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:59,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:49:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:59,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:49:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:49:59,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 07:49:59,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 154 transitions, 2704 flow. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:59,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:59,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 07:49:59,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:59,628 INFO L130 PetriNetUnfolder]: 569/1067 cut-off events. [2022-12-06 07:49:59,628 INFO L131 PetriNetUnfolder]: For 17580/17622 co-relation queries the response was YES. [2022-12-06 07:49:59,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7731 conditions, 1067 events. 569/1067 cut-off events. For 17580/17622 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5747 event pairs, 47 based on Foata normal form. 88/1155 useless extension candidates. Maximal degree in co-relation 7465. Up to 413 conditions per place. [2022-12-06 07:49:59,634 INFO L137 encePairwiseOnDemand]: 10/28 looper letters, 135 selfloop transitions, 126 changer transitions 1/263 dead transitions. [2022-12-06 07:49:59,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 263 transitions, 4330 flow [2022-12-06 07:49:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:49:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:49:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-12-06 07:49:59,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30580357142857145 [2022-12-06 07:49:59,635 INFO L175 Difference]: Start difference. First operand has 101 places, 154 transitions, 2704 flow. Second operand 16 states and 137 transitions. [2022-12-06 07:49:59,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 263 transitions, 4330 flow [2022-12-06 07:49:59,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 263 transitions, 4274 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:49:59,663 INFO L231 Difference]: Finished difference. Result has 121 places, 185 transitions, 3636 flow [2022-12-06 07:49:59,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3636, PETRI_PLACES=121, PETRI_TRANSITIONS=185} [2022-12-06 07:49:59,663 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 07:49:59,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:59,664 INFO L89 Accepts]: Start accepts. Operand has 121 places, 185 transitions, 3636 flow [2022-12-06 07:49:59,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:59,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:59,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 185 transitions, 3636 flow [2022-12-06 07:49:59,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 185 transitions, 3636 flow [2022-12-06 07:49:59,711 INFO L130 PetriNetUnfolder]: 154/481 cut-off events. [2022-12-06 07:49:59,711 INFO L131 PetriNetUnfolder]: For 8690/8846 co-relation queries the response was YES. [2022-12-06 07:49:59,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3139 conditions, 481 events. 154/481 cut-off events. For 8690/8846 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3124 event pairs, 6 based on Foata normal form. 55/535 useless extension candidates. Maximal degree in co-relation 2998. Up to 140 conditions per place. [2022-12-06 07:49:59,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 185 transitions, 3636 flow [2022-12-06 07:49:59,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-06 07:49:59,715 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:59,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 07:49:59,716 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 185 transitions, 3636 flow [2022-12-06 07:49:59,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:49:59,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:59,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:59,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:59,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:59,921 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 547453371, now seen corresponding path program 1 times [2022-12-06 07:49:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:59,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299251269] [2022-12-06 07:49:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299251269] [2022-12-06 07:50:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299251269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659738291] [2022-12-06 07:50:01,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:01,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:01,069 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:01,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 07:50:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:01,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 07:50:01,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:01,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:01,257 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 19 treesize of output 21 [2022-12-06 07:50:01,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:01,332 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 46 treesize of output 12 [2022-12-06 07:50:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:01,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:01,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:01,509 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 156 treesize of output 157 [2022-12-06 07:50:01,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:01,518 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 101 treesize of output 94 [2022-12-06 07:50:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:01,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659738291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:01,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:01,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 07:50:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646920901] [2022-12-06 07:50:01,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:01,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:50:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:01,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:50:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:50:01,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 07:50:01,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 185 transitions, 3636 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:01,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:01,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 07:50:01,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:03,104 INFO L130 PetriNetUnfolder]: 620/1210 cut-off events. [2022-12-06 07:50:03,104 INFO L131 PetriNetUnfolder]: For 23597/23684 co-relation queries the response was YES. [2022-12-06 07:50:03,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9227 conditions, 1210 events. 620/1210 cut-off events. For 23597/23684 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7100 event pairs, 45 based on Foata normal form. 82/1292 useless extension candidates. Maximal degree in co-relation 8769. Up to 656 conditions per place. [2022-12-06 07:50:03,112 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 138 selfloop transitions, 109 changer transitions 27/275 dead transitions. [2022-12-06 07:50:03,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 275 transitions, 4883 flow [2022-12-06 07:50:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 07:50:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 07:50:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 150 transitions. [2022-12-06 07:50:03,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2435064935064935 [2022-12-06 07:50:03,113 INFO L175 Difference]: Start difference. First operand has 121 places, 185 transitions, 3636 flow. Second operand 22 states and 150 transitions. [2022-12-06 07:50:03,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 275 transitions, 4883 flow [2022-12-06 07:50:03,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 275 transitions, 4517 flow, removed 142 selfloop flow, removed 5 redundant places. [2022-12-06 07:50:03,165 INFO L231 Difference]: Finished difference. Result has 145 places, 203 transitions, 3904 flow [2022-12-06 07:50:03,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3288, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3904, PETRI_PLACES=145, PETRI_TRANSITIONS=203} [2022-12-06 07:50:03,166 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2022-12-06 07:50:03,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:03,166 INFO L89 Accepts]: Start accepts. Operand has 145 places, 203 transitions, 3904 flow [2022-12-06 07:50:03,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:03,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:03,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 203 transitions, 3904 flow [2022-12-06 07:50:03,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 203 transitions, 3904 flow [2022-12-06 07:50:03,217 INFO L130 PetriNetUnfolder]: 158/522 cut-off events. [2022-12-06 07:50:03,218 INFO L131 PetriNetUnfolder]: For 9967/10151 co-relation queries the response was YES. [2022-12-06 07:50:03,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 522 events. 158/522 cut-off events. For 9967/10151 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3590 event pairs, 6 based on Foata normal form. 58/579 useless extension candidates. Maximal degree in co-relation 3377. Up to 140 conditions per place. [2022-12-06 07:50:03,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 203 transitions, 3904 flow [2022-12-06 07:50:03,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-06 07:50:03,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:03,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:03,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:50:03,461 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:50:03,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 296 [2022-12-06 07:50:03,462 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 202 transitions, 3901 flow [2022-12-06 07:50:03,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:03,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:03,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:03,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:03,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:03,667 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -920930931, now seen corresponding path program 2 times [2022-12-06 07:50:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:03,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774634769] [2022-12-06 07:50:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:04,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774634769] [2022-12-06 07:50:04,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774634769] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:04,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848911939] [2022-12-06 07:50:04,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:50:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:04,639 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:04,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 07:50:04,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:50:04,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:50:04,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 07:50:04,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:04,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:04,835 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 07:50:04,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:04,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:50:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:04,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:05,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:05,102 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 156 treesize of output 157 [2022-12-06 07:50:05,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:05,111 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 101 treesize of output 94 [2022-12-06 07:50:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:05,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848911939] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:05,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:05,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 16 [2022-12-06 07:50:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773357482] [2022-12-06 07:50:05,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:05,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:50:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:50:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:50:05,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:50:05,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 202 transitions, 3901 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:05,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:05,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:50:05,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:05,860 INFO L130 PetriNetUnfolder]: 596/1152 cut-off events. [2022-12-06 07:50:05,860 INFO L131 PetriNetUnfolder]: For 23702/23764 co-relation queries the response was YES. [2022-12-06 07:50:05,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9068 conditions, 1152 events. 596/1152 cut-off events. For 23702/23764 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6580 event pairs, 64 based on Foata normal form. 64/1216 useless extension candidates. Maximal degree in co-relation 8933. Up to 727 conditions per place. [2022-12-06 07:50:05,866 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 117 selfloop transitions, 87 changer transitions 19/224 dead transitions. [2022-12-06 07:50:05,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 224 transitions, 4413 flow [2022-12-06 07:50:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:50:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:50:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-12-06 07:50:05,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25483870967741934 [2022-12-06 07:50:05,867 INFO L175 Difference]: Start difference. First operand has 140 places, 202 transitions, 3901 flow. Second operand 10 states and 79 transitions. [2022-12-06 07:50:05,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 224 transitions, 4413 flow [2022-12-06 07:50:05,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 224 transitions, 4255 flow, removed 52 selfloop flow, removed 8 redundant places. [2022-12-06 07:50:05,918 INFO L231 Difference]: Finished difference. Result has 139 places, 192 transitions, 3743 flow [2022-12-06 07:50:05,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3704, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3743, PETRI_PLACES=139, PETRI_TRANSITIONS=192} [2022-12-06 07:50:05,919 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-06 07:50:05,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:05,919 INFO L89 Accepts]: Start accepts. Operand has 139 places, 192 transitions, 3743 flow [2022-12-06 07:50:05,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:05,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:05,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 192 transitions, 3743 flow [2022-12-06 07:50:05,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 192 transitions, 3743 flow [2022-12-06 07:50:05,966 INFO L130 PetriNetUnfolder]: 154/493 cut-off events. [2022-12-06 07:50:05,966 INFO L131 PetriNetUnfolder]: For 9877/10032 co-relation queries the response was YES. [2022-12-06 07:50:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 493 events. 154/493 cut-off events. For 9877/10032 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3249 event pairs, 4 based on Foata normal form. 56/549 useless extension candidates. Maximal degree in co-relation 3183. Up to 131 conditions per place. [2022-12-06 07:50:05,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 192 transitions, 3743 flow [2022-12-06 07:50:05,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 07:50:05,976 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:05,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 07:50:05,976 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 192 transitions, 3743 flow [2022-12-06 07:50:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:05,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:05,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:05,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:06,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-06 07:50:06,181 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:06,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1584945689, now seen corresponding path program 1 times [2022-12-06 07:50:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:06,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57401741] [2022-12-06 07:50:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:06,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57401741] [2022-12-06 07:50:06,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57401741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:06,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538726674] [2022-12-06 07:50:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:06,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:06,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:06,583 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:06,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 07:50:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:06,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 07:50:06,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:06,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:06,805 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 07:50:06,849 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 07:50:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:06,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:06,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_2301 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~q~0.base) .cse0)) (+ c_~N~0 1))) (forall ((v_ArrVal_2301 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~q~0.base) .cse0)))))) is different from false [2022-12-06 07:50:06,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:06,973 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 86 treesize of output 74 [2022-12-06 07:50:06,976 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 57 treesize of output 51 [2022-12-06 07:50:06,978 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 51 treesize of output 45 [2022-12-06 07:50:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:07,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538726674] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:07,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:07,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:50:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374363967] [2022-12-06 07:50:07,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:50:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:50:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2022-12-06 07:50:07,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:50:07,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 192 transitions, 3743 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:50:07,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:07,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:50:07,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:07,753 INFO L130 PetriNetUnfolder]: 579/1121 cut-off events. [2022-12-06 07:50:07,754 INFO L131 PetriNetUnfolder]: For 24485/24521 co-relation queries the response was YES. [2022-12-06 07:50:07,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8945 conditions, 1121 events. 579/1121 cut-off events. For 24485/24521 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6366 event pairs, 95 based on Foata normal form. 33/1154 useless extension candidates. Maximal degree in co-relation 8612. Up to 966 conditions per place. [2022-12-06 07:50:07,760 INFO L137 encePairwiseOnDemand]: 7/30 looper letters, 167 selfloop transitions, 26 changer transitions 30/224 dead transitions. [2022-12-06 07:50:07,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 224 transitions, 4347 flow [2022-12-06 07:50:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:50:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:50:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-12-06 07:50:07,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24358974358974358 [2022-12-06 07:50:07,761 INFO L175 Difference]: Start difference. First operand has 137 places, 192 transitions, 3743 flow. Second operand 13 states and 95 transitions. [2022-12-06 07:50:07,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 224 transitions, 4347 flow [2022-12-06 07:50:07,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 224 transitions, 4221 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-06 07:50:07,806 INFO L231 Difference]: Finished difference. Result has 143 places, 183 transitions, 3490 flow [2022-12-06 07:50:07,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3615, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3490, PETRI_PLACES=143, PETRI_TRANSITIONS=183} [2022-12-06 07:50:07,807 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 122 predicate places. [2022-12-06 07:50:07,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:07,807 INFO L89 Accepts]: Start accepts. Operand has 143 places, 183 transitions, 3490 flow [2022-12-06 07:50:07,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:07,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:07,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 183 transitions, 3490 flow [2022-12-06 07:50:07,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 183 transitions, 3490 flow [2022-12-06 07:50:07,852 INFO L130 PetriNetUnfolder]: 151/458 cut-off events. [2022-12-06 07:50:07,852 INFO L131 PetriNetUnfolder]: For 9284/9449 co-relation queries the response was YES. [2022-12-06 07:50:07,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 458 events. 151/458 cut-off events. For 9284/9449 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2848 event pairs, 2 based on Foata normal form. 48/506 useless extension candidates. Maximal degree in co-relation 3083. Up to 126 conditions per place. [2022-12-06 07:50:07,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 183 transitions, 3490 flow [2022-12-06 07:50:07,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 07:50:07,856 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:07,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 07:50:07,857 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 183 transitions, 3490 flow [2022-12-06 07:50:07,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:50:07,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:07,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:07,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:08,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-06 07:50:08,062 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1138429760, now seen corresponding path program 1 times [2022-12-06 07:50:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:08,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051535881] [2022-12-06 07:50:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051535881] [2022-12-06 07:50:08,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051535881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787852913] [2022-12-06 07:50:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:08,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:08,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:08,716 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 07:50:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:08,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 07:50:08,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:08,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:08,947 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 19 treesize of output 21 [2022-12-06 07:50:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:08,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:09,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:09,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 07:50:09,035 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 25 treesize of output 18 [2022-12-06 07:50:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:09,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787852913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:09,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:09,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 07:50:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017271504] [2022-12-06 07:50:09,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:09,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:50:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:50:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2022-12-06 07:50:09,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:50:09,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 183 transitions, 3490 flow. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 07:50:09,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:09,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:50:09,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:09,494 INFO L130 PetriNetUnfolder]: 590/1095 cut-off events. [2022-12-06 07:50:09,495 INFO L131 PetriNetUnfolder]: For 24193/24231 co-relation queries the response was YES. [2022-12-06 07:50:09,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9033 conditions, 1095 events. 590/1095 cut-off events. For 24193/24231 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5835 event pairs, 88 based on Foata normal form. 49/1144 useless extension candidates. Maximal degree in co-relation 8925. Up to 818 conditions per place. [2022-12-06 07:50:09,501 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 161 selfloop transitions, 53 changer transitions 0/215 dead transitions. [2022-12-06 07:50:09,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 215 transitions, 4325 flow [2022-12-06 07:50:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:50:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:50:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 07:50:09,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 07:50:09,504 INFO L175 Difference]: Start difference. First operand has 132 places, 183 transitions, 3490 flow. Second operand 7 states and 66 transitions. [2022-12-06 07:50:09,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 215 transitions, 4325 flow [2022-12-06 07:50:09,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 215 transitions, 4165 flow, removed 60 selfloop flow, removed 10 redundant places. [2022-12-06 07:50:09,553 INFO L231 Difference]: Finished difference. Result has 130 places, 192 transitions, 3718 flow [2022-12-06 07:50:09,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3718, PETRI_PLACES=130, PETRI_TRANSITIONS=192} [2022-12-06 07:50:09,553 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-06 07:50:09,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:09,554 INFO L89 Accepts]: Start accepts. Operand has 130 places, 192 transitions, 3718 flow [2022-12-06 07:50:09,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:09,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:09,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 192 transitions, 3718 flow [2022-12-06 07:50:09,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 192 transitions, 3718 flow [2022-12-06 07:50:09,602 INFO L130 PetriNetUnfolder]: 159/480 cut-off events. [2022-12-06 07:50:09,602 INFO L131 PetriNetUnfolder]: For 10551/10717 co-relation queries the response was YES. [2022-12-06 07:50:09,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 480 events. 159/480 cut-off events. For 10551/10717 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3030 event pairs, 1 based on Foata normal form. 59/538 useless extension candidates. Maximal degree in co-relation 3147. Up to 133 conditions per place. [2022-12-06 07:50:09,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 192 transitions, 3718 flow [2022-12-06 07:50:09,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 07:50:09,617 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:09,617 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:09,617 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:09,617 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:09,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:50:09,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 07:50:09,761 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 192 transitions, 3741 flow [2022-12-06 07:50:09,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 07:50:09,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:09,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:09,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-06 07:50:09,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-06 07:50:09,967 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1053446931, now seen corresponding path program 1 times [2022-12-06 07:50:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:09,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985667331] [2022-12-06 07:50:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:10,525 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 07:50:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985667331] [2022-12-06 07:50:10,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985667331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859844923] [2022-12-06 07:50:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:10,527 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:10,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 07:50:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:10,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 07:50:10,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:10,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:10,719 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 07:50:10,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:50:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:50:10,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:10,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:10,873 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 86 treesize of output 74 [2022-12-06 07:50:10,877 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 57 treesize of output 51 [2022-12-06 07:50:10,879 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 51 treesize of output 45 [2022-12-06 07:50:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:50:10,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859844923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:10,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:10,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 07:50:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199314178] [2022-12-06 07:50:10,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:10,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:50:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:50:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:50:10,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:50:10,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 192 transitions, 3741 flow. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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 07:50:10,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:10,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:50:10,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:11,544 INFO L130 PetriNetUnfolder]: 608/1156 cut-off events. [2022-12-06 07:50:11,544 INFO L131 PetriNetUnfolder]: For 25765/25823 co-relation queries the response was YES. [2022-12-06 07:50:11,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9380 conditions, 1156 events. 608/1156 cut-off events. For 25765/25823 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6395 event pairs, 109 based on Foata normal form. 32/1188 useless extension candidates. Maximal degree in co-relation 8750. Up to 1017 conditions per place. [2022-12-06 07:50:11,552 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 173 selfloop transitions, 44 changer transitions 18/236 dead transitions. [2022-12-06 07:50:11,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 236 transitions, 4577 flow [2022-12-06 07:50:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:50:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:50:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-12-06 07:50:11,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22365591397849463 [2022-12-06 07:50:11,553 INFO L175 Difference]: Start difference. First operand has 130 places, 192 transitions, 3741 flow. Second operand 15 states and 104 transitions. [2022-12-06 07:50:11,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 236 transitions, 4577 flow [2022-12-06 07:50:11,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 236 transitions, 4494 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 07:50:11,610 INFO L231 Difference]: Finished difference. Result has 146 places, 200 transitions, 3919 flow [2022-12-06 07:50:11,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3660, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3919, PETRI_PLACES=146, PETRI_TRANSITIONS=200} [2022-12-06 07:50:11,610 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-06 07:50:11,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:11,610 INFO L89 Accepts]: Start accepts. Operand has 146 places, 200 transitions, 3919 flow [2022-12-06 07:50:11,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:11,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:11,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 200 transitions, 3919 flow [2022-12-06 07:50:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 200 transitions, 3919 flow [2022-12-06 07:50:11,676 INFO L130 PetriNetUnfolder]: 163/501 cut-off events. [2022-12-06 07:50:11,676 INFO L131 PetriNetUnfolder]: For 10935/11088 co-relation queries the response was YES. [2022-12-06 07:50:11,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 501 events. 163/501 cut-off events. For 10935/11088 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3248 event pairs, 1 based on Foata normal form. 53/553 useless extension candidates. Maximal degree in co-relation 3379. Up to 133 conditions per place. [2022-12-06 07:50:11,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 200 transitions, 3919 flow [2022-12-06 07:50:11,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-06 07:50:11,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:11,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:11,981 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:50:11,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 07:50:11,981 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 198 transitions, 3899 flow [2022-12-06 07:50:11,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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 07:50:11,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:11,981 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:11,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-06 07:50:12,187 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1388796278, now seen corresponding path program 2 times [2022-12-06 07:50:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:12,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625618781] [2022-12-06 07:50:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:13,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625618781] [2022-12-06 07:50:13,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625618781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:13,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164544559] [2022-12-06 07:50:13,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:50:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:13,105 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 07:50:13,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:50:13,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:50:13,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 07:50:13,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:13,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:13,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:50:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:13,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:13,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:13,566 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 76 [2022-12-06 07:50:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:13,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164544559] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:13,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:13,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-06 07:50:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28180053] [2022-12-06 07:50:13,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:13,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:50:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:13,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:50:13,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:50:13,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 07:50:13,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 198 transitions, 3899 flow. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:13,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:13,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 07:50:13,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:14,226 INFO L130 PetriNetUnfolder]: 618/1172 cut-off events. [2022-12-06 07:50:14,226 INFO L131 PetriNetUnfolder]: For 27018/27085 co-relation queries the response was YES. [2022-12-06 07:50:14,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 1172 events. 618/1172 cut-off events. For 27018/27085 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6533 event pairs, 122 based on Foata normal form. 47/1219 useless extension candidates. Maximal degree in co-relation 9516. Up to 1044 conditions per place. [2022-12-06 07:50:14,233 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 206 selfloop transitions, 34 changer transitions 4/245 dead transitions. [2022-12-06 07:50:14,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 245 transitions, 4806 flow [2022-12-06 07:50:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:50:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:50:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 07:50:14,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2426470588235294 [2022-12-06 07:50:14,234 INFO L175 Difference]: Start difference. First operand has 141 places, 198 transitions, 3899 flow. Second operand 12 states and 99 transitions. [2022-12-06 07:50:14,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 245 transitions, 4806 flow [2022-12-06 07:50:14,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 245 transitions, 4684 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-06 07:50:14,289 INFO L231 Difference]: Finished difference. Result has 150 places, 211 transitions, 4141 flow [2022-12-06 07:50:14,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3777, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4141, PETRI_PLACES=150, PETRI_TRANSITIONS=211} [2022-12-06 07:50:14,290 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2022-12-06 07:50:14,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:14,290 INFO L89 Accepts]: Start accepts. Operand has 150 places, 211 transitions, 4141 flow [2022-12-06 07:50:14,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:14,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:14,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 211 transitions, 4141 flow [2022-12-06 07:50:14,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 211 transitions, 4141 flow [2022-12-06 07:50:14,360 INFO L130 PetriNetUnfolder]: 166/527 cut-off events. [2022-12-06 07:50:14,360 INFO L131 PetriNetUnfolder]: For 11911/12084 co-relation queries the response was YES. [2022-12-06 07:50:14,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 527 events. 166/527 cut-off events. For 11911/12084 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3545 event pairs, 4 based on Foata normal form. 54/578 useless extension candidates. Maximal degree in co-relation 3542. Up to 142 conditions per place. [2022-12-06 07:50:14,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 211 transitions, 4141 flow [2022-12-06 07:50:14,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 07:50:14,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:50:14,461 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:14,462 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:14,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:50:14,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_676| v_~q~0.base_453))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_465| 2) (= |v_ULTIMATE.start_main_#t~pre14#1_206| |v_#pthreadsForks_272|) (= v_~q_back~0_902 (+ 2 v_~q_back~0_903)) (= (+ |v_#pthreadsForks_272| 1) |v_#pthreadsForks_271|) (= (store |v_#memory_int_676| |v_ULTIMATE.start_main_~#t2~0#1.base_145| (store (select |v_#memory_int_676| |v_ULTIMATE.start_main_~#t2~0#1.base_145|) |v_ULTIMATE.start_main_~#t2~0#1.offset_142| |v_ULTIMATE.start_main_#t~pre14#1_206|)) |v_#memory_int_675|) (not (= (ite (and (<= 0 v_~q_back~0_903) (< v_~q_back~0_903 v_~n~0_446)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_903 4) v_~q~0.offset_453)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_465| (+ v_~N~0_342 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_435| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_435| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_453 (* v_~q_back~0_902 4))) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_435| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_435|) (not (= (ite (and (<= 1 v_~q_back~0_902) (< v_~q_back~0_902 (+ v_~n~0_446 1))) 1 0) 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_272|, ~q_back~0=v_~q_back~0_903, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, #memory_int=|v_#memory_int_676|, ~N~0=v_~N~0_342, ~q~0.base=v_~q~0.base_453, ~n~0=v_~n~0_446, ~q~0.offset=v_~q~0.offset_453, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_145|} OutVars{~q_back~0=v_~q_back~0_902, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_301|, ~N~0=v_~N~0_342, ~q~0.base=v_~q~0.base_453, ~q~0.offset=v_~q~0.offset_453, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_435|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_206|, #pthreadsForks=|v_#pthreadsForks_271|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_305|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_301|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_465|, #memory_int=|v_#memory_int_675|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_167|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_435|, ~n~0=v_~n~0_446, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_145|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:50:15,057 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:15,058 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:15,113 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:15,113 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:15,218 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:15,218 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:15,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:50:15,381 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:50:15,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1092 [2022-12-06 07:50:15,382 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 206 transitions, 4157 flow [2022-12-06 07:50:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:15,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:15,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:15,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:15,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:15,587 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1912719518, now seen corresponding path program 1 times [2022-12-06 07:50:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:15,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357846678] [2022-12-06 07:50:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:15,998 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 07:50:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:15,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357846678] [2022-12-06 07:50:15,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357846678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:15,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:15,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:50:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49409930] [2022-12-06 07:50:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:15,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:50:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:15,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:50:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:50:15,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 07:50:15,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 206 transitions, 4157 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:50:15,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:15,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 07:50:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:16,304 INFO L130 PetriNetUnfolder]: 673/1258 cut-off events. [2022-12-06 07:50:16,304 INFO L131 PetriNetUnfolder]: For 31889/31984 co-relation queries the response was YES. [2022-12-06 07:50:16,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10550 conditions, 1258 events. 673/1258 cut-off events. For 31889/31984 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6922 event pairs, 84 based on Foata normal form. 47/1305 useless extension candidates. Maximal degree in co-relation 10247. Up to 812 conditions per place. [2022-12-06 07:50:16,312 INFO L137 encePairwiseOnDemand]: 13/41 looper letters, 161 selfloop transitions, 82 changer transitions 0/244 dead transitions. [2022-12-06 07:50:16,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 5223 flow [2022-12-06 07:50:16,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:50:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:50:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 07:50:16,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3463414634146341 [2022-12-06 07:50:16,313 INFO L175 Difference]: Start difference. First operand has 145 places, 206 transitions, 4157 flow. Second operand 5 states and 71 transitions. [2022-12-06 07:50:16,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 5223 flow [2022-12-06 07:50:16,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 244 transitions, 4967 flow, removed 101 selfloop flow, removed 8 redundant places. [2022-12-06 07:50:16,384 INFO L231 Difference]: Finished difference. Result has 142 places, 221 transitions, 4538 flow [2022-12-06 07:50:16,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3964, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4538, PETRI_PLACES=142, PETRI_TRANSITIONS=221} [2022-12-06 07:50:16,384 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2022-12-06 07:50:16,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:16,384 INFO L89 Accepts]: Start accepts. Operand has 142 places, 221 transitions, 4538 flow [2022-12-06 07:50:16,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:16,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:16,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 221 transitions, 4538 flow [2022-12-06 07:50:16,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 221 transitions, 4538 flow [2022-12-06 07:50:16,445 INFO L130 PetriNetUnfolder]: 186/572 cut-off events. [2022-12-06 07:50:16,445 INFO L131 PetriNetUnfolder]: For 13663/13863 co-relation queries the response was YES. [2022-12-06 07:50:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4030 conditions, 572 events. 186/572 cut-off events. For 13663/13863 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3824 event pairs, 1 based on Foata normal form. 61/632 useless extension candidates. Maximal degree in co-relation 3864. Up to 158 conditions per place. [2022-12-06 07:50:16,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 221 transitions, 4538 flow [2022-12-06 07:50:16,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-06 07:50:16,451 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:16,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 07:50:16,451 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 221 transitions, 4538 flow [2022-12-06 07:50:16,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:50:16,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:16,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:16,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 07:50:16,451 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2091123038, now seen corresponding path program 1 times [2022-12-06 07:50:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:16,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986746147] [2022-12-06 07:50:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986746147] [2022-12-06 07:50:16,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986746147] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409524090] [2022-12-06 07:50:16,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:16,522 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:16,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 07:50:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:16,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:50:16,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:16,698 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 07:50:16,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:50:16,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409524090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:16,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:50:16,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 07:50:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702782272] [2022-12-06 07:50:16,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:16,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:50:16,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:16,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:50:16,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:50:16,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 07:50:16,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 221 transitions, 4538 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 07:50:16,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:16,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 07:50:16,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:16,970 INFO L130 PetriNetUnfolder]: 749/1394 cut-off events. [2022-12-06 07:50:16,970 INFO L131 PetriNetUnfolder]: For 36438/36559 co-relation queries the response was YES. [2022-12-06 07:50:16,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11776 conditions, 1394 events. 749/1394 cut-off events. For 36438/36559 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7975 event pairs, 65 based on Foata normal form. 63/1457 useless extension candidates. Maximal degree in co-relation 11376. Up to 1120 conditions per place. [2022-12-06 07:50:16,979 INFO L137 encePairwiseOnDemand]: 20/41 looper letters, 201 selfloop transitions, 51 changer transitions 4/257 dead transitions. [2022-12-06 07:50:16,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 257 transitions, 5624 flow [2022-12-06 07:50:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:50:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:50:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 07:50:16,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2022-12-06 07:50:16,980 INFO L175 Difference]: Start difference. First operand has 142 places, 221 transitions, 4538 flow. Second operand 4 states and 62 transitions. [2022-12-06 07:50:16,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 257 transitions, 5624 flow [2022-12-06 07:50:17,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 257 transitions, 5509 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 07:50:17,046 INFO L231 Difference]: Finished difference. Result has 144 places, 231 transitions, 4799 flow [2022-12-06 07:50:17,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4431, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4799, PETRI_PLACES=144, PETRI_TRANSITIONS=231} [2022-12-06 07:50:17,047 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-06 07:50:17,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:17,047 INFO L89 Accepts]: Start accepts. Operand has 144 places, 231 transitions, 4799 flow [2022-12-06 07:50:17,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:17,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:17,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 231 transitions, 4799 flow [2022-12-06 07:50:17,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 231 transitions, 4799 flow [2022-12-06 07:50:17,115 INFO L130 PetriNetUnfolder]: 207/623 cut-off events. [2022-12-06 07:50:17,115 INFO L131 PetriNetUnfolder]: For 15343/15531 co-relation queries the response was YES. [2022-12-06 07:50:17,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4622 conditions, 623 events. 207/623 cut-off events. For 15343/15531 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4279 event pairs, 3 based on Foata normal form. 76/696 useless extension candidates. Maximal degree in co-relation 4513. Up to 182 conditions per place. [2022-12-06 07:50:17,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 231 transitions, 4799 flow [2022-12-06 07:50:17,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 07:50:17,121 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:17,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:50:17,122 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 231 transitions, 4799 flow [2022-12-06 07:50:17,122 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 07:50:17,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:17,122 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:17,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:17,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-12-06 07:50:17,326 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash 822059515, now seen corresponding path program 1 times [2022-12-06 07:50:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:17,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196521159] [2022-12-06 07:50:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196521159] [2022-12-06 07:50:17,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196521159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544876483] [2022-12-06 07:50:17,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:17,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:17,817 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:17,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 07:50:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:17,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:50:17,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:18,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:18,001 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 30 treesize of output 30 [2022-12-06 07:50:18,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:18,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:50:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:18,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:18,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:18,178 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 135 treesize of output 136 [2022-12-06 07:50:18,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:18,185 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 75 treesize of output 62 [2022-12-06 07:50:18,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:18,189 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 62 treesize of output 49 [2022-12-06 07:50:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:18,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544876483] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:18,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:18,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:50:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160925768] [2022-12-06 07:50:18,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:18,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:50:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:50:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:50:18,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 07:50:18,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 231 transitions, 4799 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 07:50:18,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:18,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 07:50:18,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:18,710 INFO L130 PetriNetUnfolder]: 750/1392 cut-off events. [2022-12-06 07:50:18,710 INFO L131 PetriNetUnfolder]: For 36863/36909 co-relation queries the response was YES. [2022-12-06 07:50:18,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12214 conditions, 1392 events. 750/1392 cut-off events. For 36863/36909 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7865 event pairs, 211 based on Foata normal form. 15/1406 useless extension candidates. Maximal degree in co-relation 11978. Up to 1307 conditions per place. [2022-12-06 07:50:18,719 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 228 selfloop transitions, 20 changer transitions 2/251 dead transitions. [2022-12-06 07:50:18,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 251 transitions, 5481 flow [2022-12-06 07:50:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:50:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:50:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-06 07:50:18,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2454212454212454 [2022-12-06 07:50:18,720 INFO L175 Difference]: Start difference. First operand has 143 places, 231 transitions, 4799 flow. Second operand 7 states and 67 transitions. [2022-12-06 07:50:18,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 251 transitions, 5481 flow [2022-12-06 07:50:18,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 251 transitions, 5372 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 07:50:18,798 INFO L231 Difference]: Finished difference. Result has 148 places, 235 transitions, 4843 flow [2022-12-06 07:50:18,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4694, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4843, PETRI_PLACES=148, PETRI_TRANSITIONS=235} [2022-12-06 07:50:18,798 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-06 07:50:18,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:18,799 INFO L89 Accepts]: Start accepts. Operand has 148 places, 235 transitions, 4843 flow [2022-12-06 07:50:18,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:18,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:18,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 235 transitions, 4843 flow [2022-12-06 07:50:18,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 235 transitions, 4843 flow [2022-12-06 07:50:18,880 INFO L130 PetriNetUnfolder]: 210/625 cut-off events. [2022-12-06 07:50:18,881 INFO L131 PetriNetUnfolder]: For 14667/14836 co-relation queries the response was YES. [2022-12-06 07:50:18,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4576 conditions, 625 events. 210/625 cut-off events. For 14667/14836 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4242 event pairs, 4 based on Foata normal form. 63/684 useless extension candidates. Maximal degree in co-relation 4405. Up to 184 conditions per place. [2022-12-06 07:50:18,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 235 transitions, 4843 flow [2022-12-06 07:50:18,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 07:50:18,889 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:18,890 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:18,997 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:18,997 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:19,082 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:19,082 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:19,217 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:19,217 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:24,177 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:50:24,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5379 [2022-12-06 07:50:24,178 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 233 transitions, 4836 flow [2022-12-06 07:50:24,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 07:50:24,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:24,178 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:24,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:24,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:24,383 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 439665934, now seen corresponding path program 1 times [2022-12-06 07:50:24,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:24,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424658916] [2022-12-06 07:50:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:25,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:25,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424658916] [2022-12-06 07:50:25,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424658916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:25,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494494942] [2022-12-06 07:50:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:25,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:25,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:25,864 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:25,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 07:50:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:26,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 07:50:26,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:26,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:26,059 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 30 treesize of output 30 [2022-12-06 07:50:26,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:26,133 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 59 treesize of output 16 [2022-12-06 07:50:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:26,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:26,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:26,307 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 195 treesize of output 179 [2022-12-06 07:50:26,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:26,312 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 103 treesize of output 64 [2022-12-06 07:50:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:26,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494494942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:26,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:26,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:50:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402046433] [2022-12-06 07:50:26,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:26,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:50:26,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:50:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:50:26,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 07:50:26,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 233 transitions, 4836 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:50:26,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:26,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 07:50:26,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:27,271 INFO L130 PetriNetUnfolder]: 837/1593 cut-off events. [2022-12-06 07:50:27,271 INFO L131 PetriNetUnfolder]: For 39135/39182 co-relation queries the response was YES. [2022-12-06 07:50:27,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13745 conditions, 1593 events. 837/1593 cut-off events. For 39135/39182 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9592 event pairs, 113 based on Foata normal form. 38/1631 useless extension candidates. Maximal degree in co-relation 13333. Up to 1239 conditions per place. [2022-12-06 07:50:27,283 INFO L137 encePairwiseOnDemand]: 11/41 looper letters, 232 selfloop transitions, 85 changer transitions 25/343 dead transitions. [2022-12-06 07:50:27,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 343 transitions, 6794 flow [2022-12-06 07:50:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:50:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:50:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 166 transitions. [2022-12-06 07:50:27,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20243902439024392 [2022-12-06 07:50:27,285 INFO L175 Difference]: Start difference. First operand has 146 places, 233 transitions, 4836 flow. Second operand 20 states and 166 transitions. [2022-12-06 07:50:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 343 transitions, 6794 flow [2022-12-06 07:50:27,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 343 transitions, 6678 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-12-06 07:50:27,378 INFO L231 Difference]: Finished difference. Result has 169 places, 267 transitions, 5693 flow [2022-12-06 07:50:27,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4730, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5693, PETRI_PLACES=169, PETRI_TRANSITIONS=267} [2022-12-06 07:50:27,379 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 148 predicate places. [2022-12-06 07:50:27,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:27,379 INFO L89 Accepts]: Start accepts. Operand has 169 places, 267 transitions, 5693 flow [2022-12-06 07:50:27,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:27,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:27,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 267 transitions, 5693 flow [2022-12-06 07:50:27,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 267 transitions, 5693 flow [2022-12-06 07:50:27,457 INFO L130 PetriNetUnfolder]: 219/684 cut-off events. [2022-12-06 07:50:27,457 INFO L131 PetriNetUnfolder]: For 17734/17944 co-relation queries the response was YES. [2022-12-06 07:50:27,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 684 events. 219/684 cut-off events. For 17734/17944 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4885 event pairs, 8 based on Foata normal form. 81/761 useless extension candidates. Maximal degree in co-relation 5047. Up to 192 conditions per place. [2022-12-06 07:50:27,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 267 transitions, 5693 flow [2022-12-06 07:50:27,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-06 07:50:27,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:50:27,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:50:27,700 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:27,700 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:27,700 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:27,700 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:27,701 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:27,701 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:27,976 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:50:27,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-06 07:50:27,977 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 266 transitions, 5702 flow [2022-12-06 07:50:27,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:50:27,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:27,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:27,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-06 07:50:28,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-12-06 07:50:28,182 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:28,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1746151609, now seen corresponding path program 1 times [2022-12-06 07:50:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:28,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92239451] [2022-12-06 07:50:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:28,223 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 07:50:28,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:28,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92239451] [2022-12-06 07:50:28,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92239451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:28,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:28,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:50:28,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754296785] [2022-12-06 07:50:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:28,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:50:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:50:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:50:28,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:50:28,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 266 transitions, 5702 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:28,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:28,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:50:28,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:28,530 INFO L130 PetriNetUnfolder]: 798/1518 cut-off events. [2022-12-06 07:50:28,530 INFO L131 PetriNetUnfolder]: For 42506/42594 co-relation queries the response was YES. [2022-12-06 07:50:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13495 conditions, 1518 events. 798/1518 cut-off events. For 42506/42594 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9020 event pairs, 83 based on Foata normal form. 70/1588 useless extension candidates. Maximal degree in co-relation 13103. Up to 1266 conditions per place. [2022-12-06 07:50:28,542 INFO L137 encePairwiseOnDemand]: 21/43 looper letters, 221 selfloop transitions, 59 changer transitions 6/287 dead transitions. [2022-12-06 07:50:28,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 287 transitions, 6559 flow [2022-12-06 07:50:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:50:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:50:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 07:50:28,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36627906976744184 [2022-12-06 07:50:28,543 INFO L175 Difference]: Start difference. First operand has 165 places, 266 transitions, 5702 flow. Second operand 4 states and 63 transitions. [2022-12-06 07:50:28,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 287 transitions, 6559 flow [2022-12-06 07:50:28,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 287 transitions, 6319 flow, removed 102 selfloop flow, removed 5 redundant places. [2022-12-06 07:50:28,656 INFO L231 Difference]: Finished difference. Result has 164 places, 261 transitions, 5467 flow [2022-12-06 07:50:28,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5434, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5467, PETRI_PLACES=164, PETRI_TRANSITIONS=261} [2022-12-06 07:50:28,656 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2022-12-06 07:50:28,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:28,656 INFO L89 Accepts]: Start accepts. Operand has 164 places, 261 transitions, 5467 flow [2022-12-06 07:50:28,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:28,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:28,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 261 transitions, 5467 flow [2022-12-06 07:50:28,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 261 transitions, 5467 flow [2022-12-06 07:50:28,737 INFO L130 PetriNetUnfolder]: 212/666 cut-off events. [2022-12-06 07:50:28,737 INFO L131 PetriNetUnfolder]: For 17122/17311 co-relation queries the response was YES. [2022-12-06 07:50:28,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 666 events. 212/666 cut-off events. For 17122/17311 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4754 event pairs, 8 based on Foata normal form. 82/744 useless extension candidates. Maximal degree in co-relation 4958. Up to 189 conditions per place. [2022-12-06 07:50:28,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 261 transitions, 5467 flow [2022-12-06 07:50:28,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-06 07:50:28,744 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:28,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:50:28,745 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 261 transitions, 5467 flow [2022-12-06 07:50:28,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:28,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:28,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:28,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 07:50:28,745 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1254106397, now seen corresponding path program 1 times [2022-12-06 07:50:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130411153] [2022-12-06 07:50:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:30,214 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 07:50:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:30,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130411153] [2022-12-06 07:50:30,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130411153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:30,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:30,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:50:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385037012] [2022-12-06 07:50:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:30,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:50:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:50:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:50:30,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 07:50:30,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 261 transitions, 5467 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 07:50:30,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:30,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 07:50:30,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:30,587 INFO L130 PetriNetUnfolder]: 791/1491 cut-off events. [2022-12-06 07:50:30,587 INFO L131 PetriNetUnfolder]: For 40928/41018 co-relation queries the response was YES. [2022-12-06 07:50:30,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13248 conditions, 1491 events. 791/1491 cut-off events. For 40928/41018 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8749 event pairs, 192 based on Foata normal form. 41/1532 useless extension candidates. Maximal degree in co-relation 13019. Up to 1431 conditions per place. [2022-12-06 07:50:30,597 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 248 selfloop transitions, 18 changer transitions 5/272 dead transitions. [2022-12-06 07:50:30,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 272 transitions, 6045 flow [2022-12-06 07:50:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:50:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:50:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 07:50:30,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2022-12-06 07:50:30,598 INFO L175 Difference]: Start difference. First operand has 163 places, 261 transitions, 5467 flow. Second operand 6 states and 60 transitions. [2022-12-06 07:50:30,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 272 transitions, 6045 flow [2022-12-06 07:50:30,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 272 transitions, 5882 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 07:50:30,705 INFO L231 Difference]: Finished difference. Result has 164 places, 260 transitions, 5315 flow [2022-12-06 07:50:30,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5304, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5315, PETRI_PLACES=164, PETRI_TRANSITIONS=260} [2022-12-06 07:50:30,706 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2022-12-06 07:50:30,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:30,706 INFO L89 Accepts]: Start accepts. Operand has 164 places, 260 transitions, 5315 flow [2022-12-06 07:50:30,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:30,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:30,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 260 transitions, 5315 flow [2022-12-06 07:50:30,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 260 transitions, 5315 flow [2022-12-06 07:50:30,794 INFO L130 PetriNetUnfolder]: 214/657 cut-off events. [2022-12-06 07:50:30,794 INFO L131 PetriNetUnfolder]: For 16319/16509 co-relation queries the response was YES. [2022-12-06 07:50:30,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4920 conditions, 657 events. 214/657 cut-off events. For 16319/16509 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4624 event pairs, 8 based on Foata normal form. 79/732 useless extension candidates. Maximal degree in co-relation 4848. Up to 190 conditions per place. [2022-12-06 07:50:30,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 260 transitions, 5315 flow [2022-12-06 07:50:30,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 07:50:30,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:30,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:50:30,801 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 260 transitions, 5315 flow [2022-12-06 07:50:30,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 07:50:30,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:30,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:30,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 07:50:30,801 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash 828957235, now seen corresponding path program 1 times [2022-12-06 07:50:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:30,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281390848] [2022-12-06 07:50:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:31,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281390848] [2022-12-06 07:50:31,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281390848] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:31,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087323455] [2022-12-06 07:50:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:31,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:31,264 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:31,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 07:50:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:31,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 07:50:31,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:31,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:31,467 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 19 treesize of output 21 [2022-12-06 07:50:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:31,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:31,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:31,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 07:50:31,545 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 25 treesize of output 18 [2022-12-06 07:50:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:31,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087323455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:31,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:31,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:50:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141225289] [2022-12-06 07:50:31,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:31,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:50:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:50:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2022-12-06 07:50:31,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:50:31,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 260 transitions, 5315 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:31,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:31,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:50:31,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:32,199 INFO L130 PetriNetUnfolder]: 830/1554 cut-off events. [2022-12-06 07:50:32,199 INFO L131 PetriNetUnfolder]: For 40787/40852 co-relation queries the response was YES. [2022-12-06 07:50:32,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13570 conditions, 1554 events. 830/1554 cut-off events. For 40787/40852 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9007 event pairs, 87 based on Foata normal form. 73/1627 useless extension candidates. Maximal degree in co-relation 13495. Up to 1056 conditions per place. [2022-12-06 07:50:32,211 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 205 selfloop transitions, 93 changer transitions 0/299 dead transitions. [2022-12-06 07:50:32,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 299 transitions, 6445 flow [2022-12-06 07:50:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:50:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:50:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-06 07:50:32,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29343629343629346 [2022-12-06 07:50:32,211 INFO L175 Difference]: Start difference. First operand has 163 places, 260 transitions, 5315 flow. Second operand 7 states and 76 transitions. [2022-12-06 07:50:32,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 299 transitions, 6445 flow [2022-12-06 07:50:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 299 transitions, 6407 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 07:50:32,317 INFO L231 Difference]: Finished difference. Result has 166 places, 271 transitions, 5806 flow [2022-12-06 07:50:32,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5277, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5806, PETRI_PLACES=166, PETRI_TRANSITIONS=271} [2022-12-06 07:50:32,317 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 145 predicate places. [2022-12-06 07:50:32,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:32,317 INFO L89 Accepts]: Start accepts. Operand has 166 places, 271 transitions, 5806 flow [2022-12-06 07:50:32,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:32,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:32,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 271 transitions, 5806 flow [2022-12-06 07:50:32,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 271 transitions, 5806 flow [2022-12-06 07:50:32,399 INFO L130 PetriNetUnfolder]: 222/687 cut-off events. [2022-12-06 07:50:32,399 INFO L131 PetriNetUnfolder]: For 18432/18625 co-relation queries the response was YES. [2022-12-06 07:50:32,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 687 events. 222/687 cut-off events. For 18432/18625 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4893 event pairs, 8 based on Foata normal form. 82/765 useless extension candidates. Maximal degree in co-relation 5074. Up to 198 conditions per place. [2022-12-06 07:50:32,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 271 transitions, 5806 flow [2022-12-06 07:50:32,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 874 [2022-12-06 07:50:32,406 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:32,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:50:32,407 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 271 transitions, 5806 flow [2022-12-06 07:50:32,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:32,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:32,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:32,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:32,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:32,612 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2139837605, now seen corresponding path program 1 times [2022-12-06 07:50:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:32,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133848527] [2022-12-06 07:50:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:32,684 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 07:50:32,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:32,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133848527] [2022-12-06 07:50:32,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133848527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:32,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:32,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:50:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128075950] [2022-12-06 07:50:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:32,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:50:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:32,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:50:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:50:32,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:50:32,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 271 transitions, 5806 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:50:32,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:32,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:50:32,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:33,081 INFO L130 PetriNetUnfolder]: 1066/1997 cut-off events. [2022-12-06 07:50:33,081 INFO L131 PetriNetUnfolder]: For 55343/55442 co-relation queries the response was YES. [2022-12-06 07:50:33,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18206 conditions, 1997 events. 1066/1997 cut-off events. For 55343/55442 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12282 event pairs, 77 based on Foata normal form. 76/2073 useless extension candidates. Maximal degree in co-relation 17557. Up to 1045 conditions per place. [2022-12-06 07:50:33,096 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 189 selfloop transitions, 161 changer transitions 6/357 dead transitions. [2022-12-06 07:50:33,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 357 transitions, 8208 flow [2022-12-06 07:50:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:50:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:50:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 07:50:33,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2022-12-06 07:50:33,097 INFO L175 Difference]: Start difference. First operand has 166 places, 271 transitions, 5806 flow. Second operand 5 states and 70 transitions. [2022-12-06 07:50:33,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 357 transitions, 8208 flow [2022-12-06 07:50:33,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 357 transitions, 8050 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-06 07:50:33,247 INFO L231 Difference]: Finished difference. Result has 171 places, 321 transitions, 7544 flow [2022-12-06 07:50:33,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5690, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7544, PETRI_PLACES=171, PETRI_TRANSITIONS=321} [2022-12-06 07:50:33,247 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 150 predicate places. [2022-12-06 07:50:33,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:33,247 INFO L89 Accepts]: Start accepts. Operand has 171 places, 321 transitions, 7544 flow [2022-12-06 07:50:33,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:33,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:33,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 321 transitions, 7544 flow [2022-12-06 07:50:33,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 321 transitions, 7544 flow [2022-12-06 07:50:33,359 INFO L130 PetriNetUnfolder]: 280/860 cut-off events. [2022-12-06 07:50:33,359 INFO L131 PetriNetUnfolder]: For 27761/28170 co-relation queries the response was YES. [2022-12-06 07:50:33,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7331 conditions, 860 events. 280/860 cut-off events. For 27761/28170 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6403 event pairs, 8 based on Foata normal form. 138/995 useless extension candidates. Maximal degree in co-relation 7160. Up to 259 conditions per place. [2022-12-06 07:50:33,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 321 transitions, 7544 flow [2022-12-06 07:50:33,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 07:50:33,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_648| v_~q~0.base_438)) (.cse1 (* v_~q_back~0_873 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_438)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415| 0)) (not (= 0 (ite (and (<= 0 v_~q_back~0_873) (< v_~q_back~0_873 v_~n~0_434)) 1 0))) (< 2 v_~N~0_330) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_445| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|) (= (+ 3 v_~q_back~0_873) v_~q_back~0_871) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_873))) (and (<= 0 .cse2) (< .cse2 v_~n~0_434))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_873, #memory_int=|v_#memory_int_648|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_291|, ~q_back~0=v_~q_back~0_871, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_287|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_445|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|, #memory_int=|v_#memory_int_648|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_287|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:50:33,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:50:33,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 07:50:33,533 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 321 transitions, 7562 flow [2022-12-06 07:50:33,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 07:50:33,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:33,533 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:33,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 07:50:33,533 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1389828171, now seen corresponding path program 2 times [2022-12-06 07:50:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:33,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617255422] [2022-12-06 07:50:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617255422] [2022-12-06 07:50:34,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617255422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302296690] [2022-12-06 07:50:34,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:50:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:34,225 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:34,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 07:50:34,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:50:34,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:50:34,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:50:34,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:34,503 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 30 treesize of output 30 [2022-12-06 07:50:34,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:34,569 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 59 treesize of output 16 [2022-12-06 07:50:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:34,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:34,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:34,719 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 197 treesize of output 180 [2022-12-06 07:50:34,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:34,727 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 119 treesize of output 99 [2022-12-06 07:50:34,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:34,732 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 99 treesize of output 79 [2022-12-06 07:50:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302296690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:34,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:50:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550881383] [2022-12-06 07:50:34,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:34,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:50:34,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:34,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:50:34,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:50:34,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:50:34,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 321 transitions, 7562 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:50:34,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:34,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:50:34,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:37,245 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 07:50:37,661 INFO L130 PetriNetUnfolder]: 1061/1990 cut-off events. [2022-12-06 07:50:37,661 INFO L131 PetriNetUnfolder]: For 64411/64503 co-relation queries the response was YES. [2022-12-06 07:50:37,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19591 conditions, 1990 events. 1061/1990 cut-off events. For 64411/64503 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12290 event pairs, 229 based on Foata normal form. 77/2067 useless extension candidates. Maximal degree in co-relation 19182. Up to 1844 conditions per place. [2022-12-06 07:50:37,675 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 306 selfloop transitions, 38 changer transitions 2/347 dead transitions. [2022-12-06 07:50:37,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 347 transitions, 8490 flow [2022-12-06 07:50:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:50:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:50:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 07:50:37,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24624624624624625 [2022-12-06 07:50:37,676 INFO L175 Difference]: Start difference. First operand has 170 places, 321 transitions, 7562 flow. Second operand 9 states and 82 transitions. [2022-12-06 07:50:37,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 347 transitions, 8490 flow [2022-12-06 07:50:37,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 347 transitions, 8340 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-06 07:50:37,872 INFO L231 Difference]: Finished difference. Result has 178 places, 325 transitions, 7612 flow [2022-12-06 07:50:37,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7416, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7612, PETRI_PLACES=178, PETRI_TRANSITIONS=325} [2022-12-06 07:50:37,872 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2022-12-06 07:50:37,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:37,872 INFO L89 Accepts]: Start accepts. Operand has 178 places, 325 transitions, 7612 flow [2022-12-06 07:50:37,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:37,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:37,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 325 transitions, 7612 flow [2022-12-06 07:50:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 325 transitions, 7612 flow [2022-12-06 07:50:37,982 INFO L130 PetriNetUnfolder]: 281/864 cut-off events. [2022-12-06 07:50:37,982 INFO L131 PetriNetUnfolder]: For 27779/28181 co-relation queries the response was YES. [2022-12-06 07:50:37,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 864 events. 281/864 cut-off events. For 27779/28181 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6516 event pairs, 8 based on Foata normal form. 137/998 useless extension candidates. Maximal degree in co-relation 7010. Up to 263 conditions per place. [2022-12-06 07:50:37,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 325 transitions, 7612 flow [2022-12-06 07:50:37,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-06 07:50:37,991 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:37,991 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:37,991 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:37,991 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:37,991 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:37,991 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_721| v_~q~0.base_485)) (.cse1 (* v_~q_back~0_957 4))) (and (= (select .cse0 (+ (* 4 v_~q_front~0_820) v_~q~0.offset_485)) |v_thread2Thread1of1ForFork1_~j~0#1_485|) (= (+ v_~s~0_742 |v_thread2Thread1of1ForFork1_~j~0#1_485|) v_~s~0_741) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_485)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459| 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_957))) (and (<= 0 .cse2) (< .cse2 v_~n~0_476))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485 4)) 1) 1 0))) (= (+ 1 v_~q_front~0_820) v_~q_front~0_819) (= (+ 3 v_~q_back~0_957) v_~q_back~0_956) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|) (not (= (ite (and (<= 0 v_~q_back~0_957) (< v_~q_back~0_957 v_~n~0_476)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< 2 v_~N~0_358) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_485| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| (ite (and (<= 0 v_~q_front~0_820) (< v_~q_front~0_820 v_~q_back~0_956) (< v_~q_front~0_820 v_~n~0_476)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_957, #memory_int=|v_#memory_int_721|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, ~n~0=v_~n~0_476, ~q~0.offset=v_~q~0.offset_485, ~s~0=v_~s~0_742, ~q_front~0=v_~q_front~0_820} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_485|, ~q_back~0=v_~q_back~0_956, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_443|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_313|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_443|, ~q~0.offset=v_~q~0.offset_485, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_317|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_313|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_721|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|, ~n~0=v_~n~0_476, ~s~0=v_~s~0_741, ~q_front~0=v_~q_front~0_819} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:38,231 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,231 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,231 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,231 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,231 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,231 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:38,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:50:38,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-06 07:50:38,595 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 325 transitions, 7662 flow [2022-12-06 07:50:38,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:50:38,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:38,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:38,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:38,796 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1562240909, now seen corresponding path program 1 times [2022-12-06 07:50:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619068051] [2022-12-06 07:50:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619068051] [2022-12-06 07:50:39,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619068051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914379545] [2022-12-06 07:50:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:39,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:39,537 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:39,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 07:50:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:39,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 07:50:39,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:39,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:39,765 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 07:50:39,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:39,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:50:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:39,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:39,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:40,000 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 181 treesize of output 174 [2022-12-06 07:50:40,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:40,012 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 110 treesize of output 97 [2022-12-06 07:50:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:40,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914379545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:40,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:50:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83642843] [2022-12-06 07:50:40,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:40,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:50:40,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:40,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:50:40,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:50:40,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 07:50:40,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 325 transitions, 7662 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:50:40,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:40,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 07:50:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:41,303 INFO L130 PetriNetUnfolder]: 1093/2059 cut-off events. [2022-12-06 07:50:41,304 INFO L131 PetriNetUnfolder]: For 65528/65639 co-relation queries the response was YES. [2022-12-06 07:50:41,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20207 conditions, 2059 events. 1093/2059 cut-off events. For 65528/65639 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12910 event pairs, 224 based on Foata normal form. 73/2132 useless extension candidates. Maximal degree in co-relation 19330. Up to 1913 conditions per place. [2022-12-06 07:50:41,319 INFO L137 encePairwiseOnDemand]: 12/39 looper letters, 301 selfloop transitions, 50 changer transitions 13/365 dead transitions. [2022-12-06 07:50:41,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 365 transitions, 8900 flow [2022-12-06 07:50:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:50:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:50:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 07:50:41,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21153846153846154 [2022-12-06 07:50:41,320 INFO L175 Difference]: Start difference. First operand has 178 places, 325 transitions, 7662 flow. Second operand 12 states and 99 transitions. [2022-12-06 07:50:41,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 365 transitions, 8900 flow [2022-12-06 07:50:41,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 365 transitions, 8764 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-06 07:50:41,516 INFO L231 Difference]: Finished difference. Result has 191 places, 335 transitions, 7956 flow [2022-12-06 07:50:41,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7526, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7956, PETRI_PLACES=191, PETRI_TRANSITIONS=335} [2022-12-06 07:50:41,516 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-06 07:50:41,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:41,516 INFO L89 Accepts]: Start accepts. Operand has 191 places, 335 transitions, 7956 flow [2022-12-06 07:50:41,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:41,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:41,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 335 transitions, 7956 flow [2022-12-06 07:50:41,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 335 transitions, 7956 flow [2022-12-06 07:50:41,638 INFO L130 PetriNetUnfolder]: 286/884 cut-off events. [2022-12-06 07:50:41,638 INFO L131 PetriNetUnfolder]: For 30157/30596 co-relation queries the response was YES. [2022-12-06 07:50:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7633 conditions, 884 events. 286/884 cut-off events. For 30157/30596 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6722 event pairs, 8 based on Foata normal form. 139/1020 useless extension candidates. Maximal degree in co-relation 7485. Up to 270 conditions per place. [2022-12-06 07:50:41,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 335 transitions, 7956 flow [2022-12-06 07:50:41,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-06 07:50:41,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_725| v_~q~0.base_487)) (.cse5 (* 4 v_~q_front~0_829))) (let ((.cse3 (select .cse0 (+ v_~q~0.offset_487 .cse5))) (.cse1 (* v_~q_back~0_964 4))) (and (< 2 v_~N~0_360) (= |v_thread1Thread1of1ForFork0_~i~0#1_487| 3) (not (= (ite (and (< v_~q_front~0_829 v_~q_back~0_963) (< v_~q_front~0_829 v_~n~0_478) (<= 0 v_~q_front~0_829)) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_487)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|) (= (ite (let ((.cse2 (+ 1 v_~q_front~0_829))) (and (< .cse2 v_~q_back~0_963) (< .cse2 v_~n~0_478) (<= 0 .cse2))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487)) 1) 1 0) 0)) (not (= .cse3 0)) (not (= (ite (let ((.cse4 (+ 2 v_~q_back~0_964))) (and (< .cse4 v_~n~0_478) (<= 0 .cse4))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464| 0)) (= (+ .cse3 v_~s~0_753 |v_thread2Thread1of1ForFork1_~j~0#1_492|) v_~s~0_751) (= (select .cse0 (+ v_~q~0.offset_487 .cse5 4)) |v_thread2Thread1of1ForFork1_~j~0#1_492|) (= v_~q_back~0_963 (+ 3 v_~q_back~0_964)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_492| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|) (= (+ 2 v_~q_front~0_829) v_~q_front~0_827) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_964 v_~n~0_478) (<= 0 v_~q_back~0_964)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_964, #memory_int=|v_#memory_int_725|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, ~n~0=v_~n~0_478, ~q~0.offset=v_~q~0.offset_487, ~s~0=v_~s~0_753, ~q_front~0=v_~q_front~0_829} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_492|, ~q_back~0=v_~q_back~0_963, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_449|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_317|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_449|, ~q~0.offset=v_~q~0.offset_487, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_321|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_487|, #memory_int=|v_#memory_int_725|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|, ~n~0=v_~n~0_478, ~s~0=v_~s~0_751, ~q_front~0=v_~q_front~0_827} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:42,144 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:42,144 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:42,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_725| v_~q~0.base_487)) (.cse5 (* 4 v_~q_front~0_829))) (let ((.cse3 (select .cse0 (+ v_~q~0.offset_487 .cse5))) (.cse1 (* v_~q_back~0_964 4))) (and (< 2 v_~N~0_360) (= |v_thread1Thread1of1ForFork0_~i~0#1_487| 3) (not (= (ite (and (< v_~q_front~0_829 v_~q_back~0_963) (< v_~q_front~0_829 v_~n~0_478) (<= 0 v_~q_front~0_829)) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_487)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|) (= (ite (let ((.cse2 (+ 1 v_~q_front~0_829))) (and (< .cse2 v_~q_back~0_963) (< .cse2 v_~n~0_478) (<= 0 .cse2))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487)) 1) 1 0) 0)) (not (= .cse3 0)) (not (= (ite (let ((.cse4 (+ 2 v_~q_back~0_964))) (and (< .cse4 v_~n~0_478) (<= 0 .cse4))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464| 0)) (= (+ .cse3 v_~s~0_753 |v_thread2Thread1of1ForFork1_~j~0#1_492|) v_~s~0_751) (= (select .cse0 (+ v_~q~0.offset_487 .cse5 4)) |v_thread2Thread1of1ForFork1_~j~0#1_492|) (= v_~q_back~0_963 (+ 3 v_~q_back~0_964)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_492| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|) (= (+ 2 v_~q_front~0_829) v_~q_front~0_827) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_964 v_~n~0_478) (<= 0 v_~q_back~0_964)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_964, #memory_int=|v_#memory_int_725|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, ~n~0=v_~n~0_478, ~q~0.offset=v_~q~0.offset_487, ~s~0=v_~s~0_753, ~q_front~0=v_~q_front~0_829} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_492|, ~q_back~0=v_~q_back~0_963, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_449|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_317|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_449|, ~q~0.offset=v_~q~0.offset_487, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_321|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_487|, #memory_int=|v_#memory_int_725|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|, ~n~0=v_~n~0_478, ~s~0=v_~s~0_751, ~q_front~0=v_~q_front~0_827} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:50:43,098 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:43,099 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:43,582 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:43,583 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:43,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_737| v_~q~0.base_497)) (.cse3 (* 4 v_~q_front~0_858))) (let ((.cse1 (select .cse2 (+ .cse3 v_~q~0.offset_497 4))) (.cse0 (select .cse2 (+ .cse3 v_~q~0.offset_497))) (.cse4 (* v_~q_back~0_994 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484| 0)) (= v_~s~0_781 (+ .cse0 .cse1 v_~s~0_783 |v_thread2Thread1of1ForFork1_~j~0#1_511|)) (= (select .cse2 (+ .cse3 8 v_~q~0.offset_497)) |v_thread2Thread1of1ForFork1_~j~0#1_511|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_497)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_113| 0) (= (+ 3 v_~q_front~0_858) v_~q_front~0_856) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| 3) (= (+ 3 v_~q_back~0_994) v_~q_back~0_993) (= |v_thread2Thread1of1ForFork1_~j~0#1_511| 0) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497)) 1) 1 0) 0)) (not (= .cse1 0)) (not (= 0 (ite (let ((.cse5 (+ 2 v_~q_back~0_994))) (and (< .cse5 v_~n~0_488) (<= 0 .cse5))) 1 0))) (< 2 v_~N~0_370) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_113| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (not (= 0 (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497 4)) 1) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (let ((.cse6 (+ 2 v_~q_front~0_858))) (and (< .cse6 v_~n~0_488) (< .cse6 v_~q_back~0_993) (<= 0 .cse6))) 1 0)) (not (= (ite (and (< v_~q_front~0_858 v_~n~0_488) (< v_~q_front~0_858 v_~q_back~0_993) (<= 0 v_~q_front~0_858)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_994, #memory_int=|v_#memory_int_737|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_488, ~q~0.offset=v_~q~0.offset_497, ~s~0=v_~s~0_783, ~q_front~0=v_~q_front~0_858} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_511|, ~q_back~0=v_~q_back~0_993, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_113|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_467|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_334|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_467|, ~q~0.offset=v_~q~0.offset_497, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_113|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_338|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_334|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_737|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|, ~n~0=v_~n~0_488, ~s~0=v_~s~0_781, ~q_front~0=v_~q_front~0_856} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:44,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_737| v_~q~0.base_497)) (.cse3 (* 4 v_~q_front~0_858))) (let ((.cse1 (select .cse2 (+ .cse3 v_~q~0.offset_497 4))) (.cse0 (select .cse2 (+ .cse3 v_~q~0.offset_497))) (.cse4 (* v_~q_back~0_994 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484| 0)) (= v_~s~0_781 (+ .cse0 .cse1 v_~s~0_783 |v_thread2Thread1of1ForFork1_~j~0#1_511|)) (= (select .cse2 (+ .cse3 8 v_~q~0.offset_497)) |v_thread2Thread1of1ForFork1_~j~0#1_511|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_497)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_113| 0) (= (+ 3 v_~q_front~0_858) v_~q_front~0_856) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| 3) (= (+ 3 v_~q_back~0_994) v_~q_back~0_993) (= |v_thread2Thread1of1ForFork1_~j~0#1_511| 0) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497)) 1) 1 0) 0)) (not (= .cse1 0)) (not (= 0 (ite (let ((.cse5 (+ 2 v_~q_back~0_994))) (and (< .cse5 v_~n~0_488) (<= 0 .cse5))) 1 0))) (< 2 v_~N~0_370) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_113| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (not (= 0 (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497 4)) 1) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (let ((.cse6 (+ 2 v_~q_front~0_858))) (and (< .cse6 v_~n~0_488) (< .cse6 v_~q_back~0_993) (<= 0 .cse6))) 1 0)) (not (= (ite (and (< v_~q_front~0_858 v_~n~0_488) (< v_~q_front~0_858 v_~q_back~0_993) (<= 0 v_~q_front~0_858)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_994, #memory_int=|v_#memory_int_737|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_488, ~q~0.offset=v_~q~0.offset_497, ~s~0=v_~s~0_783, ~q_front~0=v_~q_front~0_858} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_511|, ~q_back~0=v_~q_back~0_993, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_113|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_467|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_334|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_467|, ~q~0.offset=v_~q~0.offset_497, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_113|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_338|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_334|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_737|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|, ~n~0=v_~n~0_488, ~s~0=v_~s~0_781, ~q_front~0=v_~q_front~0_856} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:50:44,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_735| v_~q~0.base_495)) (.cse5 (* 4 v_~q_front~0_853))) (let ((.cse2 (* v_~q_back~0_989 4)) (.cse3 (+ 2 v_~q_front~0_853)) (.cse4 (+ 1 v_~q_front~0_853)) (.cse0 (select .cse1 (+ .cse5 v_~q~0.offset_495)))) (and (not (= (ite (and (< v_~q_back~0_987 (+ v_~n~0_486 1)) (<= 1 v_~q_back~0_987)) 1 0) 0)) (= (+ .cse0 v_~s~0_778 |v_thread2Thread1of1ForFork1_~j~0#1_509|) v_~s~0_777) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_480| (ite (= (select .cse1 (+ (- 4) (* v_~q_back~0_987 4) v_~q~0.offset_495)) 0) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_200| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_495)) 1) 1 0) 0)) (= .cse3 v_~q_front~0_852) (not (= (ite (and (< v_~q_front~0_853 v_~n~0_486) (<= 0 v_~q_front~0_853) (< .cse4 v_~q_back~0_987)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_989 v_~n~0_486) (<= 0 v_~q_back~0_989)) 1 0) 0)) (= (select .cse1 (+ .cse5 v_~q~0.offset_495 4)) |v_thread2Thread1of1ForFork1_~j~0#1_509|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_200| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_480| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_480|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_480| 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_495)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_509| 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_495 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| (ite (and (< .cse4 v_~n~0_486) (< .cse3 v_~q_back~0_987) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_503| 3) (= v_~q_back~0_987 (+ v_~q_back~0_989 4)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_503| v_~N~0_368)) (not (= .cse0 0)) (< 2 v_~N~0_368)))) InVars {~q_back~0=v_~q_back~0_989, #memory_int=|v_#memory_int_735|, ~N~0=v_~N~0_368, ~q~0.base=v_~q~0.base_495, ~n~0=v_~n~0_486, ~q~0.offset=v_~q~0.offset_495, ~s~0=v_~s~0_778, ~q_front~0=v_~q_front~0_853} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_509|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_200|, ~q_back~0=v_~q_back~0_987, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_218|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_465|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_332|, ~N~0=v_~N~0_368, ~q~0.base=v_~q~0.base_495, ~q~0.offset=v_~q~0.offset_495, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_465|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_480|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_336|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_332|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_503|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_218|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_480|, #memory_int=|v_#memory_int_735|, ~n~0=v_~n~0_486, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_200|, ~s~0=v_~s~0_777, ~q_front~0=v_~q_front~0_852} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [771] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_739| v_~q~0.base_499)) (.cse1 (* 4 v_~q_front~0_864))) (and (not (= (+ v_~s~0_789 |v_thread2Thread1of1ForFork1_~j~0#1_515|) v_~s~0_787)) (= (select .cse0 (+ .cse1 v_~q~0.offset_499 4)) |v_thread2Thread1of1ForFork1_~j~0#1_515|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471| 0)) (not (= (ite (and (<= 0 v_~q_front~0_864) (< v_~q_front~0_864 v_~q_back~0_997) (< v_~q_front~0_864 v_~n~0_490)) 1 0) 0)) (= (+ 2 v_~q_front~0_864) v_~q_front~0_862) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| (ite (let ((.cse2 (+ 1 v_~q_front~0_864))) (and (< .cse2 v_~n~0_490) (< .cse2 v_~q_back~0_997) (<= 0 .cse2))) 1 0)) (= (+ (select .cse0 (+ .cse1 v_~q~0.offset_499)) v_~s~0_789 |v_thread2Thread1of1ForFork1_~j~0#1_515|) v_~s~0_787) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_515| 0)))) InVars {~q_back~0=v_~q_back~0_997, #memory_int=|v_#memory_int_739|, ~q~0.base=v_~q~0.base_499, ~n~0=v_~n~0_490, ~q~0.offset=v_~q~0.offset_499, ~s~0=v_~s~0_789, ~q_front~0=v_~q_front~0_864} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_515|, ~q_back~0=v_~q_back~0_997, #memory_int=|v_#memory_int_739|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_471|, ~q~0.base=v_~q~0.base_499, ~n~0=v_~n~0_490, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_471|, ~q~0.offset=v_~q~0.offset_499, ~s~0=v_~s~0_787, ~q_front~0=v_~q_front~0_862} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:50:44,466 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:44,466 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:44,467 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:44,467 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:44,467 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:44,467 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:45,027 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:50:45,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3512 [2022-12-06 07:50:45,028 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 333 transitions, 8070 flow [2022-12-06 07:50:45,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:50:45,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:45,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:45,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:45,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-06 07:50:45,233 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:45,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1986601575, now seen corresponding path program 1 times [2022-12-06 07:50:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:45,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631092837] [2022-12-06 07:50:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:45,418 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 07:50:45,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:45,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631092837] [2022-12-06 07:50:45,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631092837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:45,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:45,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:50:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639616857] [2022-12-06 07:50:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:45,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:50:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:50:45,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:50:45,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:50:45,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 333 transitions, 8070 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 07:50:45,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:45,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:50:45,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:45,868 INFO L130 PetriNetUnfolder]: 1078/2016 cut-off events. [2022-12-06 07:50:45,868 INFO L131 PetriNetUnfolder]: For 70644/70747 co-relation queries the response was YES. [2022-12-06 07:50:45,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19935 conditions, 2016 events. 1078/2016 cut-off events. For 70644/70747 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12379 event pairs, 258 based on Foata normal form. 71/2087 useless extension candidates. Maximal degree in co-relation 19744. Up to 1950 conditions per place. [2022-12-06 07:50:45,883 INFO L137 encePairwiseOnDemand]: 22/45 looper letters, 312 selfloop transitions, 23 changer transitions 2/338 dead transitions. [2022-12-06 07:50:45,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 338 transitions, 8677 flow [2022-12-06 07:50:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:50:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:50:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 07:50:45,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2022-12-06 07:50:45,884 INFO L175 Difference]: Start difference. First operand has 188 places, 333 transitions, 8070 flow. Second operand 3 states and 59 transitions. [2022-12-06 07:50:45,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 338 transitions, 8677 flow [2022-12-06 07:50:46,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 338 transitions, 8551 flow, removed 44 selfloop flow, removed 7 redundant places. [2022-12-06 07:50:46,063 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 7792 flow [2022-12-06 07:50:46,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7727, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7792, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2022-12-06 07:50:46,063 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 162 predicate places. [2022-12-06 07:50:46,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:46,063 INFO L89 Accepts]: Start accepts. Operand has 183 places, 330 transitions, 7792 flow [2022-12-06 07:50:46,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:46,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:46,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 330 transitions, 7792 flow [2022-12-06 07:50:46,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 330 transitions, 7792 flow [2022-12-06 07:50:46,182 INFO L130 PetriNetUnfolder]: 287/872 cut-off events. [2022-12-06 07:50:46,182 INFO L131 PetriNetUnfolder]: For 29457/29883 co-relation queries the response was YES. [2022-12-06 07:50:46,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7540 conditions, 872 events. 287/872 cut-off events. For 29457/29883 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6507 event pairs, 7 based on Foata normal form. 138/1007 useless extension candidates. Maximal degree in co-relation 7239. Up to 268 conditions per place. [2022-12-06 07:50:46,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 330 transitions, 7792 flow [2022-12-06 07:50:46,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-06 07:50:46,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:46,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 07:50:46,194 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 330 transitions, 7792 flow [2022-12-06 07:50:46,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 07:50:46,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:46,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:46,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 07:50:46,194 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1646597253, now seen corresponding path program 1 times [2022-12-06 07:50:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:46,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085212465] [2022-12-06 07:50:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:46,412 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 07:50:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:46,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085212465] [2022-12-06 07:50:46,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085212465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:46,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:46,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:50:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774982270] [2022-12-06 07:50:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:46,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:50:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:46,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:50:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:50:46,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:50:46,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 330 transitions, 7792 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:50:46,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:46,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:50:46,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:47,007 INFO L130 PetriNetUnfolder]: 1106/2073 cut-off events. [2022-12-06 07:50:47,007 INFO L131 PetriNetUnfolder]: For 68078/68166 co-relation queries the response was YES. [2022-12-06 07:50:47,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20370 conditions, 2073 events. 1106/2073 cut-off events. For 68078/68166 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12835 event pairs, 285 based on Foata normal form. 53/2126 useless extension candidates. Maximal degree in co-relation 19589. Up to 1969 conditions per place. [2022-12-06 07:50:47,024 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 328 selfloop transitions, 26 changer transitions 0/355 dead transitions. [2022-12-06 07:50:47,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 355 transitions, 8877 flow [2022-12-06 07:50:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:50:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:50:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 07:50:47,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 07:50:47,025 INFO L175 Difference]: Start difference. First operand has 181 places, 330 transitions, 7792 flow. Second operand 6 states and 68 transitions. [2022-12-06 07:50:47,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 355 transitions, 8877 flow [2022-12-06 07:50:47,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 8803 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:50:47,216 INFO L231 Difference]: Finished difference. Result has 186 places, 340 transitions, 8070 flow [2022-12-06 07:50:47,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7720, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8070, PETRI_PLACES=186, PETRI_TRANSITIONS=340} [2022-12-06 07:50:47,217 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 165 predicate places. [2022-12-06 07:50:47,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:47,217 INFO L89 Accepts]: Start accepts. Operand has 186 places, 340 transitions, 8070 flow [2022-12-06 07:50:47,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:47,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:47,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 340 transitions, 8070 flow [2022-12-06 07:50:47,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 340 transitions, 8070 flow [2022-12-06 07:50:47,337 INFO L130 PetriNetUnfolder]: 295/903 cut-off events. [2022-12-06 07:50:47,337 INFO L131 PetriNetUnfolder]: For 30453/30865 co-relation queries the response was YES. [2022-12-06 07:50:47,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7795 conditions, 903 events. 295/903 cut-off events. For 30453/30865 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6846 event pairs, 8 based on Foata normal form. 137/1037 useless extension candidates. Maximal degree in co-relation 7493. Up to 284 conditions per place. [2022-12-06 07:50:47,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 340 transitions, 8070 flow [2022-12-06 07:50:47,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-06 07:50:47,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:47,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:50:47,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:50:47,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-06 07:50:47,738 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 340 transitions, 8140 flow [2022-12-06 07:50:47,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:50:47,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:47,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:47,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 07:50:47,738 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1517066089, now seen corresponding path program 1 times [2022-12-06 07:50:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:47,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688324517] [2022-12-06 07:50:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:47,931 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 07:50:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:47,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688324517] [2022-12-06 07:50:47,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688324517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:47,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:47,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:50:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404025450] [2022-12-06 07:50:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:47,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:50:47,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:50:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:50:47,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:50:47,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 340 transitions, 8140 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:47,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:47,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:50:47,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:48,428 INFO L130 PetriNetUnfolder]: 1098/2049 cut-off events. [2022-12-06 07:50:48,428 INFO L131 PetriNetUnfolder]: For 68404/68492 co-relation queries the response was YES. [2022-12-06 07:50:48,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20277 conditions, 2049 events. 1098/2049 cut-off events. For 68404/68492 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12561 event pairs, 285 based on Foata normal form. 51/2100 useless extension candidates. Maximal degree in co-relation 19830. Up to 1969 conditions per place. [2022-12-06 07:50:48,445 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 324 selfloop transitions, 21 changer transitions 1/347 dead transitions. [2022-12-06 07:50:48,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 347 transitions, 8776 flow [2022-12-06 07:50:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:50:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:50:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 07:50:48,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-06 07:50:48,447 INFO L175 Difference]: Start difference. First operand has 186 places, 340 transitions, 8140 flow. Second operand 4 states and 58 transitions. [2022-12-06 07:50:48,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 347 transitions, 8776 flow [2022-12-06 07:50:48,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 347 transitions, 8622 flow, removed 60 selfloop flow, removed 2 redundant places. [2022-12-06 07:50:48,661 INFO L231 Difference]: Finished difference. Result has 187 places, 337 transitions, 7887 flow [2022-12-06 07:50:48,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7861, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7887, PETRI_PLACES=187, PETRI_TRANSITIONS=337} [2022-12-06 07:50:48,661 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-06 07:50:48,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:48,661 INFO L89 Accepts]: Start accepts. Operand has 187 places, 337 transitions, 7887 flow [2022-12-06 07:50:48,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:48,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:48,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 337 transitions, 7887 flow [2022-12-06 07:50:48,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 337 transitions, 7887 flow [2022-12-06 07:50:48,793 INFO L130 PetriNetUnfolder]: 293/887 cut-off events. [2022-12-06 07:50:48,793 INFO L131 PetriNetUnfolder]: For 30863/31345 co-relation queries the response was YES. [2022-12-06 07:50:48,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7636 conditions, 887 events. 293/887 cut-off events. For 30863/31345 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6633 event pairs, 8 based on Foata normal form. 143/1027 useless extension candidates. Maximal degree in co-relation 7427. Up to 271 conditions per place. [2022-12-06 07:50:48,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 337 transitions, 7887 flow [2022-12-06 07:50:48,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 07:50:48,804 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:48,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 07:50:48,804 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 337 transitions, 7887 flow [2022-12-06 07:50:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:48,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:48,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:48,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 07:50:48,804 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash -742243841, now seen corresponding path program 1 times [2022-12-06 07:50:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:48,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016225766] [2022-12-06 07:50:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:48,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:48,850 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 07:50:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:48,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016225766] [2022-12-06 07:50:48,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016225766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:48,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:48,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:50:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428949237] [2022-12-06 07:50:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:48,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:50:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:50:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:50:48,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:50:48,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 337 transitions, 7887 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 07:50:48,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:48,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:50:48,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:49,279 INFO L130 PetriNetUnfolder]: 1090/2037 cut-off events. [2022-12-06 07:50:49,279 INFO L131 PetriNetUnfolder]: For 67234/67314 co-relation queries the response was YES. [2022-12-06 07:50:49,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19961 conditions, 2037 events. 1090/2037 cut-off events. For 67234/67314 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12474 event pairs, 243 based on Foata normal form. 64/2101 useless extension candidates. Maximal degree in co-relation 19361. Up to 1973 conditions per place. [2022-12-06 07:50:49,297 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 312 selfloop transitions, 26 changer transitions 0/339 dead transitions. [2022-12-06 07:50:49,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 339 transitions, 8568 flow [2022-12-06 07:50:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:50:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:50:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 07:50:49,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-06 07:50:49,297 INFO L175 Difference]: Start difference. First operand has 186 places, 337 transitions, 7887 flow. Second operand 3 states and 49 transitions. [2022-12-06 07:50:49,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 339 transitions, 8568 flow [2022-12-06 07:50:49,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 339 transitions, 8518 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:50:49,495 INFO L231 Difference]: Finished difference. Result has 185 places, 337 transitions, 7919 flow [2022-12-06 07:50:49,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7837, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7919, PETRI_PLACES=185, PETRI_TRANSITIONS=337} [2022-12-06 07:50:49,496 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-06 07:50:49,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:49,496 INFO L89 Accepts]: Start accepts. Operand has 185 places, 337 transitions, 7919 flow [2022-12-06 07:50:49,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:49,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:49,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 337 transitions, 7919 flow [2022-12-06 07:50:49,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 337 transitions, 7919 flow [2022-12-06 07:50:49,642 INFO L130 PetriNetUnfolder]: 290/883 cut-off events. [2022-12-06 07:50:49,642 INFO L131 PetriNetUnfolder]: For 30795/31228 co-relation queries the response was YES. [2022-12-06 07:50:49,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 883 events. 290/883 cut-off events. For 30795/31228 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6639 event pairs, 7 based on Foata normal form. 138/1018 useless extension candidates. Maximal degree in co-relation 7333. Up to 267 conditions per place. [2022-12-06 07:50:49,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 337 transitions, 7919 flow [2022-12-06 07:50:49,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 07:50:49,652 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:49,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 07:50:49,652 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 337 transitions, 7919 flow [2022-12-06 07:50:49,653 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 07:50:49,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:49,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:49,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 07:50:49,653 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 826158059, now seen corresponding path program 2 times [2022-12-06 07:50:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:49,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932148094] [2022-12-06 07:50:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:50,792 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 07:50:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:50,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932148094] [2022-12-06 07:50:50,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932148094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:50:50,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:50:50,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:50:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118825813] [2022-12-06 07:50:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:50:50,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:50:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:50:50,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:50:50,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:50:50,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 337 transitions, 7919 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:50:50,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:50,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:50:50,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:51,444 INFO L130 PetriNetUnfolder]: 1096/2053 cut-off events. [2022-12-06 07:50:51,444 INFO L131 PetriNetUnfolder]: For 68763/68845 co-relation queries the response was YES. [2022-12-06 07:50:51,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20208 conditions, 2053 events. 1096/2053 cut-off events. For 68763/68845 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12774 event pairs, 270 based on Foata normal form. 46/2099 useless extension candidates. Maximal degree in co-relation 19785. Up to 1951 conditions per place. [2022-12-06 07:50:51,460 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 322 selfloop transitions, 26 changer transitions 5/354 dead transitions. [2022-12-06 07:50:51,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 354 transitions, 8813 flow [2022-12-06 07:50:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:50:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:50:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 07:50:51,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-06 07:50:51,461 INFO L175 Difference]: Start difference. First operand has 185 places, 337 transitions, 7919 flow. Second operand 6 states and 66 transitions. [2022-12-06 07:50:51,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 354 transitions, 8813 flow [2022-12-06 07:50:51,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 354 transitions, 8761 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:50:51,639 INFO L231 Difference]: Finished difference. Result has 191 places, 339 transitions, 8008 flow [2022-12-06 07:50:51,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7867, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8008, PETRI_PLACES=191, PETRI_TRANSITIONS=339} [2022-12-06 07:50:51,640 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-06 07:50:51,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:51,640 INFO L89 Accepts]: Start accepts. Operand has 191 places, 339 transitions, 8008 flow [2022-12-06 07:50:51,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:51,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:51,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 339 transitions, 8008 flow [2022-12-06 07:50:51,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 339 transitions, 8008 flow [2022-12-06 07:50:51,763 INFO L130 PetriNetUnfolder]: 290/886 cut-off events. [2022-12-06 07:50:51,764 INFO L131 PetriNetUnfolder]: For 31014/31448 co-relation queries the response was YES. [2022-12-06 07:50:51,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 886 events. 290/886 cut-off events. For 31014/31448 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6702 event pairs, 7 based on Foata normal form. 138/1021 useless extension candidates. Maximal degree in co-relation 7515. Up to 267 conditions per place. [2022-12-06 07:50:51,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 339 transitions, 8008 flow [2022-12-06 07:50:51,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-06 07:50:51,784 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:51,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 07:50:51,784 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 339 transitions, 8008 flow [2022-12-06 07:50:51,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:50:51,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:51,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:51,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 07:50:51,785 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash 415137550, now seen corresponding path program 1 times [2022-12-06 07:50:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:51,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381340285] [2022-12-06 07:50:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:52,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381340285] [2022-12-06 07:50:52,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381340285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:52,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73447240] [2022-12-06 07:50:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:52,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:52,181 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:52,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 07:50:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:52,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:50:52,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:52,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:52,444 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:50:52,444 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 25 treesize of output 16 [2022-12-06 07:50:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:52,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73447240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:52,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:52,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 9 [2022-12-06 07:50:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682505301] [2022-12-06 07:50:52,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:52,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:50:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:52,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:50:52,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:50:52,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:50:52,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 339 transitions, 8008 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 07:50:52,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:52,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:50:52,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:53,071 INFO L130 PetriNetUnfolder]: 1106/2062 cut-off events. [2022-12-06 07:50:53,071 INFO L131 PetriNetUnfolder]: For 68701/68783 co-relation queries the response was YES. [2022-12-06 07:50:53,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20430 conditions, 2062 events. 1106/2062 cut-off events. For 68701/68783 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12741 event pairs, 221 based on Foata normal form. 69/2131 useless extension candidates. Maximal degree in co-relation 20256. Up to 1677 conditions per place. [2022-12-06 07:50:53,089 INFO L137 encePairwiseOnDemand]: 13/40 looper letters, 280 selfloop transitions, 95 changer transitions 0/376 dead transitions. [2022-12-06 07:50:53,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 376 transitions, 9243 flow [2022-12-06 07:50:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:50:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:50:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 07:50:53,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29285714285714287 [2022-12-06 07:50:53,092 INFO L175 Difference]: Start difference. First operand has 190 places, 339 transitions, 8008 flow. Second operand 7 states and 82 transitions. [2022-12-06 07:50:53,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 376 transitions, 9243 flow [2022-12-06 07:50:53,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 376 transitions, 9160 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 07:50:53,300 INFO L231 Difference]: Finished difference. Result has 194 places, 344 transitions, 8329 flow [2022-12-06 07:50:53,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7925, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8329, PETRI_PLACES=194, PETRI_TRANSITIONS=344} [2022-12-06 07:50:53,301 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-06 07:50:53,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:53,301 INFO L89 Accepts]: Start accepts. Operand has 194 places, 344 transitions, 8329 flow [2022-12-06 07:50:53,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:53,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:53,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 344 transitions, 8329 flow [2022-12-06 07:50:53,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 344 transitions, 8329 flow [2022-12-06 07:50:53,421 INFO L130 PetriNetUnfolder]: 294/897 cut-off events. [2022-12-06 07:50:53,421 INFO L131 PetriNetUnfolder]: For 32324/32697 co-relation queries the response was YES. [2022-12-06 07:50:53,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 897 events. 294/897 cut-off events. For 32324/32697 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6803 event pairs, 9 based on Foata normal form. 132/1026 useless extension candidates. Maximal degree in co-relation 7673. Up to 270 conditions per place. [2022-12-06 07:50:53,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 344 transitions, 8329 flow [2022-12-06 07:50:53,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-06 07:50:53,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:50:53,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 07:50:53,435 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 344 transitions, 8329 flow [2022-12-06 07:50:53,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 07:50:53,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:53,435 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:53,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:53,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2022-12-06 07:50:53,639 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash -456378956, now seen corresponding path program 1 times [2022-12-06 07:50:53,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:53,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330287013] [2022-12-06 07:50:53,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:53,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:54,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330287013] [2022-12-06 07:50:54,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330287013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:54,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332740541] [2022-12-06 07:50:54,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:54,550 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:54,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-06 07:50:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:54,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:50:54,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:54,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:50:54,780 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 07:50:54,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:54,876 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 46 treesize of output 12 [2022-12-06 07:50:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:54,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:55,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:55,019 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 185 treesize of output 178 [2022-12-06 07:50:55,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:50:55,031 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 114 treesize of output 101 [2022-12-06 07:50:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332740541] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:55,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:55,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 07:50:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685305762] [2022-12-06 07:50:55,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:55,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:50:55,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:50:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:50:55,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:50:55,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 344 transitions, 8329 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:55,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:55,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:50:55,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:56,219 INFO L130 PetriNetUnfolder]: 1149/2144 cut-off events. [2022-12-06 07:50:56,219 INFO L131 PetriNetUnfolder]: For 77380/77454 co-relation queries the response was YES. [2022-12-06 07:50:56,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21830 conditions, 2144 events. 1149/2144 cut-off events. For 77380/77454 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13343 event pairs, 147 based on Foata normal form. 60/2204 useless extension candidates. Maximal degree in co-relation 21192. Up to 1900 conditions per place. [2022-12-06 07:50:56,237 INFO L137 encePairwiseOnDemand]: 12/40 looper letters, 311 selfloop transitions, 67 changer transitions 24/403 dead transitions. [2022-12-06 07:50:56,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 403 transitions, 9806 flow [2022-12-06 07:50:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:50:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:50:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2022-12-06 07:50:56,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2109375 [2022-12-06 07:50:56,238 INFO L175 Difference]: Start difference. First operand has 194 places, 344 transitions, 8329 flow. Second operand 16 states and 135 transitions. [2022-12-06 07:50:56,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 403 transitions, 9806 flow [2022-12-06 07:50:56,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 403 transitions, 9663 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 07:50:56,447 INFO L231 Difference]: Finished difference. Result has 212 places, 351 transitions, 8632 flow [2022-12-06 07:50:56,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8180, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8632, PETRI_PLACES=212, PETRI_TRANSITIONS=351} [2022-12-06 07:50:56,448 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2022-12-06 07:50:56,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:56,448 INFO L89 Accepts]: Start accepts. Operand has 212 places, 351 transitions, 8632 flow [2022-12-06 07:50:56,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:56,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:56,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 351 transitions, 8632 flow [2022-12-06 07:50:56,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 351 transitions, 8632 flow [2022-12-06 07:50:56,573 INFO L130 PetriNetUnfolder]: 301/903 cut-off events. [2022-12-06 07:50:56,573 INFO L131 PetriNetUnfolder]: For 35410/35771 co-relation queries the response was YES. [2022-12-06 07:50:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8234 conditions, 903 events. 301/903 cut-off events. For 35410/35771 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6793 event pairs, 8 based on Foata normal form. 127/1027 useless extension candidates. Maximal degree in co-relation 7973. Up to 285 conditions per place. [2022-12-06 07:50:56,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 351 transitions, 8632 flow [2022-12-06 07:50:56,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-06 07:50:56,593 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:56,593 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:56,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:56,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:50:56,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:50:57,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:50:57,116 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:57,116 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:57,116 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:57,116 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:57,116 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:57,116 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:50:57,388 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:50:57,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-06 07:50:57,388 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 349 transitions, 8654 flow [2022-12-06 07:50:57,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:50:57,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:57,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:57,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-12-06 07:50:57,589 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -592806890, now seen corresponding path program 1 times [2022-12-06 07:50:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:57,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211647596] [2022-12-06 07:50:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:57,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:50:57,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211647596] [2022-12-06 07:50:57,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211647596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:50:57,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226267485] [2022-12-06 07:50:57,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:57,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:50:57,932 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:50:57,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-06 07:50:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:50:58,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 07:50:58,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:50:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:58,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:50:58,183 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:50:58,183 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 27 treesize of output 16 [2022-12-06 07:50:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:50:58,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226267485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:50:58,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:50:58,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2022-12-06 07:50:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485565023] [2022-12-06 07:50:58,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:50:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:50:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:50:58,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:50:58,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:50:58,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:50:58,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 349 transitions, 8654 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 07:50:58,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:50:58,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:50:58,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:58,934 INFO L130 PetriNetUnfolder]: 1147/2134 cut-off events. [2022-12-06 07:50:58,936 INFO L131 PetriNetUnfolder]: For 81151/81201 co-relation queries the response was YES. [2022-12-06 07:50:58,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21826 conditions, 2134 events. 1147/2134 cut-off events. For 81151/81201 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13123 event pairs, 217 based on Foata normal form. 72/2206 useless extension candidates. Maximal degree in co-relation 21547. Up to 1511 conditions per place. [2022-12-06 07:50:58,955 INFO L137 encePairwiseOnDemand]: 17/45 looper letters, 298 selfloop transitions, 124 changer transitions 1/424 dead transitions. [2022-12-06 07:50:58,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 424 transitions, 10603 flow [2022-12-06 07:50:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:50:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:50:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-06 07:50:58,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24888888888888888 [2022-12-06 07:50:58,956 INFO L175 Difference]: Start difference. First operand has 206 places, 349 transitions, 8654 flow. Second operand 10 states and 112 transitions. [2022-12-06 07:50:58,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 424 transitions, 10603 flow [2022-12-06 07:50:59,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 424 transitions, 10386 flow, removed 76 selfloop flow, removed 8 redundant places. [2022-12-06 07:50:59,228 INFO L231 Difference]: Finished difference. Result has 209 places, 356 transitions, 8971 flow [2022-12-06 07:50:59,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=8390, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8971, PETRI_PLACES=209, PETRI_TRANSITIONS=356} [2022-12-06 07:50:59,229 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-06 07:50:59,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:50:59,229 INFO L89 Accepts]: Start accepts. Operand has 209 places, 356 transitions, 8971 flow [2022-12-06 07:50:59,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:50:59,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:50:59,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 356 transitions, 8971 flow [2022-12-06 07:50:59,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 356 transitions, 8971 flow [2022-12-06 07:50:59,362 INFO L130 PetriNetUnfolder]: 306/922 cut-off events. [2022-12-06 07:50:59,362 INFO L131 PetriNetUnfolder]: For 35450/35802 co-relation queries the response was YES. [2022-12-06 07:50:59,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8428 conditions, 922 events. 306/922 cut-off events. For 35450/35802 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6960 event pairs, 7 based on Foata normal form. 120/1039 useless extension candidates. Maximal degree in co-relation 8187. Up to 295 conditions per place. [2022-12-06 07:50:59,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 356 transitions, 8971 flow [2022-12-06 07:50:59,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 07:50:59,389 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:50:59,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:50:59,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:50:59,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 513 [2022-12-06 07:50:59,742 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 356 transitions, 9009 flow [2022-12-06 07:50:59,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 07:50:59,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:50:59,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:50:59,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-06 07:50:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:50:59,947 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:50:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:50:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1557526877, now seen corresponding path program 2 times [2022-12-06 07:50:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:50:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528826377] [2022-12-06 07:50:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:50:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:50:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528826377] [2022-12-06 07:51:00,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528826377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624941027] [2022-12-06 07:51:00,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:51:00,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:00,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:00,722 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-06 07:51:00,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:51:00,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:51:00,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 07:51:00,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:00,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:00,966 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 07:51:01,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:01,023 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 46 treesize of output 12 [2022-12-06 07:51:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:01,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:01,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:01,178 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 181 treesize of output 174 [2022-12-06 07:51:01,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:01,190 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 110 treesize of output 97 [2022-12-06 07:51:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:01,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624941027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:01,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:01,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:51:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990930412] [2022-12-06 07:51:01,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:01,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:51:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:51:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:51:01,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:51:01,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 356 transitions, 9009 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:51:01,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:01,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:51:01,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:02,489 INFO L130 PetriNetUnfolder]: 1151/2153 cut-off events. [2022-12-06 07:51:02,489 INFO L131 PetriNetUnfolder]: For 79796/79837 co-relation queries the response was YES. [2022-12-06 07:51:02,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22212 conditions, 2153 events. 1151/2153 cut-off events. For 79796/79837 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13596 event pairs, 343 based on Foata normal form. 6/2159 useless extension candidates. Maximal degree in co-relation 21612. Up to 2017 conditions per place. [2022-12-06 07:51:02,504 INFO L137 encePairwiseOnDemand]: 21/48 looper letters, 317 selfloop transitions, 51 changer transitions 6/375 dead transitions. [2022-12-06 07:51:02,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 375 transitions, 9885 flow [2022-12-06 07:51:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:51:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:51:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-12-06 07:51:02,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18333333333333332 [2022-12-06 07:51:02,505 INFO L175 Difference]: Start difference. First operand has 208 places, 356 transitions, 9009 flow. Second operand 10 states and 88 transitions. [2022-12-06 07:51:02,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 375 transitions, 9885 flow [2022-12-06 07:51:02,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 375 transitions, 9610 flow, removed 68 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:02,717 INFO L231 Difference]: Finished difference. Result has 213 places, 357 transitions, 8878 flow [2022-12-06 07:51:02,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8734, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8878, PETRI_PLACES=213, PETRI_TRANSITIONS=357} [2022-12-06 07:51:02,718 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2022-12-06 07:51:02,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:02,718 INFO L89 Accepts]: Start accepts. Operand has 213 places, 357 transitions, 8878 flow [2022-12-06 07:51:02,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:02,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:02,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 357 transitions, 8878 flow [2022-12-06 07:51:02,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 357 transitions, 8878 flow [2022-12-06 07:51:02,840 INFO L130 PetriNetUnfolder]: 306/924 cut-off events. [2022-12-06 07:51:02,841 INFO L131 PetriNetUnfolder]: For 33651/34014 co-relation queries the response was YES. [2022-12-06 07:51:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8350 conditions, 924 events. 306/924 cut-off events. For 33651/34014 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7055 event pairs, 7 based on Foata normal form. 113/1033 useless extension candidates. Maximal degree in co-relation 8189. Up to 295 conditions per place. [2022-12-06 07:51:02,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 357 transitions, 8878 flow [2022-12-06 07:51:02,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 1154 [2022-12-06 07:51:02,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_733| v_~q~0.base_493)) (.cse5 (* 4 v_~q_front~0_848))) (let ((.cse1 (* v_~q_back~0_984 4)) (.cse3 (select .cse0 (+ .cse5 v_~q~0.offset_493))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_493 4)))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_984))) (and (<= 0 .cse2) (< .cse2 v_~n~0_484))) 1 0) 0)) (< 2 v_~N~0_366) (not (= (ite (and (< v_~q_front~0_848 v_~q_back~0_983) (< v_~q_front~0_848 v_~n~0_484) (<= 0 v_~q_front~0_848)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|) (= (+ .cse3 .cse4 v_~s~0_773 |v_thread2Thread1of1ForFork1_~j~0#1_505|) v_~s~0_771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (= (select .cse0 (+ (* 4 v_~q_front~0_846) (- 4) v_~q~0.offset_493)) |v_thread2Thread1of1ForFork1_~j~0#1_505|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_493)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_501| 3) (= (ite (and (< v_~q_front~0_846 (+ v_~q_back~0_983 1)) (< v_~q_front~0_846 (+ v_~n~0_484 1)) (<= 1 v_~q_front~0_846)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_505| 0)) (= v_~q_back~0_983 (+ 3 v_~q_back~0_984)) (not (= .cse4 0)) (= (+ 3 v_~q_front~0_848) v_~q_front~0_846)))) InVars {~q_back~0=v_~q_back~0_984, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, ~n~0=v_~n~0_484, ~q~0.offset=v_~q~0.offset_493, ~s~0=v_~s~0_773, ~q_front~0=v_~q_front~0_848} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_505|, ~q_back~0=v_~q_back~0_983, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_461|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_461|, ~q~0.offset=v_~q~0.offset_493, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_334|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_330|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_733|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_484, ~s~0=v_~s~0_771, ~q_front~0=v_~q_front~0_846} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:51:03,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_733| v_~q~0.base_493)) (.cse5 (* 4 v_~q_front~0_848))) (let ((.cse1 (* v_~q_back~0_984 4)) (.cse3 (select .cse0 (+ .cse5 v_~q~0.offset_493))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_493 4)))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_984))) (and (<= 0 .cse2) (< .cse2 v_~n~0_484))) 1 0) 0)) (< 2 v_~N~0_366) (not (= (ite (and (< v_~q_front~0_848 v_~q_back~0_983) (< v_~q_front~0_848 v_~n~0_484) (<= 0 v_~q_front~0_848)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|) (= (+ .cse3 .cse4 v_~s~0_773 |v_thread2Thread1of1ForFork1_~j~0#1_505|) v_~s~0_771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (= (select .cse0 (+ (* 4 v_~q_front~0_846) (- 4) v_~q~0.offset_493)) |v_thread2Thread1of1ForFork1_~j~0#1_505|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_493)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_501| 3) (= (ite (and (< v_~q_front~0_846 (+ v_~q_back~0_983 1)) (< v_~q_front~0_846 (+ v_~n~0_484 1)) (<= 1 v_~q_front~0_846)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_505| 0)) (= v_~q_back~0_983 (+ 3 v_~q_back~0_984)) (not (= .cse4 0)) (= (+ 3 v_~q_front~0_848) v_~q_front~0_846)))) InVars {~q_back~0=v_~q_back~0_984, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, ~n~0=v_~n~0_484, ~q~0.offset=v_~q~0.offset_493, ~s~0=v_~s~0_773, ~q_front~0=v_~q_front~0_848} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_505|, ~q_back~0=v_~q_back~0_983, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_461|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_461|, ~q~0.offset=v_~q~0.offset_493, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_334|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_330|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_733|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_484, ~s~0=v_~s~0_771, ~q_front~0=v_~q_front~0_846} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:51:03,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_733| v_~q~0.base_493)) (.cse5 (* 4 v_~q_front~0_848))) (let ((.cse1 (* v_~q_back~0_984 4)) (.cse3 (select .cse0 (+ .cse5 v_~q~0.offset_493))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_493 4)))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_984))) (and (<= 0 .cse2) (< .cse2 v_~n~0_484))) 1 0) 0)) (< 2 v_~N~0_366) (not (= (ite (and (< v_~q_front~0_848 v_~q_back~0_983) (< v_~q_front~0_848 v_~n~0_484) (<= 0 v_~q_front~0_848)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|) (= (+ .cse3 .cse4 v_~s~0_773 |v_thread2Thread1of1ForFork1_~j~0#1_505|) v_~s~0_771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (= (select .cse0 (+ (* 4 v_~q_front~0_846) (- 4) v_~q~0.offset_493)) |v_thread2Thread1of1ForFork1_~j~0#1_505|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_493)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_501| 3) (= (ite (and (< v_~q_front~0_846 (+ v_~q_back~0_983 1)) (< v_~q_front~0_846 (+ v_~n~0_484 1)) (<= 1 v_~q_front~0_846)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_505| 0)) (= v_~q_back~0_983 (+ 3 v_~q_back~0_984)) (not (= .cse4 0)) (= (+ 3 v_~q_front~0_848) v_~q_front~0_846)))) InVars {~q_back~0=v_~q_back~0_984, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, ~n~0=v_~n~0_484, ~q~0.offset=v_~q~0.offset_493, ~s~0=v_~s~0_773, ~q_front~0=v_~q_front~0_848} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_505|, ~q_back~0=v_~q_back~0_983, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_461|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_461|, ~q~0.offset=v_~q~0.offset_493, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_334|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_330|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_733|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_484, ~s~0=v_~s~0_771, ~q_front~0=v_~q_front~0_846} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:51:04,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_721| v_~q~0.base_485)) (.cse1 (* v_~q_back~0_957 4))) (and (= (select .cse0 (+ (* 4 v_~q_front~0_820) v_~q~0.offset_485)) |v_thread2Thread1of1ForFork1_~j~0#1_485|) (= (+ v_~s~0_742 |v_thread2Thread1of1ForFork1_~j~0#1_485|) v_~s~0_741) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_485)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459| 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_957))) (and (<= 0 .cse2) (< .cse2 v_~n~0_476))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485 4)) 1) 1 0))) (= (+ 1 v_~q_front~0_820) v_~q_front~0_819) (= (+ 3 v_~q_back~0_957) v_~q_back~0_956) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|) (not (= (ite (and (<= 0 v_~q_back~0_957) (< v_~q_back~0_957 v_~n~0_476)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< 2 v_~N~0_358) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_485| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| (ite (and (<= 0 v_~q_front~0_820) (< v_~q_front~0_820 v_~q_back~0_956) (< v_~q_front~0_820 v_~n~0_476)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_957, #memory_int=|v_#memory_int_721|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, ~n~0=v_~n~0_476, ~q~0.offset=v_~q~0.offset_485, ~s~0=v_~s~0_742, ~q_front~0=v_~q_front~0_820} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_485|, ~q_back~0=v_~q_back~0_956, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_443|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_313|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_443|, ~q~0.offset=v_~q~0.offset_485, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_317|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_313|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_721|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|, ~n~0=v_~n~0_476, ~s~0=v_~s~0_741, ~q_front~0=v_~q_front~0_819} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:51:04,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_783| v_~q~0.base_529)) (.cse5 (* 4 v_~q_front~0_931))) (let ((.cse3 (+ v_~n~0_520 1)) (.cse2 (select .cse0 (+ .cse5 v_~q~0.offset_529))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_529 4))) (.cse1 (* v_~q_back~0_1074 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_529)) 1) 1 0) 0)) (not (= .cse2 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_529)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_564| 0)) (= (ite (and (<= 1 v_~q_front~0_930) (< v_~q_front~0_930 v_~q_back~0_1072) (< v_~q_front~0_930 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_516|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_532| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_532|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_532| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_529 (* v_~q_back~0_1072 4))) 0) 1 0)) (= (+ v_~q_back~0_1074 4) v_~q_back~0_1072) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_532| 0)) (not (= (ite (and (< v_~q_back~0_1072 .cse3) (<= 1 v_~q_back~0_1072)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_224| 0) (= (+ .cse4 .cse2 v_~s~0_857 |v_thread2Thread1of1ForFork1_~j~0#1_564|) v_~s~0_856) (= |v_thread1Thread1of1ForFork0_~i~0#1_552| 3) (= (select .cse0 (+ (- 4) (* 4 v_~q_front~0_930) v_~q~0.offset_529)) |v_thread2Thread1of1ForFork1_~j~0#1_564|) (not (= .cse4 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_224| 0) (= (+ 3 v_~q_front~0_931) v_~q_front~0_930) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_552| v_~N~0_398)) (< 2 v_~N~0_398) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_529 4)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_931) (< v_~q_front~0_931 v_~n~0_520) (< (+ 1 v_~q_front~0_931) v_~q_back~0_1072)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_516| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_516|)))) InVars {~q_back~0=v_~q_back~0_1074, #memory_int=|v_#memory_int_783|, ~N~0=v_~N~0_398, ~q~0.base=v_~q~0.base_529, ~n~0=v_~n~0_520, ~q~0.offset=v_~q~0.offset_529, ~s~0=v_~s~0_857, ~q_front~0=v_~q_front~0_931} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_564|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_224|, ~q_back~0=v_~q_back~0_1072, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_242|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_516|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_516|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_366|, ~N~0=v_~N~0_398, ~q~0.base=v_~q~0.base_529, ~q~0.offset=v_~q~0.offset_529, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_516|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_516|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_532|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_370|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_366|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_552|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_242|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_532|, #memory_int=|v_#memory_int_783|, ~n~0=v_~n~0_520, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_224|, ~s~0=v_~s~0_856, ~q_front~0=v_~q_front~0_930} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:04,841 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:04,841 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:04,841 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:04,841 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:04,841 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:04,841 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (+ 3 v_~q_back~0_1092)) (.cse0 (select |v_#memory_int_789| v_~q~0.base_535)) (.cse2 (* v_~q_back~0_1092 4))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_228| 0) (= (+ 1 v_~q_front~0_943) v_~q_front~0_942) (= |v_thread2Thread1of1ForFork1_~j~0#1_570| (select .cse0 (+ (* 4 v_~q_front~0_943) v_~q~0.offset_535))) (not (= (ite (and (< v_~q_back~0_1092 v_~n~0_526) (<= 0 v_~q_back~0_1092)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~n~0_526)) 1 0) 0)) (< 2 v_~N~0_404) (= (+ v_~s~0_869 |v_thread2Thread1of1ForFork1_~j~0#1_570|) v_~s~0_868) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_544| (ite (= (select .cse0 (+ .cse2 12 v_~q~0.offset_535)) 0) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_522| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_228| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_560| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_522| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_522|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_522| (ite (and (< v_~q_front~0_943 v_~n~0_526) (< v_~q_front~0_943 .cse1) (<= 0 v_~q_front~0_943)) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_560| v_~N~0_404)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_570| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_544| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_544| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_544|) (not (= 0 (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_535)) 1) 1 0))) (= (+ v_~q_back~0_1092 4) v_~q_back~0_1090) (not (= (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_535 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse2 8 v_~q~0.offset_535)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1092, #memory_int=|v_#memory_int_789|, ~N~0=v_~N~0_404, ~q~0.base=v_~q~0.base_535, ~n~0=v_~n~0_526, ~q~0.offset=v_~q~0.offset_535, ~s~0=v_~s~0_869, ~q_front~0=v_~q_front~0_943} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_570|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_228|, ~q_back~0=v_~q_back~0_1090, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_246|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_522|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_522|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_374|, ~N~0=v_~N~0_404, ~q~0.base=v_~q~0.base_535, ~q~0.offset=v_~q~0.offset_535, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_522|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_522|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_544|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_378|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_374|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_560|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_246|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_544|, #memory_int=|v_#memory_int_789|, ~n~0=v_~n~0_526, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_228|, ~s~0=v_~s~0_868, ~q_front~0=v_~q_front~0_942} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:05,537 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_731| v_~q~0.base_491)) (.cse5 (* 4 v_~q_front~0_843))) (let ((.cse4 (select .cse2 (+ .cse5 v_~q~0.offset_491))) (.cse3 (* v_~q_back~0_979 4)) (.cse1 (+ 1 v_~q_front~0_843)) (.cse0 (+ 2 v_~q_front~0_843))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_474|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_503| 0)) (= v_~q_back~0_977 (+ v_~q_back~0_979 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| (ite (and (< .cse0 v_~q_back~0_977) (<= 0 .cse1) (< .cse1 v_~n~0_482)) 1 0)) (not (= (ite (= (select .cse2 (+ 8 v_~q~0.offset_491 .cse3)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_474| 0)) (not (= (ite (= (select .cse2 (+ v_~q~0.offset_491 .cse3 4)) 1) 1 0) 0)) (= (+ .cse4 v_~s~0_768 |v_thread2Thread1of1ForFork1_~j~0#1_503|) v_~s~0_767) (= (select .cse2 (+ .cse5 v_~q~0.offset_491 4)) |v_thread2Thread1of1ForFork1_~j~0#1_503|) (not (= .cse4 0)) (not (= (ite (and (< v_~q_back~0_979 v_~n~0_482) (<= 0 v_~q_back~0_979)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ v_~q~0.offset_491 .cse3)) 1) 1 0) 0)) (< 3 v_~N~0_364) (not (= (ite (and (<= 0 v_~q_front~0_843) (< v_~q_front~0_843 v_~n~0_482) (< .cse1 v_~q_back~0_977)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_497| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|) (= .cse0 v_~q_front~0_842) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| (ite (= (select .cse2 (+ (- 4) v_~q~0.offset_491 (* v_~q_back~0_977 4))) 1) 1 0)) (not (= 0 (ite (and (<= 1 v_~q_back~0_977) (< v_~q_back~0_977 (+ v_~n~0_482 1))) 1 0)))))) InVars {~q_back~0=v_~q_back~0_979, #memory_int=|v_#memory_int_731|, ~N~0=v_~N~0_364, ~q~0.base=v_~q~0.base_491, ~n~0=v_~n~0_482, ~q~0.offset=v_~q~0.offset_491, ~s~0=v_~s~0_768, ~q_front~0=v_~q_front~0_843} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_503|, ~q_back~0=v_~q_back~0_977, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_326|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_459|, ~N~0=v_~N~0_364, ~q~0.base=v_~q~0.base_491, ~q~0.offset=v_~q~0.offset_491, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_459|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_330|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_326|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_497|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_474|, #memory_int=|v_#memory_int_731|, ~n~0=v_~n~0_482, ~s~0=v_~s~0_767, ~q_front~0=v_~q_front~0_842} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:06,074 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,074 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,074 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,074 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,074 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,074 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,532 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,533 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,533 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,533 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,533 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,533 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:06,998 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:51:06,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4281 [2022-12-06 07:51:06,999 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 355 transitions, 8964 flow [2022-12-06 07:51:06,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:51:06,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:06,999 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:07,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:07,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-12-06 07:51:07,200 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -895653803, now seen corresponding path program 1 times [2022-12-06 07:51:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:07,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052625025] [2022-12-06 07:51:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:07,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052625025] [2022-12-06 07:51:07,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052625025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:07,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907755602] [2022-12-06 07:51:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:07,635 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:07,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-06 07:51:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:07,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:51:07,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:07,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:07,860 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 07:51:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:51:07,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:51:07,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907755602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:51:07,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:51:07,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-12-06 07:51:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399893217] [2022-12-06 07:51:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:51:07,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:51:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:07,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:51:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:51:07,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-06 07:51:07,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 355 transitions, 8964 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:51:07,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:07,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-06 07:51:07,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:08,421 INFO L130 PetriNetUnfolder]: 1175/2175 cut-off events. [2022-12-06 07:51:08,421 INFO L131 PetriNetUnfolder]: For 84188/84239 co-relation queries the response was YES. [2022-12-06 07:51:08,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22235 conditions, 2175 events. 1175/2175 cut-off events. For 84188/84239 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13326 event pairs, 216 based on Foata normal form. 28/2203 useless extension candidates. Maximal degree in co-relation 22064. Up to 1632 conditions per place. [2022-12-06 07:51:08,440 INFO L137 encePairwiseOnDemand]: 18/53 looper letters, 255 selfloop transitions, 123 changer transitions 1/380 dead transitions. [2022-12-06 07:51:08,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 380 transitions, 10124 flow [2022-12-06 07:51:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:51:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:51:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 07:51:08,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3113207547169811 [2022-12-06 07:51:08,441 INFO L175 Difference]: Start difference. First operand has 210 places, 355 transitions, 8964 flow. Second operand 4 states and 66 transitions. [2022-12-06 07:51:08,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 380 transitions, 10124 flow [2022-12-06 07:51:08,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 380 transitions, 9934 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-12-06 07:51:08,658 INFO L231 Difference]: Finished difference. Result has 203 places, 363 transitions, 9314 flow [2022-12-06 07:51:08,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=8649, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9314, PETRI_PLACES=203, PETRI_TRANSITIONS=363} [2022-12-06 07:51:08,659 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2022-12-06 07:51:08,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:08,659 INFO L89 Accepts]: Start accepts. Operand has 203 places, 363 transitions, 9314 flow [2022-12-06 07:51:08,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:08,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:08,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 363 transitions, 9314 flow [2022-12-06 07:51:08,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 363 transitions, 9314 flow [2022-12-06 07:51:08,791 INFO L130 PetriNetUnfolder]: 315/937 cut-off events. [2022-12-06 07:51:08,791 INFO L131 PetriNetUnfolder]: For 34708/35062 co-relation queries the response was YES. [2022-12-06 07:51:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 937 events. 315/937 cut-off events. For 34708/35062 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7038 event pairs, 7 based on Foata normal form. 122/1055 useless extension candidates. Maximal degree in co-relation 8418. Up to 306 conditions per place. [2022-12-06 07:51:08,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 363 transitions, 9314 flow [2022-12-06 07:51:08,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 07:51:08,802 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:08,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 07:51:08,803 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 363 transitions, 9314 flow [2022-12-06 07:51:08,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:51:08,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:08,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:08,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:09,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-12-06 07:51:09,008 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash -146888503, now seen corresponding path program 1 times [2022-12-06 07:51:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:09,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234111326] [2022-12-06 07:51:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234111326] [2022-12-06 07:51:09,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234111326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138495276] [2022-12-06 07:51:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:09,557 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:09,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-06 07:51:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:09,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:51:09,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:09,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 07:51:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:09,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:09,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:09,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 150 [2022-12-06 07:51:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:09,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138495276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:09,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:09,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-12-06 07:51:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289501062] [2022-12-06 07:51:09,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:09,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:51:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:09,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:51:09,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:51:09,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:51:09,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 363 transitions, 9314 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:09,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:09,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:51:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:10,686 INFO L130 PetriNetUnfolder]: 1180/2189 cut-off events. [2022-12-06 07:51:10,686 INFO L131 PetriNetUnfolder]: For 83558/83633 co-relation queries the response was YES. [2022-12-06 07:51:10,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22761 conditions, 2189 events. 1180/2189 cut-off events. For 83558/83633 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13567 event pairs, 360 based on Foata normal form. 15/2202 useless extension candidates. Maximal degree in co-relation 22257. Up to 2102 conditions per place. [2022-12-06 07:51:10,705 INFO L137 encePairwiseOnDemand]: 26/50 looper letters, 344 selfloop transitions, 32 changer transitions 2/379 dead transitions. [2022-12-06 07:51:10,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 379 transitions, 10237 flow [2022-12-06 07:51:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:51:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:51:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 07:51:10,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 07:51:10,706 INFO L175 Difference]: Start difference. First operand has 201 places, 363 transitions, 9314 flow. Second operand 6 states and 75 transitions. [2022-12-06 07:51:10,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 379 transitions, 10237 flow [2022-12-06 07:51:10,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 379 transitions, 10040 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 07:51:10,966 INFO L231 Difference]: Finished difference. Result has 204 places, 365 transitions, 9263 flow [2022-12-06 07:51:10,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9122, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9263, PETRI_PLACES=204, PETRI_TRANSITIONS=365} [2022-12-06 07:51:10,966 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 183 predicate places. [2022-12-06 07:51:10,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:10,966 INFO L89 Accepts]: Start accepts. Operand has 204 places, 365 transitions, 9263 flow [2022-12-06 07:51:10,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:10,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:10,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 365 transitions, 9263 flow [2022-12-06 07:51:10,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 365 transitions, 9263 flow [2022-12-06 07:51:11,094 INFO L130 PetriNetUnfolder]: 316/944 cut-off events. [2022-12-06 07:51:11,095 INFO L131 PetriNetUnfolder]: For 34842/35233 co-relation queries the response was YES. [2022-12-06 07:51:11,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8590 conditions, 944 events. 316/944 cut-off events. For 34842/35233 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7154 event pairs, 8 based on Foata normal form. 118/1058 useless extension candidates. Maximal degree in co-relation 8384. Up to 309 conditions per place. [2022-12-06 07:51:11,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 365 transitions, 9263 flow [2022-12-06 07:51:11,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-06 07:51:11,116 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:11,116 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:11,215 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:11,216 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:11,808 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:51:11,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 842 [2022-12-06 07:51:11,808 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 363 transitions, 9217 flow [2022-12-06 07:51:11,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:11,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:11,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:11,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-12-06 07:51:12,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:12,013 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:12,014 INFO L85 PathProgramCache]: Analyzing trace with hash -871536968, now seen corresponding path program 1 times [2022-12-06 07:51:12,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:12,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785942576] [2022-12-06 07:51:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:12,086 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 07:51:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785942576] [2022-12-06 07:51:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785942576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:51:12,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:51:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:51:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027958048] [2022-12-06 07:51:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:51:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:51:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:51:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:51:12,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:51:12,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 363 transitions, 9217 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 07:51:12,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:12,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:51:12,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:12,703 INFO L130 PetriNetUnfolder]: 1207/2252 cut-off events. [2022-12-06 07:51:12,703 INFO L131 PetriNetUnfolder]: For 82471/82547 co-relation queries the response was YES. [2022-12-06 07:51:12,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23041 conditions, 2252 events. 1207/2252 cut-off events. For 82471/82547 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14111 event pairs, 223 based on Foata normal form. 84/2336 useless extension candidates. Maximal degree in co-relation 22926. Up to 1961 conditions per place. [2022-12-06 07:51:12,720 INFO L137 encePairwiseOnDemand]: 23/50 looper letters, 297 selfloop transitions, 93 changer transitions 1/392 dead transitions. [2022-12-06 07:51:12,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 392 transitions, 10484 flow [2022-12-06 07:51:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:51:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:51:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 07:51:12,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 07:51:12,721 INFO L175 Difference]: Start difference. First operand has 202 places, 363 transitions, 9217 flow. Second operand 4 states and 75 transitions. [2022-12-06 07:51:12,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 392 transitions, 10484 flow [2022-12-06 07:51:12,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 392 transitions, 10416 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 07:51:12,924 INFO L231 Difference]: Finished difference. Result has 202 places, 379 transitions, 9928 flow [2022-12-06 07:51:12,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9046, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9928, PETRI_PLACES=202, PETRI_TRANSITIONS=379} [2022-12-06 07:51:12,925 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 181 predicate places. [2022-12-06 07:51:12,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:12,925 INFO L89 Accepts]: Start accepts. Operand has 202 places, 379 transitions, 9928 flow [2022-12-06 07:51:12,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:12,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:12,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 379 transitions, 9928 flow [2022-12-06 07:51:12,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 379 transitions, 9928 flow [2022-12-06 07:51:13,066 INFO L130 PetriNetUnfolder]: 322/972 cut-off events. [2022-12-06 07:51:13,067 INFO L131 PetriNetUnfolder]: For 37033/37442 co-relation queries the response was YES. [2022-12-06 07:51:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 972 events. 322/972 cut-off events. For 37033/37442 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7399 event pairs, 7 based on Foata normal form. 131/1099 useless extension candidates. Maximal degree in co-relation 8838. Up to 314 conditions per place. [2022-12-06 07:51:13,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 379 transitions, 9928 flow [2022-12-06 07:51:13,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 1210 [2022-12-06 07:51:13,079 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:13,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 07:51:13,080 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 379 transitions, 9928 flow [2022-12-06 07:51:13,080 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 07:51:13,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:13,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:13,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 07:51:13,080 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1922154516, now seen corresponding path program 1 times [2022-12-06 07:51:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:13,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045617456] [2022-12-06 07:51:13,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:14,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045617456] [2022-12-06 07:51:14,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045617456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910722315] [2022-12-06 07:51:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:14,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:14,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:14,105 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:14,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-06 07:51:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:14,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:51:14,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:14,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:14,355 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 30 treesize of output 30 [2022-12-06 07:51:14,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:14,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:51:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:14,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:14,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:14,535 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 197 treesize of output 180 [2022-12-06 07:51:14,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:14,543 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 119 treesize of output 99 [2022-12-06 07:51:14,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:14,548 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 99 treesize of output 79 [2022-12-06 07:51:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:14,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910722315] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:14,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:14,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 07:51:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940642230] [2022-12-06 07:51:14,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:51:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:51:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=255, Unknown=2, NotChecked=0, Total=306 [2022-12-06 07:51:14,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:51:14,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 379 transitions, 9928 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:14,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:14,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:51:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:17,681 INFO L130 PetriNetUnfolder]: 1209/2262 cut-off events. [2022-12-06 07:51:17,681 INFO L131 PetriNetUnfolder]: For 82670/82740 co-relation queries the response was YES. [2022-12-06 07:51:17,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23634 conditions, 2262 events. 1209/2262 cut-off events. For 82670/82740 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14167 event pairs, 218 based on Foata normal form. 58/2320 useless extension candidates. Maximal degree in co-relation 23140. Up to 2148 conditions per place. [2022-12-06 07:51:17,698 INFO L137 encePairwiseOnDemand]: 20/48 looper letters, 355 selfloop transitions, 39 changer transitions 6/401 dead transitions. [2022-12-06 07:51:17,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 401 transitions, 10883 flow [2022-12-06 07:51:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:51:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:51:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:51:17,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22916666666666666 [2022-12-06 07:51:17,699 INFO L175 Difference]: Start difference. First operand has 202 places, 379 transitions, 9928 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:51:17,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 401 transitions, 10883 flow [2022-12-06 07:51:17,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 401 transitions, 10784 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-06 07:51:17,940 INFO L231 Difference]: Finished difference. Result has 210 places, 380 transitions, 9936 flow [2022-12-06 07:51:17,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9829, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9936, PETRI_PLACES=210, PETRI_TRANSITIONS=380} [2022-12-06 07:51:17,941 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 189 predicate places. [2022-12-06 07:51:17,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:17,941 INFO L89 Accepts]: Start accepts. Operand has 210 places, 380 transitions, 9936 flow [2022-12-06 07:51:17,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:17,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:17,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 380 transitions, 9936 flow [2022-12-06 07:51:17,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 380 transitions, 9936 flow [2022-12-06 07:51:18,084 INFO L130 PetriNetUnfolder]: 322/972 cut-off events. [2022-12-06 07:51:18,084 INFO L131 PetriNetUnfolder]: For 37513/37962 co-relation queries the response was YES. [2022-12-06 07:51:18,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9035 conditions, 972 events. 322/972 cut-off events. For 37513/37962 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7427 event pairs, 6 based on Foata normal form. 128/1097 useless extension candidates. Maximal degree in co-relation 8876. Up to 314 conditions per place. [2022-12-06 07:51:18,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 380 transitions, 9936 flow [2022-12-06 07:51:18,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 07:51:18,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_754| v_~q~0.base_511)) (.cse2 (* 4 v_~q_front~0_899))) (let ((.cse0 (select .cse1 (+ .cse2 v_~q~0.offset_511)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_494| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_494|) (= (+ .cse0 v_~s~0_825 |v_thread2Thread1of1ForFork1_~j~0#1_540|) v_~s~0_823) (not (= (ite (and (< v_~q_front~0_899 v_~n~0_502) (< v_~q_front~0_899 v_~q_back~0_1029) (<= 0 v_~q_front~0_899)) 1 0) 0)) (= (+ 2 v_~q_front~0_899) v_~q_front~0_897) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_540| 0)) (not (= .cse0 0)) (= (select .cse1 (+ .cse2 v_~q~0.offset_511 4)) |v_thread2Thread1of1ForFork1_~j~0#1_540|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_494| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_494| (ite (let ((.cse3 (+ 1 v_~q_front~0_899))) (and (<= 0 .cse3) (< .cse3 v_~q_back~0_1029) (< .cse3 v_~n~0_502))) 1 0))))) InVars {~q_back~0=v_~q_back~0_1029, #memory_int=|v_#memory_int_754|, ~q~0.base=v_~q~0.base_511, ~n~0=v_~n~0_502, ~q~0.offset=v_~q~0.offset_511, ~s~0=v_~s~0_825, ~q_front~0=v_~q_front~0_899} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_494|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_540|, ~q_back~0=v_~q_back~0_1029, #memory_int=|v_#memory_int_754|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_494|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_494|, ~q~0.base=v_~q~0.base_511, ~n~0=v_~n~0_502, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_494|, ~q~0.offset=v_~q~0.offset_511, ~s~0=v_~s~0_823, ~q_front~0=v_~q_front~0_897} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:51:18,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:51:18,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-06 07:51:18,244 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 379 transitions, 9932 flow [2022-12-06 07:51:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:18,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:18,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:18,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-06 07:51:18,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:18,445 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:18,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1887146223, now seen corresponding path program 1 times [2022-12-06 07:51:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:18,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757930810] [2022-12-06 07:51:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:19,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757930810] [2022-12-06 07:51:19,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757930810] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:19,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411619077] [2022-12-06 07:51:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:19,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:19,108 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:19,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-06 07:51:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:19,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:51:19,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:19,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:19,446 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 90 treesize of output 20 [2022-12-06 07:51:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:19,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:19,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:19,599 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 141 treesize of output 252 [2022-12-06 07:51:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411619077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:19,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:51:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038616759] [2022-12-06 07:51:19,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:51:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:51:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:51:19,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:51:19,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 379 transitions, 9932 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:19,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:19,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:51:19,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:20,643 INFO L130 PetriNetUnfolder]: 1219/2280 cut-off events. [2022-12-06 07:51:20,643 INFO L131 PetriNetUnfolder]: For 84850/84936 co-relation queries the response was YES. [2022-12-06 07:51:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23870 conditions, 2280 events. 1219/2280 cut-off events. For 84850/84936 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14381 event pairs, 262 based on Foata normal form. 58/2338 useless extension candidates. Maximal degree in co-relation 23680. Up to 2147 conditions per place. [2022-12-06 07:51:20,663 INFO L137 encePairwiseOnDemand]: 20/48 looper letters, 343 selfloop transitions, 52 changer transitions 13/409 dead transitions. [2022-12-06 07:51:20,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 409 transitions, 11043 flow [2022-12-06 07:51:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:51:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:51:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-12-06 07:51:20,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20416666666666666 [2022-12-06 07:51:20,664 INFO L175 Difference]: Start difference. First operand has 208 places, 379 transitions, 9932 flow. Second operand 10 states and 98 transitions. [2022-12-06 07:51:20,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 409 transitions, 11043 flow [2022-12-06 07:51:20,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 409 transitions, 10961 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:20,938 INFO L231 Difference]: Finished difference. Result has 215 places, 381 transitions, 10032 flow [2022-12-06 07:51:20,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9850, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10032, PETRI_PLACES=215, PETRI_TRANSITIONS=381} [2022-12-06 07:51:20,939 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 194 predicate places. [2022-12-06 07:51:20,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:20,939 INFO L89 Accepts]: Start accepts. Operand has 215 places, 381 transitions, 10032 flow [2022-12-06 07:51:20,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:20,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:20,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 381 transitions, 10032 flow [2022-12-06 07:51:20,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 381 transitions, 10032 flow [2022-12-06 07:51:21,100 INFO L130 PetriNetUnfolder]: 322/978 cut-off events. [2022-12-06 07:51:21,101 INFO L131 PetriNetUnfolder]: For 37851/38269 co-relation queries the response was YES. [2022-12-06 07:51:21,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9156 conditions, 978 events. 322/978 cut-off events. For 37851/38269 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7498 event pairs, 9 based on Foata normal form. 127/1101 useless extension candidates. Maximal degree in co-relation 8945. Up to 317 conditions per place. [2022-12-06 07:51:21,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 381 transitions, 10032 flow [2022-12-06 07:51:21,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 1218 [2022-12-06 07:51:21,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:21,258 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:21,258 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:21,259 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:21,259 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:21,259 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:21,259 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:21,574 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:51:21,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 635 [2022-12-06 07:51:21,575 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 379 transitions, 10006 flow [2022-12-06 07:51:21,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:21,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:21,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:21,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:21,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:21,775 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash -9417030, now seen corresponding path program 1 times [2022-12-06 07:51:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:21,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537726749] [2022-12-06 07:51:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:21,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537726749] [2022-12-06 07:51:22,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537726749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361923149] [2022-12-06 07:51:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:22,126 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:22,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-06 07:51:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:22,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:51:22,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:22,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:22,422 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:51:22,422 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 26 treesize of output 18 [2022-12-06 07:51:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:22,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361923149] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:22,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:22,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 07:51:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963357181] [2022-12-06 07:51:22,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:22,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:51:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:51:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:51:22,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 07:51:22,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 379 transitions, 10006 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:22,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:22,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 07:51:22,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:23,322 INFO L130 PetriNetUnfolder]: 1220/2272 cut-off events. [2022-12-06 07:51:23,323 INFO L131 PetriNetUnfolder]: For 88192/88268 co-relation queries the response was YES. [2022-12-06 07:51:23,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23880 conditions, 2272 events. 1220/2272 cut-off events. For 88192/88268 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14332 event pairs, 218 based on Foata normal form. 72/2344 useless extension candidates. Maximal degree in co-relation 23415. Up to 1844 conditions per place. [2022-12-06 07:51:23,339 INFO L137 encePairwiseOnDemand]: 15/49 looper letters, 307 selfloop transitions, 119 changer transitions 0/427 dead transitions. [2022-12-06 07:51:23,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 427 transitions, 11532 flow [2022-12-06 07:51:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:51:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:51:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-12-06 07:51:23,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21224489795918366 [2022-12-06 07:51:23,340 INFO L175 Difference]: Start difference. First operand has 211 places, 379 transitions, 10006 flow. Second operand 10 states and 104 transitions. [2022-12-06 07:51:23,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 427 transitions, 11532 flow [2022-12-06 07:51:23,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 427 transitions, 11335 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:23,587 INFO L231 Difference]: Finished difference. Result has 217 places, 387 transitions, 10379 flow [2022-12-06 07:51:23,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9811, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10379, PETRI_PLACES=217, PETRI_TRANSITIONS=387} [2022-12-06 07:51:23,588 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 196 predicate places. [2022-12-06 07:51:23,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:23,588 INFO L89 Accepts]: Start accepts. Operand has 217 places, 387 transitions, 10379 flow [2022-12-06 07:51:23,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:23,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:23,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 387 transitions, 10379 flow [2022-12-06 07:51:23,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 387 transitions, 10379 flow [2022-12-06 07:51:23,743 INFO L130 PetriNetUnfolder]: 327/983 cut-off events. [2022-12-06 07:51:23,743 INFO L131 PetriNetUnfolder]: For 40338/40764 co-relation queries the response was YES. [2022-12-06 07:51:23,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9347 conditions, 983 events. 327/983 cut-off events. For 40338/40764 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7559 event pairs, 6 based on Foata normal form. 126/1106 useless extension candidates. Maximal degree in co-relation 9128. Up to 314 conditions per place. [2022-12-06 07:51:23,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 387 transitions, 10379 flow [2022-12-06 07:51:23,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 07:51:23,759 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:23,759 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:23,759 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:23,759 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:23,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [810] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_815| v_~q~0.base_555)) (.cse2 (* v_~q_back~0_1145 4))) (and (not (= (ite (and (<= 0 v_~q_back~0_1145) (< v_~q_back~0_1145 v_~n~0_546)) 1 0) 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_1145))) (and (<= 0 .cse0) (< .cse0 v_~n~0_546))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_578| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_578| (ite (= (select .cse1 (+ 8 v_~q~0.offset_555 .cse2)) 1) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_591| (+ v_~N~0_422 1)) (= (+ 3 v_~q_back~0_1145) v_~q_back~0_1143) (= |v_thread1Thread1of1ForFork0_~i~0#1_591| 3) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_555 4 .cse2)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_578| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_578|) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_555 .cse2)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1145, #memory_int=|v_#memory_int_815|, ~N~0=v_~N~0_422, ~q~0.base=v_~q~0.base_555, ~n~0=v_~n~0_546, ~q~0.offset=v_~q~0.offset_555} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_578|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_403|, ~q_back~0=v_~q_back~0_1143, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_399|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_591|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_578|, #memory_int=|v_#memory_int_815|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_399|, ~N~0=v_~N~0_422, ~q~0.base=v_~q~0.base_555, ~n~0=v_~n~0_546, ~q~0.offset=v_~q~0.offset_555} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:24,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [783] L92-3-->L47-4: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_230| |v_#pthreadsForks_299|) (= |v_thread1Thread1of1ForFork0_~i~0#1_534| (+ |v_thread1Thread1of1ForFork0_~i~0#1_535| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_513|) (< |v_thread1Thread1of1ForFork0_~i~0#1_535| v_~N~0_388) (= (ite (= (select (select |v_#memory_int_764| v_~q~0.base_519) (+ (* v_~q_back~0_1044 4) v_~q~0.offset_519)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_513| 0)) (= (+ v_~q_back~0_1044 1) v_~q_back~0_1043) (not (= (ite (and (<= 0 v_~q_back~0_1044) (< v_~q_back~0_1044 v_~n~0_510)) 1 0) 0)) (= |v_#pthreadsForks_298| (+ |v_#pthreadsForks_299| 1)) (= (store |v_#memory_int_765| |v_ULTIMATE.start_main_~#t2~0#1.base_155| (store (select |v_#memory_int_765| |v_ULTIMATE.start_main_~#t2~0#1.base_155|) |v_ULTIMATE.start_main_~#t2~0#1.offset_152| |v_ULTIMATE.start_main_#t~pre14#1_230|)) |v_#memory_int_764|)) InVars {~q_back~0=v_~q_back~0_1044, #pthreadsForks=|v_#pthreadsForks_299|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_535|, #memory_int=|v_#memory_int_765|, ~N~0=v_~N~0_388, ~q~0.base=v_~q~0.base_519, ~n~0=v_~n~0_510, ~q~0.offset=v_~q~0.offset_519, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_155|} OutVars{~q_back~0=v_~q_back~0_1043, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_152|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_353|, ~N~0=v_~N~0_388, ~q~0.base=v_~q~0.base_519, ~q~0.offset=v_~q~0.offset_519, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_225|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_357|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_230|, #pthreadsForks=|v_#pthreadsForks_298|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_353|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_534|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_513|, #memory_int=|v_#memory_int_764|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_184|, ~n~0=v_~n~0_510, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_155|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:51:24,139 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,139 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,139 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,139 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:24,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [782] L92-3-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|) (not (= (ite (and (<= 0 v_~q_back~0_1040) (< v_~q_back~0_1040 v_~n~0_508)) 1 0) 0)) (= (+ |v_#pthreadsForks_295| 1) |v_#pthreadsForks_294|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_532| v_~N~0_386)) (= |v_thread1Thread1of1ForFork0_#res#1.base_214| 0) (= (+ v_~q_back~0_1040 1) v_~q_back~0_1039) (= (store |v_#memory_int_761| |v_ULTIMATE.start_main_~#t2~0#1.base_153| (store (select |v_#memory_int_761| |v_ULTIMATE.start_main_~#t2~0#1.base_153|) |v_ULTIMATE.start_main_~#t2~0#1.offset_150| |v_ULTIMATE.start_main_#t~pre14#1_228|)) |v_#memory_int_760|) (= (ite (= (select (select |v_#memory_int_760| v_~q~0.base_517) (+ (* v_~q_back~0_1040 4) v_~q~0.offset_517)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_214| 0) (= |v_ULTIMATE.start_main_#t~pre14#1_228| |v_#pthreadsForks_295|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511| 0))) InVars {~q_back~0=v_~q_back~0_1040, #pthreadsForks=|v_#pthreadsForks_295|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_150|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_532|, #memory_int=|v_#memory_int_761|, ~N~0=v_~N~0_386, ~q~0.base=v_~q~0.base_517, ~n~0=v_~n~0_508, ~q~0.offset=v_~q~0.offset_517, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_153|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_214|, ~q_back~0=v_~q_back~0_1039, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_232|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_150|, ~N~0=v_~N~0_386, ~q~0.base=v_~q~0.base_517, ~q~0.offset=v_~q~0.offset_517, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_223|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_228|, #pthreadsForks=|v_#pthreadsForks_294|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_532|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_232|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|, #memory_int=|v_#memory_int_760|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_182|, ~n~0=v_~n~0_508, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_153|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_214|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:51:24,794 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,794 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,795 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,795 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:24,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:51:25,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_839| v_~q~0.base_571)) (.cse1 (* v_~q_front~0_1019 4))) (let ((.cse2 (* v_~q_back~0_1187 4)) (.cse4 (select .cse0 (+ .cse1 v_~q~0.offset_571)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_252| 0) (= (select .cse0 (+ .cse1 v_~q~0.offset_571 4)) |v_thread2Thread1of1ForFork1_~j~0#1_624|) (= |v_thread1Thread1of1ForFork0_#res#1.base_252| 0) (not (= (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_571 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse3 (+ v_~q_back~0_1187 4))) (and (<= 0 .cse3) (< .cse3 v_~n~0_562))) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_571)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_604| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_624| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_604| (ite (= (select .cse0 (+ .cse2 16 v_~q~0.offset_571)) 0) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_613| v_~N~0_438)) (not (= (ite (= (select .cse0 (+ .cse2 12 v_~q~0.offset_571)) 1) 1 0) 0)) (= v_~q_front~0_1018 (+ v_~q_front~0_1019 2)) (= (+ .cse4 v_~s~0_947 |v_thread2Thread1of1ForFork1_~j~0#1_624|) v_~s~0_946) (not (= 0 (ite (= (select .cse0 (+ .cse2 8 v_~q~0.offset_571)) 1) 1 0))) (not (= 0 (ite (and (<= 0 v_~q_back~0_1187) (< v_~q_back~0_1187 v_~n~0_562)) 1 0))) (not (= (ite (and (< v_~q_front~0_1019 v_~n~0_562) (<= 0 v_~q_front~0_1019) (< v_~q_front~0_1019 (+ 3 v_~q_back~0_1187))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_613| 4) (not (= .cse4 0)) (< 3 v_~N~0_438) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572| 0)) (= (ite (let ((.cse5 (+ v_~q_front~0_1019 1))) (and (< .cse5 v_~n~0_562) (<= 0 .cse5) (< v_~q_front~0_1019 (+ 2 v_~q_back~0_1187)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572|) (= (+ 5 v_~q_back~0_1187) v_~q_back~0_1185)))) InVars {~q_back~0=v_~q_back~0_1187, #memory_int=|v_#memory_int_839|, ~N~0=v_~N~0_438, ~q~0.base=v_~q~0.base_571, ~n~0=v_~n~0_562, ~q~0.offset=v_~q~0.offset_571, ~s~0=v_~s~0_947, ~q_front~0=v_~q_front~0_1019} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_624|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_252|, ~q_back~0=v_~q_back~0_1185, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_270|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_421|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_572|, ~N~0=v_~N~0_438, ~q~0.base=v_~q~0.base_571, ~q~0.offset=v_~q~0.offset_571, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_572|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_604|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_425|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_421|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_613|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604|, #memory_int=|v_#memory_int_839|, ~n~0=v_~n~0_562, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_252|, ~s~0=v_~s~0_946, ~q_front~0=v_~q_front~0_1018} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:25,862 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:25,863 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:26,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (+ 1 v_~q_front~0_834)) (.cse1 (select |v_#memory_int_727| v_~q~0.base_489)) (.cse2 (* v_~q_back~0_969 4))) (and (= .cse0 v_~q_front~0_833) (< |v_thread1Thread1of1ForFork0_~i~0#1_489| (+ v_~N~0_362 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466| (ite (= (select .cse1 (+ (* v_~q_back~0_967 4) (- 4) v_~q~0.offset_489)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_496| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_489| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453| (ite (and (<= 0 v_~q_front~0_834) (< .cse0 v_~q_back~0_967) (< v_~q_front~0_834 v_~n~0_480)) 1 0)) (= (+ v_~q_back~0_969 4) v_~q_back~0_967) (not (= (ite (and (< v_~q_back~0_967 (+ v_~n~0_480 1)) (<= 1 v_~q_back~0_967)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_489 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_489)) 1) 1 0) 0)) (= (select .cse1 (+ (* 4 v_~q_front~0_834) v_~q~0.offset_489)) |v_thread2Thread1of1ForFork1_~j~0#1_496|) (not (= (ite (and (< v_~q_back~0_969 v_~n~0_480) (<= 0 v_~q_back~0_969)) 1 0) 0)) (= (+ v_~s~0_758 |v_thread2Thread1of1ForFork1_~j~0#1_496|) v_~s~0_757) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_489)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466| 0)))) InVars {~q_back~0=v_~q_back~0_969, #memory_int=|v_#memory_int_727|, ~N~0=v_~N~0_362, ~q~0.base=v_~q~0.base_489, ~n~0=v_~n~0_480, ~q~0.offset=v_~q~0.offset_489, ~s~0=v_~s~0_758, ~q_front~0=v_~q_front~0_834} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_496|, ~q_back~0=v_~q_back~0_967, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_319|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_453|, ~N~0=v_~N~0_362, ~q~0.base=v_~q~0.base_489, ~q~0.offset=v_~q~0.offset_489, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_453|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_323|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_319|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_489|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466|, #memory_int=|v_#memory_int_727|, ~n~0=v_~n~0_480, ~s~0=v_~s~0_757, ~q_front~0=v_~q_front~0_833} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:27,343 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,344 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,367 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,367 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,643 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,643 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,643 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,653 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:27,805 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:51:27,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4220 [2022-12-06 07:51:27,808 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 383 transitions, 10553 flow [2022-12-06 07:51:27,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:27,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:27,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:27,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:28,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:28,013 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1301525743, now seen corresponding path program 1 times [2022-12-06 07:51:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:28,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319563997] [2022-12-06 07:51:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:28,067 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 07:51:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:28,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319563997] [2022-12-06 07:51:28,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319563997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:51:28,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:51:28,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:51:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675984859] [2022-12-06 07:51:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:51:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:51:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:51:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:51:28,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-06 07:51:28,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 383 transitions, 10553 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:51:28,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:28,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-06 07:51:28,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:28,623 INFO L130 PetriNetUnfolder]: 1229/2304 cut-off events. [2022-12-06 07:51:28,624 INFO L131 PetriNetUnfolder]: For 99592/99668 co-relation queries the response was YES. [2022-12-06 07:51:28,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24697 conditions, 2304 events. 1229/2304 cut-off events. For 99592/99668 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14729 event pairs, 325 based on Foata normal form. 22/2326 useless extension candidates. Maximal degree in co-relation 23824. Up to 1969 conditions per place. [2022-12-06 07:51:28,642 INFO L137 encePairwiseOnDemand]: 20/57 looper letters, 290 selfloop transitions, 112 changer transitions 1/404 dead transitions. [2022-12-06 07:51:28,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 404 transitions, 11640 flow [2022-12-06 07:51:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:51:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:51:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 07:51:28,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-06 07:51:28,642 INFO L175 Difference]: Start difference. First operand has 213 places, 383 transitions, 10553 flow. Second operand 4 states and 80 transitions. [2022-12-06 07:51:28,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 404 transitions, 11640 flow [2022-12-06 07:51:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 404 transitions, 11183 flow, removed 151 selfloop flow, removed 9 redundant places. [2022-12-06 07:51:28,889 INFO L231 Difference]: Finished difference. Result has 209 places, 391 transitions, 10708 flow [2022-12-06 07:51:28,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=10078, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10708, PETRI_PLACES=209, PETRI_TRANSITIONS=391} [2022-12-06 07:51:28,889 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-06 07:51:28,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:28,889 INFO L89 Accepts]: Start accepts. Operand has 209 places, 391 transitions, 10708 flow [2022-12-06 07:51:28,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:28,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:28,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 391 transitions, 10708 flow [2022-12-06 07:51:28,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 391 transitions, 10708 flow [2022-12-06 07:51:29,026 INFO L130 PetriNetUnfolder]: 331/999 cut-off events. [2022-12-06 07:51:29,027 INFO L131 PetriNetUnfolder]: For 40867/41346 co-relation queries the response was YES. [2022-12-06 07:51:29,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9534 conditions, 999 events. 331/999 cut-off events. For 40867/41346 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7752 event pairs, 6 based on Foata normal form. 147/1143 useless extension candidates. Maximal degree in co-relation 9239. Up to 317 conditions per place. [2022-12-06 07:51:29,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 391 transitions, 10708 flow [2022-12-06 07:51:29,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 07:51:29,037 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:29,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 07:51:29,038 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 391 transitions, 10708 flow [2022-12-06 07:51:29,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:51:29,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:29,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:29,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-06 07:51:29,038 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash 775814487, now seen corresponding path program 1 times [2022-12-06 07:51:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:29,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243704221] [2022-12-06 07:51:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:29,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243704221] [2022-12-06 07:51:29,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243704221] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:29,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339640686] [2022-12-06 07:51:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:29,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:29,969 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:29,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-06 07:51:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:30,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 07:51:30,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:30,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:30,268 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 90 treesize of output 20 [2022-12-06 07:51:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:30,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:30,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:30,396 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 141 treesize of output 252 [2022-12-06 07:51:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:30,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339640686] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:30,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:30,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-12-06 07:51:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306362262] [2022-12-06 07:51:30,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:30,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:51:30,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:30,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:51:30,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:51:30,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 07:51:30,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 391 transitions, 10708 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:30,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:30,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 07:51:30,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:31,551 INFO L130 PetriNetUnfolder]: 1234/2310 cut-off events. [2022-12-06 07:51:31,551 INFO L131 PetriNetUnfolder]: For 94622/94714 co-relation queries the response was YES. [2022-12-06 07:51:31,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24760 conditions, 2310 events. 1234/2310 cut-off events. For 94622/94714 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14560 event pairs, 381 based on Foata normal form. 16/2326 useless extension candidates. Maximal degree in co-relation 24066. Up to 2224 conditions per place. [2022-12-06 07:51:31,574 INFO L137 encePairwiseOnDemand]: 22/55 looper letters, 363 selfloop transitions, 40 changer transitions 2/406 dead transitions. [2022-12-06 07:51:31,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 406 transitions, 11661 flow [2022-12-06 07:51:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:51:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:51:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 07:51:31,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24242424242424243 [2022-12-06 07:51:31,575 INFO L175 Difference]: Start difference. First operand has 208 places, 391 transitions, 10708 flow. Second operand 6 states and 80 transitions. [2022-12-06 07:51:31,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 406 transitions, 11661 flow [2022-12-06 07:51:31,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 406 transitions, 11578 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 07:51:31,896 INFO L231 Difference]: Finished difference. Result has 211 places, 392 transitions, 10755 flow [2022-12-06 07:51:31,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=10625, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10755, PETRI_PLACES=211, PETRI_TRANSITIONS=392} [2022-12-06 07:51:31,897 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 07:51:31,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:31,897 INFO L89 Accepts]: Start accepts. Operand has 211 places, 392 transitions, 10755 flow [2022-12-06 07:51:31,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:31,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:31,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 392 transitions, 10755 flow [2022-12-06 07:51:31,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 392 transitions, 10755 flow [2022-12-06 07:51:32,049 INFO L130 PetriNetUnfolder]: 332/1006 cut-off events. [2022-12-06 07:51:32,049 INFO L131 PetriNetUnfolder]: For 40602/41063 co-relation queries the response was YES. [2022-12-06 07:51:32,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9579 conditions, 1006 events. 332/1006 cut-off events. For 40602/41063 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7775 event pairs, 8 based on Foata normal form. 140/1141 useless extension candidates. Maximal degree in co-relation 9285. Up to 320 conditions per place. [2022-12-06 07:51:32,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 392 transitions, 10755 flow [2022-12-06 07:51:32,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 07:51:32,073 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:32,073 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:32,158 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:32,159 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:33,123 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:51:33,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1226 [2022-12-06 07:51:33,123 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 390 transitions, 10709 flow [2022-12-06 07:51:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:33,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:33,123 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:33,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:33,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-12-06 07:51:33,324 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 439542444, now seen corresponding path program 1 times [2022-12-06 07:51:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:33,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595325979] [2022-12-06 07:51:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:33,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:33,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595325979] [2022-12-06 07:51:33,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595325979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:51:33,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:51:33,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:51:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106239188] [2022-12-06 07:51:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:51:33,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:51:33,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:51:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:51:33,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 07:51:33,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 390 transitions, 10709 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 07:51:33,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:33,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 07:51:33,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:34,167 INFO L130 PetriNetUnfolder]: 1603/2995 cut-off events. [2022-12-06 07:51:34,167 INFO L131 PetriNetUnfolder]: For 124530/124670 co-relation queries the response was YES. [2022-12-06 07:51:34,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32022 conditions, 2995 events. 1603/2995 cut-off events. For 124530/124670 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 20121 event pairs, 84 based on Foata normal form. 113/3108 useless extension candidates. Maximal degree in co-relation 31329. Up to 1051 conditions per place. [2022-12-06 07:51:34,194 INFO L137 encePairwiseOnDemand]: 19/55 looper letters, 161 selfloop transitions, 352 changer transitions 13/527 dead transitions. [2022-12-06 07:51:34,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 527 transitions, 15083 flow [2022-12-06 07:51:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:51:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:51:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 07:51:34,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3151515151515151 [2022-12-06 07:51:34,195 INFO L175 Difference]: Start difference. First operand has 209 places, 390 transitions, 10709 flow. Second operand 6 states and 104 transitions. [2022-12-06 07:51:34,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 527 transitions, 15083 flow [2022-12-06 07:51:34,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 527 transitions, 14991 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 07:51:34,586 INFO L231 Difference]: Finished difference. Result has 211 places, 481 transitions, 14193 flow [2022-12-06 07:51:34,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=10566, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14193, PETRI_PLACES=211, PETRI_TRANSITIONS=481} [2022-12-06 07:51:34,587 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 07:51:34,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:34,587 INFO L89 Accepts]: Start accepts. Operand has 211 places, 481 transitions, 14193 flow [2022-12-06 07:51:34,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:34,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:34,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 481 transitions, 14193 flow [2022-12-06 07:51:34,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 481 transitions, 14193 flow [2022-12-06 07:51:34,795 INFO L130 PetriNetUnfolder]: 417/1260 cut-off events. [2022-12-06 07:51:34,795 INFO L131 PetriNetUnfolder]: For 52404/53017 co-relation queries the response was YES. [2022-12-06 07:51:34,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12805 conditions, 1260 events. 417/1260 cut-off events. For 52404/53017 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10333 event pairs, 8 based on Foata normal form. 170/1425 useless extension candidates. Maximal degree in co-relation 12622. Up to 451 conditions per place. [2022-12-06 07:51:34,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 481 transitions, 14193 flow [2022-12-06 07:51:34,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 1544 [2022-12-06 07:51:34,813 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:34,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 07:51:34,814 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 481 transitions, 14193 flow [2022-12-06 07:51:34,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 07:51:34,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:34,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:34,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 07:51:34,814 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1913760305, now seen corresponding path program 1 times [2022-12-06 07:51:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:34,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902854363] [2022-12-06 07:51:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:34,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902854363] [2022-12-06 07:51:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902854363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834661862] [2022-12-06 07:51:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:35,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:35,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:35,149 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:35,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-06 07:51:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:35,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:51:35,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:35,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:35,441 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:51:35,442 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 27 treesize of output 16 [2022-12-06 07:51:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:35,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834661862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:35,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:35,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:51:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86231571] [2022-12-06 07:51:35,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:35,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:51:35,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:51:35,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:51:35,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-06 07:51:35,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 481 transitions, 14193 flow. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 07:51:35,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:35,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-06 07:51:35,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:36,597 INFO L130 PetriNetUnfolder]: 1626/3038 cut-off events. [2022-12-06 07:51:36,597 INFO L131 PetriNetUnfolder]: For 143192/143374 co-relation queries the response was YES. [2022-12-06 07:51:36,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35089 conditions, 3038 events. 1626/3038 cut-off events. For 143192/143374 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 20487 event pairs, 396 based on Foata normal form. 113/3151 useless extension candidates. Maximal degree in co-relation 34602. Up to 2395 conditions per place. [2022-12-06 07:51:36,623 INFO L137 encePairwiseOnDemand]: 18/52 looper letters, 440 selfloop transitions, 134 changer transitions 1/576 dead transitions. [2022-12-06 07:51:36,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 576 transitions, 17294 flow [2022-12-06 07:51:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:51:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:51:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2022-12-06 07:51:36,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2202797202797203 [2022-12-06 07:51:36,643 INFO L175 Difference]: Start difference. First operand has 208 places, 481 transitions, 14193 flow. Second operand 11 states and 126 transitions. [2022-12-06 07:51:36,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 576 transitions, 17294 flow [2022-12-06 07:51:37,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 576 transitions, 16132 flow, removed 574 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:37,155 INFO L231 Difference]: Finished difference. Result has 214 places, 496 transitions, 14305 flow [2022-12-06 07:51:37,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=13417, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14305, PETRI_PLACES=214, PETRI_TRANSITIONS=496} [2022-12-06 07:51:37,158 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 193 predicate places. [2022-12-06 07:51:37,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:37,158 INFO L89 Accepts]: Start accepts. Operand has 214 places, 496 transitions, 14305 flow [2022-12-06 07:51:37,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:37,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:37,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 496 transitions, 14305 flow [2022-12-06 07:51:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 496 transitions, 14305 flow [2022-12-06 07:51:37,367 INFO L130 PetriNetUnfolder]: 432/1312 cut-off events. [2022-12-06 07:51:37,367 INFO L131 PetriNetUnfolder]: For 52152/52750 co-relation queries the response was YES. [2022-12-06 07:51:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12408 conditions, 1312 events. 432/1312 cut-off events. For 52152/52750 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 10957 event pairs, 10 based on Foata normal form. 187/1494 useless extension candidates. Maximal degree in co-relation 11953. Up to 380 conditions per place. [2022-12-06 07:51:37,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 496 transitions, 14305 flow [2022-12-06 07:51:37,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 1602 [2022-12-06 07:51:37,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [817] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_829| v_~q~0.base_565)) (.cse1 (* v_~q_back~0_1171 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_605| (+ v_~N~0_432 1)) (= (+ 3 v_~q_back~0_1171) v_~q_back~0_1169) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_605| 3) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_565)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|) (not (= (ite (and (< v_~q_back~0_1171 v_~n~0_556) (<= 0 v_~q_back~0_1171)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1171))) (and (<= 0 .cse2) (< .cse2 v_~n~0_556))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1171, #memory_int=|v_#memory_int_829|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_417|, ~q_back~0=v_~q_back~0_1169, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_413|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_605|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|, #memory_int=|v_#memory_int_829|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_413|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:37,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_845| v_~q~0.base_577)) (.cse3 (* v_~q_front~0_1034 4)) (.cse0 (+ v_~q_front~0_1034 1))) (let ((.cse1 (< .cse0 v_~q_back~0_1201)) (.cse5 (select .cse2 (+ .cse3 v_~q~0.offset_577))) (.cse4 (* v_~q_back~0_1202 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_568) .cse1) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1034) .cse1 (< v_~q_front~0_1034 v_~n~0_568)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|) (< |v_thread1Thread1of1ForFork0_~i~0#1_619| (+ v_~N~0_444 1)) (= (select .cse2 (+ .cse3 v_~q~0.offset_577 4)) |v_thread2Thread1of1ForFork1_~j~0#1_632|) (not (= (ite (and (<= 0 v_~q_back~0_1202) (< v_~q_back~0_1202 v_~n~0_568)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_577)) 1) 1 0) 0)) (= (ite (= 1 (select .cse2 (+ (* v_~q_back~0_1201 4) (- 4) v_~q~0.offset_577))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|) (= (+ .cse5 v_~s~0_962 |v_thread2Thread1of1ForFork1_~j~0#1_632|) v_~s~0_960) (= (+ v_~q_back~0_1202 4) v_~q_back~0_1201) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_619| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614| 0)) (not (= .cse5 0)) (= v_~q_front~0_1032 (+ v_~q_front~0_1034 2)) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_632| 0)) (not (= (ite (and (< v_~q_back~0_1201 (+ v_~n~0_568 1)) (<= 1 v_~q_back~0_1201)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1202, #memory_int=|v_#memory_int_845|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, ~n~0=v_~n~0_568, ~q~0.offset=v_~q~0.offset_577, ~s~0=v_~s~0_962, ~q_front~0=v_~q_front~0_1034} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_632|, ~q_back~0=v_~q_back~0_1201, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_580|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_427|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_580|, ~q~0.offset=v_~q~0.offset_577, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_431|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_427|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_619|, #memory_int=|v_#memory_int_845|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|, ~n~0=v_~n~0_568, ~s~0=v_~s~0_960, ~q_front~0=v_~q_front~0_1032} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:51:37,583 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:37,583 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:37,583 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:37,583 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:37,583 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:37,583 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_845| v_~q~0.base_577)) (.cse3 (* v_~q_front~0_1034 4)) (.cse0 (+ v_~q_front~0_1034 1))) (let ((.cse1 (< .cse0 v_~q_back~0_1201)) (.cse5 (select .cse2 (+ .cse3 v_~q~0.offset_577))) (.cse4 (* v_~q_back~0_1202 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_568) .cse1) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1034) .cse1 (< v_~q_front~0_1034 v_~n~0_568)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|) (< |v_thread1Thread1of1ForFork0_~i~0#1_619| (+ v_~N~0_444 1)) (= (select .cse2 (+ .cse3 v_~q~0.offset_577 4)) |v_thread2Thread1of1ForFork1_~j~0#1_632|) (not (= (ite (and (<= 0 v_~q_back~0_1202) (< v_~q_back~0_1202 v_~n~0_568)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_577)) 1) 1 0) 0)) (= (ite (= 1 (select .cse2 (+ (* v_~q_back~0_1201 4) (- 4) v_~q~0.offset_577))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|) (= (+ .cse5 v_~s~0_962 |v_thread2Thread1of1ForFork1_~j~0#1_632|) v_~s~0_960) (= (+ v_~q_back~0_1202 4) v_~q_back~0_1201) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_619| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614| 0)) (not (= .cse5 0)) (= v_~q_front~0_1032 (+ v_~q_front~0_1034 2)) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_632| 0)) (not (= (ite (and (< v_~q_back~0_1201 (+ v_~n~0_568 1)) (<= 1 v_~q_back~0_1201)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1202, #memory_int=|v_#memory_int_845|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, ~n~0=v_~n~0_568, ~q~0.offset=v_~q~0.offset_577, ~s~0=v_~s~0_962, ~q_front~0=v_~q_front~0_1034} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_632|, ~q_back~0=v_~q_back~0_1201, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_580|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_427|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_580|, ~q~0.offset=v_~q~0.offset_577, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_431|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_427|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_619|, #memory_int=|v_#memory_int_845|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|, ~n~0=v_~n~0_568, ~s~0=v_~s~0_960, ~q_front~0=v_~q_front~0_1032} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:51:38,567 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,568 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,568 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,568 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,568 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,568 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:38,898 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:51:38,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1740 [2022-12-06 07:51:38,898 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 496 transitions, 14392 flow [2022-12-06 07:51:38,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 07:51:38,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:38,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:38,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:39,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-12-06 07:51:39,099 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 189133175, now seen corresponding path program 2 times [2022-12-06 07:51:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:39,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493019693] [2022-12-06 07:51:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493019693] [2022-12-06 07:51:39,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493019693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988195240] [2022-12-06 07:51:39,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:51:39,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:39,713 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:39,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-06 07:51:39,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:51:39,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:51:39,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:51:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:40,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:40,016 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 92 treesize of output 20 [2022-12-06 07:51:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:40,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:40,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:40,206 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 141 treesize of output 252 [2022-12-06 07:51:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:40,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988195240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:40,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:40,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:51:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517518106] [2022-12-06 07:51:40,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:40,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:51:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:40,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:51:40,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:51:40,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 07:51:40,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 496 transitions, 14392 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 07:51:40,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:40,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 07:51:40,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:41,706 INFO L130 PetriNetUnfolder]: 1644/3099 cut-off events. [2022-12-06 07:51:41,706 INFO L131 PetriNetUnfolder]: For 125994/126089 co-relation queries the response was YES. [2022-12-06 07:51:41,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33369 conditions, 3099 events. 1644/3099 cut-off events. For 125994/126089 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21040 event pairs, 394 based on Foata normal form. 56/3155 useless extension candidates. Maximal degree in co-relation 32388. Up to 2909 conditions per place. [2022-12-06 07:51:41,733 INFO L137 encePairwiseOnDemand]: 17/56 looper letters, 443 selfloop transitions, 72 changer transitions 16/532 dead transitions. [2022-12-06 07:51:41,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 532 transitions, 15885 flow [2022-12-06 07:51:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:51:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:51:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2022-12-06 07:51:41,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17857142857142858 [2022-12-06 07:51:41,736 INFO L175 Difference]: Start difference. First operand has 214 places, 496 transitions, 14392 flow. Second operand 11 states and 110 transitions. [2022-12-06 07:51:41,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 532 transitions, 15885 flow [2022-12-06 07:51:42,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 532 transitions, 15558 flow, removed 74 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:42,129 INFO L231 Difference]: Finished difference. Result has 222 places, 498 transitions, 14237 flow [2022-12-06 07:51:42,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=14073, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14237, PETRI_PLACES=222, PETRI_TRANSITIONS=498} [2022-12-06 07:51:42,130 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 201 predicate places. [2022-12-06 07:51:42,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:42,130 INFO L89 Accepts]: Start accepts. Operand has 222 places, 498 transitions, 14237 flow [2022-12-06 07:51:42,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:42,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:42,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 498 transitions, 14237 flow [2022-12-06 07:51:42,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 498 transitions, 14237 flow [2022-12-06 07:51:42,341 INFO L130 PetriNetUnfolder]: 430/1303 cut-off events. [2022-12-06 07:51:42,341 INFO L131 PetriNetUnfolder]: For 50472/51083 co-relation queries the response was YES. [2022-12-06 07:51:42,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12355 conditions, 1303 events. 430/1303 cut-off events. For 50472/51083 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 10771 event pairs, 8 based on Foata normal form. 183/1480 useless extension candidates. Maximal degree in co-relation 12105. Up to 374 conditions per place. [2022-12-06 07:51:42,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 498 transitions, 14237 flow [2022-12-06 07:51:42,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 1604 [2022-12-06 07:51:42,355 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:42,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 07:51:42,356 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 498 transitions, 14237 flow [2022-12-06 07:51:42,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 07:51:42,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:42,356 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:42,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:42,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:42,556 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1854699122, now seen corresponding path program 1 times [2022-12-06 07:51:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:42,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822819720] [2022-12-06 07:51:42,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:42,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822819720] [2022-12-06 07:51:42,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822819720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:42,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304655489] [2022-12-06 07:51:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:42,820 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:42,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-06 07:51:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:43,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:51:43,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:43,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:43,114 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:51:43,114 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 27 treesize of output 16 [2022-12-06 07:51:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:43,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304655489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:43,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:43,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 07:51:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123686649] [2022-12-06 07:51:43,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:43,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:51:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:51:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:51:43,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 07:51:43,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 498 transitions, 14237 flow. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:43,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:43,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 07:51:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:44,386 INFO L130 PetriNetUnfolder]: 1788/3317 cut-off events. [2022-12-06 07:51:44,386 INFO L131 PetriNetUnfolder]: For 139472/139561 co-relation queries the response was YES. [2022-12-06 07:51:44,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35715 conditions, 3317 events. 1788/3317 cut-off events. For 139472/139561 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 22489 event pairs, 351 based on Foata normal form. 125/3442 useless extension candidates. Maximal degree in co-relation 35431. Up to 2242 conditions per place. [2022-12-06 07:51:44,416 INFO L137 encePairwiseOnDemand]: 17/55 looper letters, 458 selfloop transitions, 204 changer transitions 0/663 dead transitions. [2022-12-06 07:51:44,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 663 transitions, 18434 flow [2022-12-06 07:51:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:51:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:51:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 166 transitions. [2022-12-06 07:51:44,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17754010695187167 [2022-12-06 07:51:44,417 INFO L175 Difference]: Start difference. First operand has 219 places, 498 transitions, 14237 flow. Second operand 17 states and 166 transitions. [2022-12-06 07:51:44,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 663 transitions, 18434 flow [2022-12-06 07:51:44,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 663 transitions, 18279 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:44,867 INFO L231 Difference]: Finished difference. Result has 234 places, 537 transitions, 15952 flow [2022-12-06 07:51:44,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=14098, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=15952, PETRI_PLACES=234, PETRI_TRANSITIONS=537} [2022-12-06 07:51:44,868 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2022-12-06 07:51:44,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:44,868 INFO L89 Accepts]: Start accepts. Operand has 234 places, 537 transitions, 15952 flow [2022-12-06 07:51:44,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:44,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:44,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 537 transitions, 15952 flow [2022-12-06 07:51:44,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 537 transitions, 15952 flow [2022-12-06 07:51:45,107 INFO L130 PetriNetUnfolder]: 471/1418 cut-off events. [2022-12-06 07:51:45,107 INFO L131 PetriNetUnfolder]: For 58768/59448 co-relation queries the response was YES. [2022-12-06 07:51:45,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13856 conditions, 1418 events. 471/1418 cut-off events. For 58768/59448 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 12028 event pairs, 8 based on Foata normal form. 197/1610 useless extension candidates. Maximal degree in co-relation 13439. Up to 425 conditions per place. [2022-12-06 07:51:45,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 537 transitions, 15952 flow [2022-12-06 07:51:45,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 1762 [2022-12-06 07:51:45,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:45,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 07:51:45,128 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 537 transitions, 15952 flow [2022-12-06 07:51:45,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:45,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:45,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-12-06 07:51:45,333 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1751201909, now seen corresponding path program 1 times [2022-12-06 07:51:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:45,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059693601] [2022-12-06 07:51:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:46,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059693601] [2022-12-06 07:51:46,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059693601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:46,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287390648] [2022-12-06 07:51:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:46,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:46,154 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:46,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-06 07:51:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:46,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:51:46,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:46,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:46,466 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 92 treesize of output 20 [2022-12-06 07:51:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:46,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:46,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:46,617 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 153 treesize of output 255 [2022-12-06 07:51:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:46,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287390648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:46,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:46,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:51:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462404345] [2022-12-06 07:51:46,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:46,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:51:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:51:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:51:46,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 07:51:46,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 537 transitions, 15952 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 07:51:46,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:46,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 07:51:46,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:48,244 INFO L130 PetriNetUnfolder]: 1788/3319 cut-off events. [2022-12-06 07:51:48,244 INFO L131 PetriNetUnfolder]: For 137380/137490 co-relation queries the response was YES. [2022-12-06 07:51:48,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36774 conditions, 3319 events. 1788/3319 cut-off events. For 137380/137490 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 22441 event pairs, 433 based on Foata normal form. 58/3377 useless extension candidates. Maximal degree in co-relation 35721. Up to 3194 conditions per place. [2022-12-06 07:51:48,276 INFO L137 encePairwiseOnDemand]: 17/55 looper letters, 482 selfloop transitions, 62 changer transitions 10/555 dead transitions. [2022-12-06 07:51:48,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 555 transitions, 17182 flow [2022-12-06 07:51:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:51:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:51:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-12-06 07:51:48,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1898989898989899 [2022-12-06 07:51:48,277 INFO L175 Difference]: Start difference. First operand has 234 places, 537 transitions, 15952 flow. Second operand 9 states and 94 transitions. [2022-12-06 07:51:48,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 555 transitions, 17182 flow [2022-12-06 07:51:48,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 555 transitions, 16414 flow, removed 330 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:48,806 INFO L231 Difference]: Finished difference. Result has 236 places, 535 transitions, 15290 flow [2022-12-06 07:51:48,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15179, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15290, PETRI_PLACES=236, PETRI_TRANSITIONS=535} [2022-12-06 07:51:48,807 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 215 predicate places. [2022-12-06 07:51:48,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:48,807 INFO L89 Accepts]: Start accepts. Operand has 236 places, 535 transitions, 15290 flow [2022-12-06 07:51:48,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:48,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:48,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 535 transitions, 15290 flow [2022-12-06 07:51:48,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 535 transitions, 15290 flow [2022-12-06 07:51:49,043 INFO L130 PetriNetUnfolder]: 470/1409 cut-off events. [2022-12-06 07:51:49,044 INFO L131 PetriNetUnfolder]: For 54776/55383 co-relation queries the response was YES. [2022-12-06 07:51:49,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13436 conditions, 1409 events. 470/1409 cut-off events. For 54776/55383 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11827 event pairs, 8 based on Foata normal form. 199/1603 useless extension candidates. Maximal degree in co-relation 12962. Up to 420 conditions per place. [2022-12-06 07:51:49,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 535 transitions, 15290 flow [2022-12-06 07:51:49,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 1756 [2022-12-06 07:51:49,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:49,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 07:51:49,066 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 535 transitions, 15290 flow [2022-12-06 07:51:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 07:51:49,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:49,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:49,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-12-06 07:51:49,272 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1214053346, now seen corresponding path program 1 times [2022-12-06 07:51:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:49,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918166608] [2022-12-06 07:51:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:50,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:50,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918166608] [2022-12-06 07:51:50,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918166608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:50,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349554727] [2022-12-06 07:51:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:50,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:50,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:50,046 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:50,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-06 07:51:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:50,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:51:50,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:50,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:50,305 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 31 treesize of output 31 [2022-12-06 07:51:50,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:50,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 07:51:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:50,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:50,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:50,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 265 [2022-12-06 07:51:50,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:50,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 129 treesize of output 115 [2022-12-06 07:51:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:51,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349554727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:51,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:51,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:51:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342489344] [2022-12-06 07:51:51,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:51,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:51:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:51:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:51:51,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 07:51:51,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 535 transitions, 15290 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:51:51,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:51,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 07:51:51,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:52,641 INFO L130 PetriNetUnfolder]: 1797/3343 cut-off events. [2022-12-06 07:51:52,641 INFO L131 PetriNetUnfolder]: For 130547/130632 co-relation queries the response was YES. [2022-12-06 07:51:52,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35883 conditions, 3343 events. 1797/3343 cut-off events. For 130547/130632 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 22741 event pairs, 289 based on Foata normal form. 75/3418 useless extension candidates. Maximal degree in co-relation 35030. Up to 3163 conditions per place. [2022-12-06 07:51:52,674 INFO L137 encePairwiseOnDemand]: 17/55 looper letters, 484 selfloop transitions, 75 changer transitions 7/567 dead transitions. [2022-12-06 07:51:52,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 567 transitions, 16770 flow [2022-12-06 07:51:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:51:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:51:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-12-06 07:51:52,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-06 07:51:52,675 INFO L175 Difference]: Start difference. First operand has 234 places, 535 transitions, 15290 flow. Second operand 12 states and 108 transitions. [2022-12-06 07:51:52,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 567 transitions, 16770 flow [2022-12-06 07:51:53,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 567 transitions, 16599 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 07:51:53,228 INFO L231 Difference]: Finished difference. Result has 243 places, 541 transitions, 15423 flow [2022-12-06 07:51:53,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15121, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15423, PETRI_PLACES=243, PETRI_TRANSITIONS=541} [2022-12-06 07:51:53,229 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 222 predicate places. [2022-12-06 07:51:53,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:53,229 INFO L89 Accepts]: Start accepts. Operand has 243 places, 541 transitions, 15423 flow [2022-12-06 07:51:53,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:53,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:53,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 541 transitions, 15423 flow [2022-12-06 07:51:53,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 541 transitions, 15423 flow [2022-12-06 07:51:53,472 INFO L130 PetriNetUnfolder]: 472/1419 cut-off events. [2022-12-06 07:51:53,472 INFO L131 PetriNetUnfolder]: For 55969/56616 co-relation queries the response was YES. [2022-12-06 07:51:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13590 conditions, 1419 events. 472/1419 cut-off events. For 55969/56616 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 11960 event pairs, 9 based on Foata normal form. 194/1608 useless extension candidates. Maximal degree in co-relation 13365. Up to 423 conditions per place. [2022-12-06 07:51:53,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 541 transitions, 15423 flow [2022-12-06 07:51:53,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-06 07:51:53,538 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,539 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,539 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,539 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,539 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,539 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] L65-2-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_807| v_~q~0.base_549)) (.cse2 (* 4 v_~q_front~0_990))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_549 .cse2)))) (and (not (= (ite (and (<= 0 v_~q_front~0_990) (< v_~q_front~0_990 v_~n~0_540) (< v_~q_front~0_990 v_~q_back~0_1126)) 1 0) 0)) (not (= .cse0 0)) (= (+ .cse0 v_~s~0_917 |v_thread2Thread1of1ForFork1_~j~0#1_603|) v_~s~0_916) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_578| (+ |v_thread1Thread1of1ForFork0_~i~0#1_579| 1)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_603| 0)) (= (+ 2 v_~q_front~0_990) v_~q_front~0_989) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565| 0)) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1126 4) v_~q~0.offset_549)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|) (= (select .cse1 (+ v_~q~0.offset_549 4 .cse2)) |v_thread2Thread1of1ForFork1_~j~0#1_603|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553| (ite (let ((.cse3 (+ 1 v_~q_front~0_990))) (and (< .cse3 v_~q_back~0_1126) (<= 0 .cse3) (< .cse3 v_~n~0_540))) 1 0)) (not (= (ite (and (<= 0 v_~q_back~0_1126) (< v_~q_back~0_1126 v_~n~0_540)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565|) (< |v_thread1Thread1of1ForFork0_~i~0#1_579| v_~N~0_416) (= (+ v_~q_back~0_1126 1) v_~q_back~0_1125)))) InVars {~q_back~0=v_~q_back~0_1126, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_579|, #memory_int=|v_#memory_int_807|, ~N~0=v_~N~0_416, ~q~0.base=v_~q~0.base_549, ~n~0=v_~n~0_540, ~q~0.offset=v_~q~0.offset_549, ~s~0=v_~s~0_917, ~q_front~0=v_~q_front~0_990} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_603|, ~q_back~0=v_~q_back~0_1125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_392|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_553|, ~N~0=v_~N~0_416, ~q~0.base=v_~q~0.base_549, ~q~0.offset=v_~q~0.offset_549, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_553|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_396|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_392|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_578|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565|, #memory_int=|v_#memory_int_807|, ~n~0=v_~n~0_540, ~s~0=v_~s~0_916, ~q_front~0=v_~q_front~0_989} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:51:53,851 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,851 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,851 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,851 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,851 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:53,851 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:51:54,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:51:54,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 893 [2022-12-06 07:51:54,122 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 541 transitions, 15445 flow [2022-12-06 07:51:54,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:51:54,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:54,122 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:54,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-12-06 07:51:54,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-12-06 07:51:54,328 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1258570299, now seen corresponding path program 1 times [2022-12-06 07:51:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:54,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210186066] [2022-12-06 07:51:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210186066] [2022-12-06 07:51:55,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210186066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:55,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805467259] [2022-12-06 07:51:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:55,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:55,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:55,009 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:55,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-06 07:51:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:55,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:51:55,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:55,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:55,355 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 92 treesize of output 20 [2022-12-06 07:51:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:55,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:55,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:55,507 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 141 treesize of output 252 [2022-12-06 07:51:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:55,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805467259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:55,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:55,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:51:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925413994] [2022-12-06 07:51:55,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:55,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:51:55,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:55,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:51:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:51:55,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-06 07:51:55,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 541 transitions, 15445 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:55,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:55,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-06 07:51:55,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:56,977 INFO L130 PetriNetUnfolder]: 1795/3342 cut-off events. [2022-12-06 07:51:56,977 INFO L131 PetriNetUnfolder]: For 128468/128548 co-relation queries the response was YES. [2022-12-06 07:51:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36024 conditions, 3342 events. 1795/3342 cut-off events. For 128468/128548 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22663 event pairs, 445 based on Foata normal form. 56/3398 useless extension candidates. Maximal degree in co-relation 35765. Up to 3243 conditions per place. [2022-12-06 07:51:57,009 INFO L137 encePairwiseOnDemand]: 24/57 looper letters, 506 selfloop transitions, 37 changer transitions 15/559 dead transitions. [2022-12-06 07:51:57,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 559 transitions, 16697 flow [2022-12-06 07:51:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:51:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:51:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 07:51:57,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21804511278195488 [2022-12-06 07:51:57,010 INFO L175 Difference]: Start difference. First operand has 242 places, 541 transitions, 15445 flow. Second operand 7 states and 87 transitions. [2022-12-06 07:51:57,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 559 transitions, 16697 flow [2022-12-06 07:51:57,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 559 transitions, 16492 flow, removed 59 selfloop flow, removed 5 redundant places. [2022-12-06 07:51:57,490 INFO L231 Difference]: Finished difference. Result has 244 places, 538 transitions, 15218 flow [2022-12-06 07:51:57,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=15242, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15218, PETRI_PLACES=244, PETRI_TRANSITIONS=538} [2022-12-06 07:51:57,491 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2022-12-06 07:51:57,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:57,491 INFO L89 Accepts]: Start accepts. Operand has 244 places, 538 transitions, 15218 flow [2022-12-06 07:51:57,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:57,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:57,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 538 transitions, 15218 flow [2022-12-06 07:51:57,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 538 transitions, 15218 flow [2022-12-06 07:51:57,754 INFO L130 PetriNetUnfolder]: 471/1414 cut-off events. [2022-12-06 07:51:57,754 INFO L131 PetriNetUnfolder]: For 55206/55843 co-relation queries the response was YES. [2022-12-06 07:51:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 1414 events. 471/1414 cut-off events. For 55206/55843 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 11840 event pairs, 9 based on Foata normal form. 188/1598 useless extension candidates. Maximal degree in co-relation 13165. Up to 419 conditions per place. [2022-12-06 07:51:57,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 538 transitions, 15218 flow [2022-12-06 07:51:57,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 1752 [2022-12-06 07:51:57,780 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:51:57,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 07:51:57,780 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 538 transitions, 15218 flow [2022-12-06 07:51:57,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:57,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:57,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:57,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-12-06 07:51:57,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-12-06 07:51:57,986 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash -984347154, now seen corresponding path program 1 times [2022-12-06 07:51:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:57,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076776369] [2022-12-06 07:51:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:58,298 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 07:51:58,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:58,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076776369] [2022-12-06 07:51:58,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076776369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:58,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284455411] [2022-12-06 07:51:58,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:58,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:58,300 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:58,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-06 07:51:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:58,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:51:58,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:58,575 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 07:51:58,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:58,594 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:51:58,595 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 25 treesize of output 16 [2022-12-06 07:51:58,608 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 07:51:58,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284455411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:58,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:58,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-06 07:51:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587277490] [2022-12-06 07:51:58,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:58,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:51:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:51:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:51:58,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 07:51:58,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 538 transitions, 15218 flow. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:51:58,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:58,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 07:51:58,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:59,921 INFO L130 PetriNetUnfolder]: 1863/3452 cut-off events. [2022-12-06 07:51:59,921 INFO L131 PetriNetUnfolder]: For 138416/138510 co-relation queries the response was YES. [2022-12-06 07:51:59,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36997 conditions, 3452 events. 1863/3452 cut-off events. For 138416/138510 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 23527 event pairs, 354 based on Foata normal form. 90/3542 useless extension candidates. Maximal degree in co-relation 36404. Up to 2786 conditions per place. [2022-12-06 07:51:59,952 INFO L137 encePairwiseOnDemand]: 15/56 looper letters, 433 selfloop transitions, 180 changer transitions 0/614 dead transitions. [2022-12-06 07:51:59,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 614 transitions, 17750 flow [2022-12-06 07:51:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:51:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:51:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2022-12-06 07:51:59,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17708333333333334 [2022-12-06 07:51:59,953 INFO L175 Difference]: Start difference. First operand has 241 places, 538 transitions, 15218 flow. Second operand 12 states and 119 transitions. [2022-12-06 07:51:59,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 614 transitions, 17750 flow [2022-12-06 07:52:00,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 614 transitions, 17643 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 07:52:00,477 INFO L231 Difference]: Finished difference. Result has 252 places, 564 transitions, 16390 flow [2022-12-06 07:52:00,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=15113, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16390, PETRI_PLACES=252, PETRI_TRANSITIONS=564} [2022-12-06 07:52:00,478 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 231 predicate places. [2022-12-06 07:52:00,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:00,478 INFO L89 Accepts]: Start accepts. Operand has 252 places, 564 transitions, 16390 flow [2022-12-06 07:52:00,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:00,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:00,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 564 transitions, 16390 flow [2022-12-06 07:52:00,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 564 transitions, 16390 flow [2022-12-06 07:52:00,739 INFO L130 PetriNetUnfolder]: 493/1474 cut-off events. [2022-12-06 07:52:00,739 INFO L131 PetriNetUnfolder]: For 60894/61531 co-relation queries the response was YES. [2022-12-06 07:52:00,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14434 conditions, 1474 events. 493/1474 cut-off events. For 60894/61531 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12524 event pairs, 9 based on Foata normal form. 199/1669 useless extension candidates. Maximal degree in co-relation 14028. Up to 439 conditions per place. [2022-12-06 07:52:00,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 564 transitions, 16390 flow [2022-12-06 07:52:00,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-06 07:52:00,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_817| v_~q~0.base_557)) (.cse2 (* v_~q_back~0_1150 4))) (and (not (= 0 (ite (and (<= 0 v_~q_back~0_1150) (< v_~q_back~0_1150 v_~n~0_548)) 1 0))) (= (+ 3 v_~q_back~0_1150) v_~q_back~0_1149) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_620| 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_1150))) (and (<= 0 .cse0) (< .cse0 v_~n~0_548))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568| 0)) (= v_~q_front~0_1010 (+ v_~q_front~0_1011 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_557)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_595| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|) (= (select .cse1 (+ (* v_~q_front~0_1011 4) v_~q~0.offset_557)) |v_thread2Thread1of1ForFork1_~j~0#1_620|) (= (+ v_~s~0_939 |v_thread2Thread1of1ForFork1_~j~0#1_620|) v_~s~0_938) (not (= 0 (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557)) 1) 1 0))) (< |v_thread1Thread1of1ForFork0_~i~0#1_595| (+ v_~N~0_424 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| (ite (and (< v_~q_front~0_1011 v_~q_back~0_1149) (<= 0 v_~q_front~0_1011) (< v_~q_front~0_1011 v_~n~0_548)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582| 0)))) InVars {~q_back~0=v_~q_back~0_1150, #memory_int=|v_#memory_int_817|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, ~n~0=v_~n~0_548, ~q~0.offset=v_~q~0.offset_557, ~s~0=v_~s~0_939, ~q_front~0=v_~q_front~0_1011} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_620|, ~q_back~0=v_~q_back~0_1149, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_568|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_403|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_568|, ~q~0.offset=v_~q~0.offset_557, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_407|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_403|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_595|, #memory_int=|v_#memory_int_817|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|, ~n~0=v_~n~0_548, ~s~0=v_~s~0_938, ~q_front~0=v_~q_front~0_1010} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:52:01,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_817| v_~q~0.base_557)) (.cse2 (* v_~q_back~0_1150 4))) (and (not (= 0 (ite (and (<= 0 v_~q_back~0_1150) (< v_~q_back~0_1150 v_~n~0_548)) 1 0))) (= (+ 3 v_~q_back~0_1150) v_~q_back~0_1149) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_620| 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_1150))) (and (<= 0 .cse0) (< .cse0 v_~n~0_548))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568| 0)) (= v_~q_front~0_1010 (+ v_~q_front~0_1011 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_557)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_595| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|) (= (select .cse1 (+ (* v_~q_front~0_1011 4) v_~q~0.offset_557)) |v_thread2Thread1of1ForFork1_~j~0#1_620|) (= (+ v_~s~0_939 |v_thread2Thread1of1ForFork1_~j~0#1_620|) v_~s~0_938) (not (= 0 (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557)) 1) 1 0))) (< |v_thread1Thread1of1ForFork0_~i~0#1_595| (+ v_~N~0_424 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| (ite (and (< v_~q_front~0_1011 v_~q_back~0_1149) (<= 0 v_~q_front~0_1011) (< v_~q_front~0_1011 v_~n~0_548)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582| 0)))) InVars {~q_back~0=v_~q_back~0_1150, #memory_int=|v_#memory_int_817|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, ~n~0=v_~n~0_548, ~q~0.offset=v_~q~0.offset_557, ~s~0=v_~s~0_939, ~q_front~0=v_~q_front~0_1011} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_620|, ~q_back~0=v_~q_back~0_1149, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_568|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_403|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_568|, ~q~0.offset=v_~q~0.offset_557, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_407|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_403|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_595|, #memory_int=|v_#memory_int_817|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|, ~n~0=v_~n~0_548, ~s~0=v_~s~0_938, ~q_front~0=v_~q_front~0_1010} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:52:01,122 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,122 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,122 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,122 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,122 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,123 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,488 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,488 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,488 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,489 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,489 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,489 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:01,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:01,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1266 [2022-12-06 07:52:01,744 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 564 transitions, 16454 flow [2022-12-06 07:52:01,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:01,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:01,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:01,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:01,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-12-06 07:52:01,945 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash -557213854, now seen corresponding path program 2 times [2022-12-06 07:52:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276147092] [2022-12-06 07:52:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:02,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276147092] [2022-12-06 07:52:02,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276147092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:02,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842320795] [2022-12-06 07:52:02,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:52:02,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:02,775 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:02,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-06 07:52:03,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:52:03,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:52:03,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:52:03,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:03,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:03,078 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 31 treesize of output 31 [2022-12-06 07:52:03,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:03,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 07:52:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:03,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:03,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:03,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 265 [2022-12-06 07:52:03,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:03,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 129 treesize of output 115 [2022-12-06 07:52:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:03,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842320795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:03,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:03,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:52:03,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495389262] [2022-12-06 07:52:03,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:03,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:52:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:52:03,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:52:03,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 07:52:03,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 564 transitions, 16454 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:52:03,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:03,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 07:52:03,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:05,297 INFO L130 PetriNetUnfolder]: 1863/3446 cut-off events. [2022-12-06 07:52:05,297 INFO L131 PetriNetUnfolder]: For 139642/139720 co-relation queries the response was YES. [2022-12-06 07:52:05,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38092 conditions, 3446 events. 1863/3446 cut-off events. For 139642/139720 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 23308 event pairs, 296 based on Foata normal form. 71/3517 useless extension candidates. Maximal degree in co-relation 37145. Up to 3303 conditions per place. [2022-12-06 07:52:05,330 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 501 selfloop transitions, 67 changer transitions 13/582 dead transitions. [2022-12-06 07:52:05,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 582 transitions, 17732 flow [2022-12-06 07:52:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:52:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:52:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2022-12-06 07:52:05,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16779661016949152 [2022-12-06 07:52:05,331 INFO L175 Difference]: Start difference. First operand has 252 places, 564 transitions, 16454 flow. Second operand 10 states and 99 transitions. [2022-12-06 07:52:05,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 582 transitions, 17732 flow [2022-12-06 07:52:05,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 582 transitions, 17451 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-06 07:52:05,943 INFO L231 Difference]: Finished difference. Result has 258 places, 560 transitions, 16223 flow [2022-12-06 07:52:05,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=16168, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16223, PETRI_PLACES=258, PETRI_TRANSITIONS=560} [2022-12-06 07:52:05,943 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 237 predicate places. [2022-12-06 07:52:05,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:05,943 INFO L89 Accepts]: Start accepts. Operand has 258 places, 560 transitions, 16223 flow [2022-12-06 07:52:05,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:05,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:05,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 560 transitions, 16223 flow [2022-12-06 07:52:05,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 560 transitions, 16223 flow [2022-12-06 07:52:06,195 INFO L130 PetriNetUnfolder]: 492/1462 cut-off events. [2022-12-06 07:52:06,196 INFO L131 PetriNetUnfolder]: For 60543/61151 co-relation queries the response was YES. [2022-12-06 07:52:06,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14243 conditions, 1462 events. 492/1462 cut-off events. For 60543/61151 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12332 event pairs, 8 based on Foata normal form. 189/1647 useless extension candidates. Maximal degree in co-relation 14006. Up to 430 conditions per place. [2022-12-06 07:52:06,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 560 transitions, 16223 flow [2022-12-06 07:52:06,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 1830 [2022-12-06 07:52:06,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_874| v_~q~0.base_597)) (.cse4 (* v_~q_front~0_1109 4))) (let ((.cse2 (select .cse1 (+ .cse4 v_~q~0.offset_597 4))) (.cse3 (select .cse1 (+ .cse4 v_~q~0.offset_597)))) (and (not (= (ite (let ((.cse0 (+ v_~q_front~0_1109 1))) (and (<= 0 .cse0) (< .cse0 v_~q_back~0_1264) (< .cse0 v_~n~0_588))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_689| 0)) (= (+ v_~q_front~0_1109 3) v_~q_front~0_1107) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_659| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659|) (= (select .cse1 (+ (* v_~q_front~0_1107 4) (- 4) v_~q~0.offset_597)) |v_thread2Thread1of1ForFork1_~j~0#1_689|) (< |v_thread1Thread1of1ForFork0_~i~0#1_662| v_~N~0_462) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1264 4) v_~q~0.offset_597)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_659|) (not (= .cse2 0)) (= (+ .cse2 .cse3 v_~s~0_1037 |v_thread2Thread1of1ForFork1_~j~0#1_689|) v_~s~0_1035) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_631| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_631|) (not (= .cse3 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659| 0)) (= (+ v_~q_back~0_1264 1) v_~q_back~0_1263) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_631| (ite (and (< v_~q_front~0_1107 (+ v_~n~0_588 1)) (< v_~q_front~0_1107 (+ v_~q_back~0_1263 1)) (<= 1 v_~q_front~0_1107)) 1 0)) (not (= (ite (and (< v_~q_back~0_1264 v_~n~0_588) (<= 0 v_~q_back~0_1264)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_1109) (< v_~q_front~0_1109 v_~q_back~0_1264) (< v_~q_front~0_1109 v_~n~0_588)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_661| (+ |v_thread1Thread1of1ForFork0_~i~0#1_662| 1))))) InVars {~q_back~0=v_~q_back~0_1264, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_662|, #memory_int=|v_#memory_int_874|, ~N~0=v_~N~0_462, ~q~0.base=v_~q~0.base_597, ~n~0=v_~n~0_588, ~q~0.offset=v_~q~0.offset_597, ~s~0=v_~s~0_1037, ~q_front~0=v_~q_front~0_1109} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_689|, ~q_back~0=v_~q_back~0_1263, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_631|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_631|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_466|, ~N~0=v_~N~0_462, ~q~0.base=v_~q~0.base_597, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_631|, ~q~0.offset=v_~q~0.offset_597, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_631|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_659|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_470|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_466|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_661|, #memory_int=|v_#memory_int_874|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659|, ~n~0=v_~n~0_588, ~s~0=v_~s~0_1035, ~q_front~0=v_~q_front~0_1107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:52:06,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:06,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 653 [2022-12-06 07:52:06,596 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 559 transitions, 16215 flow [2022-12-06 07:52:06,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:52:06,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:06,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:06,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:06,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-12-06 07:52:06,796 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 469306193, now seen corresponding path program 1 times [2022-12-06 07:52:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:06,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006021222] [2022-12-06 07:52:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:07,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006021222] [2022-12-06 07:52:07,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006021222] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:07,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983446405] [2022-12-06 07:52:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:07,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:07,165 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:07,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-06 07:52:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:07,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 07:52:07,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:07,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:07,490 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:52:07,491 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 26 treesize of output 18 [2022-12-06 07:52:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:07,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983446405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:07,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:07,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 07:52:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239412378] [2022-12-06 07:52:07,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:07,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:52:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:52:07,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:52:07,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-06 07:52:07,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 559 transitions, 16215 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 07:52:07,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:07,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-06 07:52:07,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:08,918 INFO L130 PetriNetUnfolder]: 1962/3611 cut-off events. [2022-12-06 07:52:08,918 INFO L131 PetriNetUnfolder]: For 162142/162318 co-relation queries the response was YES. [2022-12-06 07:52:08,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39804 conditions, 3611 events. 1962/3611 cut-off events. For 162142/162318 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 24858 event pairs, 357 based on Foata normal form. 122/3733 useless extension candidates. Maximal degree in co-relation 39134. Up to 2479 conditions per place. [2022-12-06 07:52:08,956 INFO L137 encePairwiseOnDemand]: 15/57 looper letters, 407 selfloop transitions, 242 changer transitions 0/650 dead transitions. [2022-12-06 07:52:08,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 650 transitions, 19252 flow [2022-12-06 07:52:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:52:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:52:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-12-06 07:52:08,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17690058479532164 [2022-12-06 07:52:08,957 INFO L175 Difference]: Start difference. First operand has 252 places, 559 transitions, 16215 flow. Second operand 12 states and 121 transitions. [2022-12-06 07:52:08,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 650 transitions, 19252 flow [2022-12-06 07:52:09,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 650 transitions, 19094 flow, removed 11 selfloop flow, removed 10 redundant places. [2022-12-06 07:52:09,635 INFO L231 Difference]: Finished difference. Result has 255 places, 583 transitions, 17588 flow [2022-12-06 07:52:09,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=16065, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17588, PETRI_PLACES=255, PETRI_TRANSITIONS=583} [2022-12-06 07:52:09,635 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2022-12-06 07:52:09,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:09,635 INFO L89 Accepts]: Start accepts. Operand has 255 places, 583 transitions, 17588 flow [2022-12-06 07:52:09,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:09,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:09,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 583 transitions, 17588 flow [2022-12-06 07:52:09,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 583 transitions, 17588 flow [2022-12-06 07:52:09,943 INFO L130 PetriNetUnfolder]: 520/1533 cut-off events. [2022-12-06 07:52:09,944 INFO L131 PetriNetUnfolder]: For 66618/67260 co-relation queries the response was YES. [2022-12-06 07:52:09,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15389 conditions, 1533 events. 520/1533 cut-off events. For 66618/67260 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 13129 event pairs, 7 based on Foata normal form. 195/1723 useless extension candidates. Maximal degree in co-relation 14984. Up to 465 conditions per place. [2022-12-06 07:52:09,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 583 transitions, 17588 flow [2022-12-06 07:52:09,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 1936 [2022-12-06 07:52:09,966 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~q~0.base_523))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520| 0)) (= v_~q_back~0_1054 (+ 2 v_~q_back~0_1055)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_1055 4) v_~q~0.offset_523)) 1) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_234| |v_#pthreadsForks_304|) (= |v_thread1Thread1of1ForFork0_~i~0#1_542| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|) (= (store |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157| (store (select |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157|) |v_ULTIMATE.start_main_~#t2~0#1.offset_154| |v_ULTIMATE.start_main_#t~pre14#1_234|)) |v_#memory_int_771|) (not (= (ite (and (< v_~q_back~0_1054 (+ v_~n~0_514 1)) (<= 1 v_~q_back~0_1054)) 1 0) 0)) (= (+ |v_#pthreadsForks_304| 1) |v_#pthreadsForks_303|) (< |v_thread1Thread1of1ForFork0_~i~0#1_542| (+ v_~N~0_392 1)) (not (= (ite (and (<= 0 v_~q_back~0_1055) (< v_~q_back~0_1055 v_~n~0_514)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_523 (* v_~q_back~0_1054 4))) 1) 1 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_304|, ~q_back~0=v_~q_back~0_1055, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~n~0=v_~n~0_514, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} OutVars{~q_back~0=v_~q_back~0_1054, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_357|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_234|, #pthreadsForks=|v_#pthreadsForks_303|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_361|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_357|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_542|, #memory_int=|v_#memory_int_771|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_187|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|, ~n~0=v_~n~0_514, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:52:09,966 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:09,966 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:09,966 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:09,966 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:10,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~q~0.base_523))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520| 0)) (= v_~q_back~0_1054 (+ 2 v_~q_back~0_1055)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_1055 4) v_~q~0.offset_523)) 1) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_234| |v_#pthreadsForks_304|) (= |v_thread1Thread1of1ForFork0_~i~0#1_542| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|) (= (store |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157| (store (select |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157|) |v_ULTIMATE.start_main_~#t2~0#1.offset_154| |v_ULTIMATE.start_main_#t~pre14#1_234|)) |v_#memory_int_771|) (not (= (ite (and (< v_~q_back~0_1054 (+ v_~n~0_514 1)) (<= 1 v_~q_back~0_1054)) 1 0) 0)) (= (+ |v_#pthreadsForks_304| 1) |v_#pthreadsForks_303|) (< |v_thread1Thread1of1ForFork0_~i~0#1_542| (+ v_~N~0_392 1)) (not (= (ite (and (<= 0 v_~q_back~0_1055) (< v_~q_back~0_1055 v_~n~0_514)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_523 (* v_~q_back~0_1054 4))) 1) 1 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_304|, ~q_back~0=v_~q_back~0_1055, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~n~0=v_~n~0_514, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} OutVars{~q_back~0=v_~q_back~0_1054, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_357|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_234|, #pthreadsForks=|v_#pthreadsForks_303|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_361|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_357|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_542|, #memory_int=|v_#memory_int_771|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_187|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|, ~n~0=v_~n~0_514, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:52:10,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:10,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-06 07:52:10,458 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 583 transitions, 17626 flow [2022-12-06 07:52:10,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 07:52:10,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:10,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:10,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:10,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-12-06 07:52:10,658 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 113522345, now seen corresponding path program 1 times [2022-12-06 07:52:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:10,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033275761] [2022-12-06 07:52:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033275761] [2022-12-06 07:52:11,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033275761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265564451] [2022-12-06 07:52:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:11,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:11,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:11,449 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:11,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-06 07:52:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:11,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 07:52:11,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:11,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:11,754 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 31 treesize of output 31 [2022-12-06 07:52:11,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:11,845 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 90 treesize of output 20 [2022-12-06 07:52:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:11,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:12,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:12,094 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 271 treesize of output 382 [2022-12-06 07:52:12,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:12,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:52:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265564451] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:13,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:52:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146798639] [2022-12-06 07:52:13,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:13,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:52:13,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:52:13,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:52:13,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 07:52:13,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 583 transitions, 17626 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:52:13,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:13,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 07:52:13,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:15,738 INFO L130 PetriNetUnfolder]: 1969/3645 cut-off events. [2022-12-06 07:52:15,738 INFO L131 PetriNetUnfolder]: For 161191/161222 co-relation queries the response was YES. [2022-12-06 07:52:15,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41178 conditions, 3645 events. 1969/3645 cut-off events. For 161191/161222 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 25085 event pairs, 566 based on Foata normal form. 15/3660 useless extension candidates. Maximal degree in co-relation 40092. Up to 3448 conditions per place. [2022-12-06 07:52:15,775 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 524 selfloop transitions, 80 changer transitions 7/612 dead transitions. [2022-12-06 07:52:15,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 612 transitions, 19144 flow [2022-12-06 07:52:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:52:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:52:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-06 07:52:15,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15819209039548024 [2022-12-06 07:52:15,776 INFO L175 Difference]: Start difference. First operand has 255 places, 583 transitions, 17626 flow. Second operand 12 states and 112 transitions. [2022-12-06 07:52:15,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 612 transitions, 19144 flow [2022-12-06 07:52:16,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 612 transitions, 18829 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-06 07:52:16,465 INFO L231 Difference]: Finished difference. Result has 261 places, 586 transitions, 17569 flow [2022-12-06 07:52:16,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17317, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17569, PETRI_PLACES=261, PETRI_TRANSITIONS=586} [2022-12-06 07:52:16,466 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-06 07:52:16,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:16,466 INFO L89 Accepts]: Start accepts. Operand has 261 places, 586 transitions, 17569 flow [2022-12-06 07:52:16,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:16,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:16,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 586 transitions, 17569 flow [2022-12-06 07:52:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 586 transitions, 17569 flow [2022-12-06 07:52:16,750 INFO L130 PetriNetUnfolder]: 520/1546 cut-off events. [2022-12-06 07:52:16,750 INFO L131 PetriNetUnfolder]: For 66651/67313 co-relation queries the response was YES. [2022-12-06 07:52:16,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15419 conditions, 1546 events. 520/1546 cut-off events. For 66651/67313 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 13276 event pairs, 8 based on Foata normal form. 204/1745 useless extension candidates. Maximal degree in co-relation 15188. Up to 467 conditions per place. [2022-12-06 07:52:16,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 586 transitions, 17569 flow [2022-12-06 07:52:16,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 1928 [2022-12-06 07:52:16,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:16,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-06 07:52:16,806 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 586 transitions, 17569 flow [2022-12-06 07:52:16,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:52:16,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:16,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:16,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:17,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-12-06 07:52:17,012 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1584668543, now seen corresponding path program 2 times [2022-12-06 07:52:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:17,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360498528] [2022-12-06 07:52:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:17,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:17,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360498528] [2022-12-06 07:52:17,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360498528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:17,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095756542] [2022-12-06 07:52:17,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:52:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:17,705 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:17,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-06 07:52:17,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:52:17,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:52:17,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 07:52:17,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:18,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:18,009 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 31 treesize of output 31 [2022-12-06 07:52:18,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:18,148 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 90 treesize of output 20 [2022-12-06 07:52:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:18,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:18,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:18,347 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 271 treesize of output 382 [2022-12-06 07:52:18,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:18,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:52:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:20,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095756542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:20,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:20,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:52:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078180949] [2022-12-06 07:52:20,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:20,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:52:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:52:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:52:20,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 07:52:20,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 586 transitions, 17569 flow. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:20,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:20,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 07:52:20,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:22,098 INFO L130 PetriNetUnfolder]: 1961/3623 cut-off events. [2022-12-06 07:52:22,098 INFO L131 PetriNetUnfolder]: For 154143/154213 co-relation queries the response was YES. [2022-12-06 07:52:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40669 conditions, 3623 events. 1961/3623 cut-off events. For 154143/154213 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 24841 event pairs, 345 based on Foata normal form. 67/3690 useless extension candidates. Maximal degree in co-relation 40404. Up to 3473 conditions per place. [2022-12-06 07:52:22,133 INFO L137 encePairwiseOnDemand]: 21/59 looper letters, 524 selfloop transitions, 69 changer transitions 10/604 dead transitions. [2022-12-06 07:52:22,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 604 transitions, 18891 flow [2022-12-06 07:52:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:52:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:52:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2022-12-06 07:52:22,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1711864406779661 [2022-12-06 07:52:22,134 INFO L175 Difference]: Start difference. First operand has 260 places, 586 transitions, 17569 flow. Second operand 10 states and 101 transitions. [2022-12-06 07:52:22,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 604 transitions, 18891 flow [2022-12-06 07:52:22,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 604 transitions, 18727 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-06 07:52:22,766 INFO L231 Difference]: Finished difference. Result has 262 places, 584 transitions, 17525 flow [2022-12-06 07:52:22,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17398, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17525, PETRI_PLACES=262, PETRI_TRANSITIONS=584} [2022-12-06 07:52:22,767 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 241 predicate places. [2022-12-06 07:52:22,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:22,767 INFO L89 Accepts]: Start accepts. Operand has 262 places, 584 transitions, 17525 flow [2022-12-06 07:52:22,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:22,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:22,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 584 transitions, 17525 flow [2022-12-06 07:52:22,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 584 transitions, 17525 flow [2022-12-06 07:52:23,038 INFO L130 PetriNetUnfolder]: 519/1536 cut-off events. [2022-12-06 07:52:23,039 INFO L131 PetriNetUnfolder]: For 66206/66895 co-relation queries the response was YES. [2022-12-06 07:52:23,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15299 conditions, 1536 events. 519/1536 cut-off events. For 66206/66895 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13151 event pairs, 7 based on Foata normal form. 201/1732 useless extension candidates. Maximal degree in co-relation 14805. Up to 463 conditions per place. [2022-12-06 07:52:23,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 584 transitions, 17525 flow [2022-12-06 07:52:23,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-06 07:52:23,061 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:23,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-06 07:52:23,062 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 584 transitions, 17525 flow [2022-12-06 07:52:23,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:23,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:23,062 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:23,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-12-06 07:52:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:23,267 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2133807661, now seen corresponding path program 1 times [2022-12-06 07:52:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146208079] [2022-12-06 07:52:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:23,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146208079] [2022-12-06 07:52:23,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146208079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:23,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296775631] [2022-12-06 07:52:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:23,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:23,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:23,718 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:23,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-06 07:52:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:23,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:52:23,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:24,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:24,023 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 19 treesize of output 21 [2022-12-06 07:52:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:24,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:24,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4356 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4356) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 8)) 0))) is different from false [2022-12-06 07:52:24,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:24,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 07:52:24,113 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 25 treesize of output 18 [2022-12-06 07:52:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:24,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296775631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:24,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:24,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 07:52:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302315243] [2022-12-06 07:52:24,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:52:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:24,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:52:24,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-12-06 07:52:24,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 07:52:24,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 584 transitions, 17525 flow. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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 07:52:24,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:24,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 07:52:24,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:25,576 INFO L130 PetriNetUnfolder]: 2064/3797 cut-off events. [2022-12-06 07:52:25,577 INFO L131 PetriNetUnfolder]: For 171383/171457 co-relation queries the response was YES. [2022-12-06 07:52:25,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42834 conditions, 3797 events. 2064/3797 cut-off events. For 171383/171457 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25993 event pairs, 250 based on Foata normal form. 105/3902 useless extension candidates. Maximal degree in co-relation 41745. Up to 2530 conditions per place. [2022-12-06 07:52:25,612 INFO L137 encePairwiseOnDemand]: 23/59 looper letters, 442 selfloop transitions, 221 changer transitions 0/664 dead transitions. [2022-12-06 07:52:25,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 664 transitions, 20501 flow [2022-12-06 07:52:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:52:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:52:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-06 07:52:25,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19962335216572505 [2022-12-06 07:52:25,613 INFO L175 Difference]: Start difference. First operand has 260 places, 584 transitions, 17525 flow. Second operand 9 states and 106 transitions. [2022-12-06 07:52:25,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 664 transitions, 20501 flow [2022-12-06 07:52:26,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 664 transitions, 20310 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-06 07:52:26,225 INFO L231 Difference]: Finished difference. Result has 261 places, 608 transitions, 18779 flow [2022-12-06 07:52:26,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17334, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18779, PETRI_PLACES=261, PETRI_TRANSITIONS=608} [2022-12-06 07:52:26,226 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-06 07:52:26,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:26,226 INFO L89 Accepts]: Start accepts. Operand has 261 places, 608 transitions, 18779 flow [2022-12-06 07:52:26,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:26,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:26,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 608 transitions, 18779 flow [2022-12-06 07:52:26,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 608 transitions, 18779 flow [2022-12-06 07:52:26,508 INFO L130 PetriNetUnfolder]: 545/1611 cut-off events. [2022-12-06 07:52:26,508 INFO L131 PetriNetUnfolder]: For 72286/72890 co-relation queries the response was YES. [2022-12-06 07:52:26,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16358 conditions, 1611 events. 545/1611 cut-off events. For 72286/72890 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 13884 event pairs, 8 based on Foata normal form. 198/1804 useless extension candidates. Maximal degree in co-relation 15863. Up to 499 conditions per place. [2022-12-06 07:52:26,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 608 transitions, 18779 flow [2022-12-06 07:52:26,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 2030 [2022-12-06 07:52:26,531 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:26,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 07:52:26,532 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 608 transitions, 18779 flow [2022-12-06 07:52:26,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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 07:52:26,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:26,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:26,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:26,737 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1586533847, now seen corresponding path program 1 times [2022-12-06 07:52:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798483787] [2022-12-06 07:52:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:27,124 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 07:52:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798483787] [2022-12-06 07:52:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798483787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794768002] [2022-12-06 07:52:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:27,125 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:27,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-06 07:52:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:27,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:52:27,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:27,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:27,423 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 19 treesize of output 21 [2022-12-06 07:52:27,452 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 07:52:27,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:27,486 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4407 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4407) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-12-06 07:52:27,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:27,493 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 47 treesize of output 44 [2022-12-06 07:52:27,495 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 25 treesize of output 18 [2022-12-06 07:52:27,534 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 07:52:27,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794768002] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:27,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:27,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 07:52:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488853602] [2022-12-06 07:52:27,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:27,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:52:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:52:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-12-06 07:52:27,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 07:52:27,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 608 transitions, 18779 flow. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 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 07:52:27,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:27,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 07:52:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:29,477 INFO L130 PetriNetUnfolder]: 2436/4439 cut-off events. [2022-12-06 07:52:29,477 INFO L131 PetriNetUnfolder]: For 217140/217236 co-relation queries the response was YES. [2022-12-06 07:52:29,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50739 conditions, 4439 events. 2436/4439 cut-off events. For 217140/217236 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 31210 event pairs, 242 based on Foata normal form. 173/4612 useless extension candidates. Maximal degree in co-relation 49224. Up to 2263 conditions per place. [2022-12-06 07:52:29,521 INFO L137 encePairwiseOnDemand]: 26/59 looper letters, 417 selfloop transitions, 387 changer transitions 0/805 dead transitions. [2022-12-06 07:52:29,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 805 transitions, 24562 flow [2022-12-06 07:52:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:52:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:52:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-12-06 07:52:29,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.196870925684485 [2022-12-06 07:52:29,522 INFO L175 Difference]: Start difference. First operand has 261 places, 608 transitions, 18779 flow. Second operand 13 states and 151 transitions. [2022-12-06 07:52:29,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 805 transitions, 24562 flow [2022-12-06 07:52:30,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 805 transitions, 23497 flow, removed 424 selfloop flow, removed 6 redundant places. [2022-12-06 07:52:30,285 INFO L231 Difference]: Finished difference. Result has 276 places, 705 transitions, 21968 flow [2022-12-06 07:52:30,285 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17633, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=21968, PETRI_PLACES=276, PETRI_TRANSITIONS=705} [2022-12-06 07:52:30,286 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-06 07:52:30,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:30,286 INFO L89 Accepts]: Start accepts. Operand has 276 places, 705 transitions, 21968 flow [2022-12-06 07:52:30,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:30,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:30,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 705 transitions, 21968 flow [2022-12-06 07:52:30,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 705 transitions, 21968 flow [2022-12-06 07:52:30,719 INFO L130 PetriNetUnfolder]: 642/1865 cut-off events. [2022-12-06 07:52:30,720 INFO L131 PetriNetUnfolder]: For 84949/85626 co-relation queries the response was YES. [2022-12-06 07:52:30,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19245 conditions, 1865 events. 642/1865 cut-off events. For 84949/85626 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 16547 event pairs, 9 based on Foata normal form. 210/2070 useless extension candidates. Maximal degree in co-relation 18884. Up to 599 conditions per place. [2022-12-06 07:52:30,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 705 transitions, 21968 flow [2022-12-06 07:52:30,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 2400 [2022-12-06 07:52:30,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:52:30,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:52:31,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:31,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-06 07:52:31,130 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 704 transitions, 21941 flow [2022-12-06 07:52:31,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 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 07:52:31,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:31,130 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:31,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-12-06 07:52:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:31,331 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash -296087447, now seen corresponding path program 1 times [2022-12-06 07:52:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:31,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209051235] [2022-12-06 07:52:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:31,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:31,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209051235] [2022-12-06 07:52:31,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209051235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:31,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736785619] [2022-12-06 07:52:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:31,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:31,928 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:31,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-06 07:52:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:32,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 07:52:32,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:32,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:32,233 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 19 treesize of output 21 [2022-12-06 07:52:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:52:32,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:32,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:32,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 07:52:32,304 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 25 treesize of output 18 [2022-12-06 07:52:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:32,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736785619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:32,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:32,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 16 [2022-12-06 07:52:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728555487] [2022-12-06 07:52:32,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:32,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:52:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:32,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:52:32,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:52:32,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2022-12-06 07:52:32,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 704 transitions, 21941 flow. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:32,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:32,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2022-12-06 07:52:32,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:34,649 INFO L130 PetriNetUnfolder]: 2781/5053 cut-off events. [2022-12-06 07:52:34,649 INFO L131 PetriNetUnfolder]: For 254453/254480 co-relation queries the response was YES. [2022-12-06 07:52:34,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58573 conditions, 5053 events. 2781/5053 cut-off events. For 254453/254480 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36137 event pairs, 326 based on Foata normal form. 83/5136 useless extension candidates. Maximal degree in co-relation 57605. Up to 3398 conditions per place. [2022-12-06 07:52:34,705 INFO L137 encePairwiseOnDemand]: 14/61 looper letters, 537 selfloop transitions, 339 changer transitions 0/877 dead transitions. [2022-12-06 07:52:34,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 877 transitions, 27767 flow [2022-12-06 07:52:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:52:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:52:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2022-12-06 07:52:34,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20081967213114754 [2022-12-06 07:52:34,706 INFO L175 Difference]: Start difference. First operand has 275 places, 704 transitions, 21941 flow. Second operand 12 states and 147 transitions. [2022-12-06 07:52:34,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 877 transitions, 27767 flow [2022-12-06 07:52:35,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 877 transitions, 26979 flow, removed 394 selfloop flow, removed 0 redundant places. [2022-12-06 07:52:35,997 INFO L231 Difference]: Finished difference. Result has 289 places, 792 transitions, 25025 flow [2022-12-06 07:52:35,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=21167, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=25025, PETRI_PLACES=289, PETRI_TRANSITIONS=792} [2022-12-06 07:52:35,997 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 268 predicate places. [2022-12-06 07:52:35,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:35,997 INFO L89 Accepts]: Start accepts. Operand has 289 places, 792 transitions, 25025 flow [2022-12-06 07:52:36,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:36,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:36,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 792 transitions, 25025 flow [2022-12-06 07:52:36,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 792 transitions, 25025 flow [2022-12-06 07:52:36,431 INFO L130 PetriNetUnfolder]: 735/2123 cut-off events. [2022-12-06 07:52:36,432 INFO L131 PetriNetUnfolder]: For 101367/102072 co-relation queries the response was YES. [2022-12-06 07:52:36,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22016 conditions, 2123 events. 735/2123 cut-off events. For 101367/102072 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 19251 event pairs, 9 based on Foata normal form. 242/2361 useless extension candidates. Maximal degree in co-relation 21677. Up to 696 conditions per place. [2022-12-06 07:52:36,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 792 transitions, 25025 flow [2022-12-06 07:52:36,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 2710 [2022-12-06 07:52:36,673 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:36,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 677 [2022-12-06 07:52:36,674 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 792 transitions, 25029 flow [2022-12-06 07:52:36,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:36,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:36,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:36,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-12-06 07:52:36,875 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -858553338, now seen corresponding path program 1 times [2022-12-06 07:52:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:36,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660202172] [2022-12-06 07:52:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660202172] [2022-12-06 07:52:37,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660202172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933154053] [2022-12-06 07:52:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:37,480 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:37,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-06 07:52:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:37,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 07:52:37,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:37,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:37,805 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 19 treesize of output 21 [2022-12-06 07:52:37,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:37,873 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 46 treesize of output 12 [2022-12-06 07:52:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:37,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:38,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:38,102 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 186 treesize of output 178 [2022-12-06 07:52:38,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:38,114 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 121 treesize of output 128 [2022-12-06 07:52:38,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:38,126 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 101 treesize of output 108 [2022-12-06 07:52:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:38,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933154053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:38,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:38,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 07:52:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159988817] [2022-12-06 07:52:38,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:38,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:52:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:52:38,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=286, Unknown=5, NotChecked=0, Total=342 [2022-12-06 07:52:38,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-06 07:52:38,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 792 transitions, 25029 flow. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 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 07:52:38,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:38,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-06 07:52:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:44,771 INFO L130 PetriNetUnfolder]: 2786/5082 cut-off events. [2022-12-06 07:52:44,772 INFO L131 PetriNetUnfolder]: For 241438/241458 co-relation queries the response was YES. [2022-12-06 07:52:44,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59130 conditions, 5082 events. 2786/5082 cut-off events. For 241438/241458 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 36736 event pairs, 789 based on Foata normal form. 11/5093 useless extension candidates. Maximal degree in co-relation 58268. Up to 4877 conditions per place. [2022-12-06 07:52:44,827 INFO L137 encePairwiseOnDemand]: 25/63 looper letters, 734 selfloop transitions, 77 changer transitions 7/819 dead transitions. [2022-12-06 07:52:44,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 819 transitions, 26827 flow [2022-12-06 07:52:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:52:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:52:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-12-06 07:52:44,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15211640211640212 [2022-12-06 07:52:44,828 INFO L175 Difference]: Start difference. First operand has 289 places, 792 transitions, 25029 flow. Second operand 12 states and 115 transitions. [2022-12-06 07:52:44,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 819 transitions, 26827 flow [2022-12-06 07:52:45,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 819 transitions, 26494 flow, removed 159 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:45,950 INFO L231 Difference]: Finished difference. Result has 301 places, 791 transitions, 24852 flow [2022-12-06 07:52:45,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=24696, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=24852, PETRI_PLACES=301, PETRI_TRANSITIONS=791} [2022-12-06 07:52:45,950 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 280 predicate places. [2022-12-06 07:52:45,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:45,950 INFO L89 Accepts]: Start accepts. Operand has 301 places, 791 transitions, 24852 flow [2022-12-06 07:52:45,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:45,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:45,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 791 transitions, 24852 flow [2022-12-06 07:52:45,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 791 transitions, 24852 flow [2022-12-06 07:52:46,481 INFO L130 PetriNetUnfolder]: 734/2126 cut-off events. [2022-12-06 07:52:46,481 INFO L131 PetriNetUnfolder]: For 100421/101125 co-relation queries the response was YES. [2022-12-06 07:52:46,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22025 conditions, 2126 events. 734/2126 cut-off events. For 100421/101125 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 19264 event pairs, 9 based on Foata normal form. 240/2360 useless extension candidates. Maximal degree in co-relation 21774. Up to 698 conditions per place. [2022-12-06 07:52:46,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 791 transitions, 24852 flow [2022-12-06 07:52:46,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 2708 [2022-12-06 07:52:46,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:52:46,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:46,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-06 07:52:46,683 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 790 transitions, 24830 flow [2022-12-06 07:52:46,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 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 07:52:46,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:46,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:46,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:46,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:46,886 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:46,886 INFO L85 PathProgramCache]: Analyzing trace with hash -121652949, now seen corresponding path program 1 times [2022-12-06 07:52:46,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:46,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481880855] [2022-12-06 07:52:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481880855] [2022-12-06 07:52:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481880855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077605768] [2022-12-06 07:52:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:47,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:47,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:47,619 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:47,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-06 07:52:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:47,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 07:52:47,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:47,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:47,994 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 19 treesize of output 21 [2022-12-06 07:52:48,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:48,063 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 46 treesize of output 12 [2022-12-06 07:52:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:48,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:48,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q_front~0 4))) (let ((.cse3 (+ c_~q~0.offset (* 4 c_~q_back~0))) (.cse1 (+ .cse5 c_~q~0.offset 4)) (.cse2 (+ .cse5 c_~q~0.offset))) (and (forall ((v_ArrVal_4558 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4558) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| (+ c_~s~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_4558 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4558) c_~q~0.base))) (or (not (= (select .cse4 .cse3) 1)) (< (+ c_~s~0 (select .cse4 .cse1) (select .cse4 .cse2)) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)))))))) is different from false [2022-12-06 07:52:48,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:48,216 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 186 treesize of output 178 [2022-12-06 07:52:48,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:48,228 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 121 treesize of output 128 [2022-12-06 07:52:48,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:48,240 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 101 treesize of output 108 [2022-12-06 07:52:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077605768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:48,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:48,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:52:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78522549] [2022-12-06 07:52:48,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:48,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:52:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:52:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2022-12-06 07:52:48,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-06 07:52:48,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 790 transitions, 24830 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:52:48,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:48,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-06 07:52:48,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:50,946 INFO L130 PetriNetUnfolder]: 2778/5060 cut-off events. [2022-12-06 07:52:50,946 INFO L131 PetriNetUnfolder]: For 234527/234560 co-relation queries the response was YES. [2022-12-06 07:52:50,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58618 conditions, 5060 events. 2778/5060 cut-off events. For 234527/234560 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 36529 event pairs, 793 based on Foata normal form. 15/5075 useless extension candidates. Maximal degree in co-relation 58332. Up to 4905 conditions per place. [2022-12-06 07:52:51,001 INFO L137 encePairwiseOnDemand]: 26/63 looper letters, 737 selfloop transitions, 64 changer transitions 6/808 dead transitions. [2022-12-06 07:52:51,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 808 transitions, 26542 flow [2022-12-06 07:52:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:52:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:52:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-12-06 07:52:51,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1781305114638448 [2022-12-06 07:52:51,003 INFO L175 Difference]: Start difference. First operand has 298 places, 790 transitions, 24830 flow. Second operand 9 states and 101 transitions. [2022-12-06 07:52:51,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 808 transitions, 26542 flow [2022-12-06 07:52:52,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 808 transitions, 26398 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-06 07:52:52,058 INFO L231 Difference]: Finished difference. Result has 297 places, 788 transitions, 24785 flow [2022-12-06 07:52:52,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=24679, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=24785, PETRI_PLACES=297, PETRI_TRANSITIONS=788} [2022-12-06 07:52:52,058 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 276 predicate places. [2022-12-06 07:52:52,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:52,058 INFO L89 Accepts]: Start accepts. Operand has 297 places, 788 transitions, 24785 flow [2022-12-06 07:52:52,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:52,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:52,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 788 transitions, 24785 flow [2022-12-06 07:52:52,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 788 transitions, 24785 flow [2022-12-06 07:52:52,480 INFO L130 PetriNetUnfolder]: 733/2116 cut-off events. [2022-12-06 07:52:52,481 INFO L131 PetriNetUnfolder]: For 98882/99626 co-relation queries the response was YES. [2022-12-06 07:52:52,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21902 conditions, 2116 events. 733/2116 cut-off events. For 98882/99626 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 19162 event pairs, 8 based on Foata normal form. 241/2352 useless extension candidates. Maximal degree in co-relation 21557. Up to 694 conditions per place. [2022-12-06 07:52:52,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 788 transitions, 24785 flow [2022-12-06 07:52:52,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 2700 [2022-12-06 07:52:52,511 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:52,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 454 [2022-12-06 07:52:52,512 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 788 transitions, 24785 flow [2022-12-06 07:52:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:52:52,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:52,512 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:52,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:52,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-12-06 07:52:52,718 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 266403817, now seen corresponding path program 1 times [2022-12-06 07:52:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:52,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119726801] [2022-12-06 07:52:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:54,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119726801] [2022-12-06 07:52:54,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119726801] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:54,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058071296] [2022-12-06 07:52:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:54,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:54,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:54,536 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:54,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-06 07:52:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:54,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:52:54,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:54,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:54,843 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 07:52:55,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:55,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 07:52:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:55,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:55,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:55,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 268 [2022-12-06 07:52:55,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:55,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 170 [2022-12-06 07:52:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:56,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058071296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:56,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:56,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 07:52:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997818301] [2022-12-06 07:52:56,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:52:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:56,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:52:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:52:56,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 62 [2022-12-06 07:52:56,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 788 transitions, 24785 flow. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 07:52:56,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:56,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 62 [2022-12-06 07:52:56,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:58,560 INFO L130 PetriNetUnfolder]: 2825/5168 cut-off events. [2022-12-06 07:52:58,560 INFO L131 PetriNetUnfolder]: For 248541/248650 co-relation queries the response was YES. [2022-12-06 07:52:58,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60099 conditions, 5168 events. 2825/5168 cut-off events. For 248541/248650 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 38053 event pairs, 850 based on Foata normal form. 70/5238 useless extension candidates. Maximal degree in co-relation 59231. Up to 4925 conditions per place. [2022-12-06 07:52:58,613 INFO L137 encePairwiseOnDemand]: 30/62 looper letters, 779 selfloop transitions, 63 changer transitions 4/847 dead transitions. [2022-12-06 07:52:58,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 847 transitions, 27467 flow [2022-12-06 07:52:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:52:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:52:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2022-12-06 07:52:58,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15207373271889402 [2022-12-06 07:52:58,614 INFO L175 Difference]: Start difference. First operand has 296 places, 788 transitions, 24785 flow. Second operand 14 states and 132 transitions. [2022-12-06 07:52:58,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 847 transitions, 27467 flow [2022-12-06 07:52:59,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 847 transitions, 27328 flow, removed 1 selfloop flow, removed 7 redundant places. [2022-12-06 07:52:59,647 INFO L231 Difference]: Finished difference. Result has 311 places, 811 transitions, 25606 flow [2022-12-06 07:52:59,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=24646, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=25606, PETRI_PLACES=311, PETRI_TRANSITIONS=811} [2022-12-06 07:52:59,647 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 290 predicate places. [2022-12-06 07:52:59,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:59,647 INFO L89 Accepts]: Start accepts. Operand has 311 places, 811 transitions, 25606 flow [2022-12-06 07:52:59,652 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:59,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:59,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 811 transitions, 25606 flow [2022-12-06 07:52:59,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 811 transitions, 25606 flow [2022-12-06 07:53:00,205 INFO L130 PetriNetUnfolder]: 737/2166 cut-off events. [2022-12-06 07:53:00,205 INFO L131 PetriNetUnfolder]: For 104473/105177 co-relation queries the response was YES. [2022-12-06 07:53:00,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22608 conditions, 2166 events. 737/2166 cut-off events. For 104473/105177 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 20024 event pairs, 11 based on Foata normal form. 251/2410 useless extension candidates. Maximal degree in co-relation 22276. Up to 708 conditions per place. [2022-12-06 07:53:00,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 811 transitions, 25606 flow [2022-12-06 07:53:00,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 2810 [2022-12-06 07:53:00,265 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,265 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [817] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_829| v_~q~0.base_565)) (.cse1 (* v_~q_back~0_1171 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_605| (+ v_~N~0_432 1)) (= (+ 3 v_~q_back~0_1171) v_~q_back~0_1169) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_605| 3) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_565)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|) (not (= (ite (and (< v_~q_back~0_1171 v_~n~0_556) (<= 0 v_~q_back~0_1171)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1171))) (and (<= 0 .cse2) (< .cse2 v_~n~0_556))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1171, #memory_int=|v_#memory_int_829|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_417|, ~q_back~0=v_~q_back~0_1169, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_413|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_605|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|, #memory_int=|v_#memory_int_829|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_413|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:53:00,476 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,476 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,638 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,638 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_648| v_~q~0.base_438)) (.cse1 (* v_~q_back~0_873 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_438)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415| 0)) (not (= 0 (ite (and (<= 0 v_~q_back~0_873) (< v_~q_back~0_873 v_~n~0_434)) 1 0))) (< 2 v_~N~0_330) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_445| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|) (= (+ 3 v_~q_back~0_873) v_~q_back~0_871) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_873))) (and (<= 0 .cse2) (< .cse2 v_~n~0_434))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_873, #memory_int=|v_#memory_int_648|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_291|, ~q_back~0=v_~q_back~0_871, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_287|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_445|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|, #memory_int=|v_#memory_int_648|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_287|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:53:00,924 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:00,924 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,007 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,008 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,089 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,089 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,254 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,254 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,420 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,420 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,585 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,586 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:01,759 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:53:01,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2112 [2022-12-06 07:53:01,759 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 807 transitions, 25659 flow [2022-12-06 07:53:01,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 07:53:01,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:01,759 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:01,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:01,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-12-06 07:53:01,965 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2067248405, now seen corresponding path program 2 times [2022-12-06 07:53:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:01,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005821822] [2022-12-06 07:53:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:02,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005821822] [2022-12-06 07:53:02,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005821822] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:02,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422511029] [2022-12-06 07:53:02,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:53:02,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:02,945 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:02,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-06 07:53:03,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:53:03,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:53:03,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 07:53:03,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:03,330 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 19 treesize of output 21 [2022-12-06 07:53:03,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:03,559 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 46 treesize of output 12 [2022-12-06 07:53:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:03,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:03,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:03,769 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 152 treesize of output 153 [2022-12-06 07:53:03,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:03,780 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 97 treesize of output 90 [2022-12-06 07:53:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:03,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422511029] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:03,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:03,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 07:53:03,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808499007] [2022-12-06 07:53:03,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:03,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:53:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:53:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:53:03,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 69 [2022-12-06 07:53:03,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 807 transitions, 25659 flow. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 07:53:03,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:03,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 69 [2022-12-06 07:53:03,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:07,206 INFO L130 PetriNetUnfolder]: 2887/5307 cut-off events. [2022-12-06 07:53:07,206 INFO L131 PetriNetUnfolder]: For 259728/259870 co-relation queries the response was YES. [2022-12-06 07:53:07,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62216 conditions, 5307 events. 2887/5307 cut-off events. For 259728/259870 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 39350 event pairs, 695 based on Foata normal form. 35/5342 useless extension candidates. Maximal degree in co-relation 61553. Up to 4804 conditions per place. [2022-12-06 07:53:07,264 INFO L137 encePairwiseOnDemand]: 28/69 looper letters, 728 selfloop transitions, 116 changer transitions 59/904 dead transitions. [2022-12-06 07:53:07,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 904 transitions, 28883 flow [2022-12-06 07:53:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 07:53:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 07:53:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 190 transitions. [2022-12-06 07:53:07,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11972274732199117 [2022-12-06 07:53:07,266 INFO L175 Difference]: Start difference. First operand has 307 places, 807 transitions, 25659 flow. Second operand 23 states and 190 transitions. [2022-12-06 07:53:07,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 904 transitions, 28883 flow [2022-12-06 07:53:08,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 904 transitions, 28463 flow, removed 161 selfloop flow, removed 9 redundant places. [2022-12-06 07:53:08,574 INFO L231 Difference]: Finished difference. Result has 333 places, 812 transitions, 25637 flow [2022-12-06 07:53:08,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=25241, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=25637, PETRI_PLACES=333, PETRI_TRANSITIONS=812} [2022-12-06 07:53:08,575 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 312 predicate places. [2022-12-06 07:53:08,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:08,575 INFO L89 Accepts]: Start accepts. Operand has 333 places, 812 transitions, 25637 flow [2022-12-06 07:53:08,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:08,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:08,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 333 places, 812 transitions, 25637 flow [2022-12-06 07:53:08,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 812 transitions, 25637 flow [2022-12-06 07:53:09,047 INFO L130 PetriNetUnfolder]: 730/2121 cut-off events. [2022-12-06 07:53:09,047 INFO L131 PetriNetUnfolder]: For 104633/105320 co-relation queries the response was YES. [2022-12-06 07:53:09,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22545 conditions, 2121 events. 730/2121 cut-off events. For 104633/105320 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 19345 event pairs, 9 based on Foata normal form. 230/2346 useless extension candidates. Maximal degree in co-relation 22388. Up to 681 conditions per place. [2022-12-06 07:53:09,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 328 places, 812 transitions, 25637 flow [2022-12-06 07:53:09,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 2746 [2022-12-06 07:53:09,089 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:09,090 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:09,161 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:09,162 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:09,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:53:09,373 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:53:09,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:53:09,743 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:53:09,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1169 [2022-12-06 07:53:09,744 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 811 transitions, 25702 flow [2022-12-06 07:53:09,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 07:53:09,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:09,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:09,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-12-06 07:53:09,950 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1799998097, now seen corresponding path program 1 times [2022-12-06 07:53:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:09,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302304474] [2022-12-06 07:53:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:10,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:10,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302304474] [2022-12-06 07:53:10,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302304474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:10,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:10,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820428719] [2022-12-06 07:53:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:10,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:53:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:10,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:53:10,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:53:10,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 07:53:10,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 811 transitions, 25702 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:10,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:10,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 07:53:10,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:12,262 INFO L130 PetriNetUnfolder]: 3352/6130 cut-off events. [2022-12-06 07:53:12,262 INFO L131 PetriNetUnfolder]: For 304058/304230 co-relation queries the response was YES. [2022-12-06 07:53:12,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72523 conditions, 6130 events. 3352/6130 cut-off events. For 304058/304230 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 45920 event pairs, 284 based on Foata normal form. 90/6220 useless extension candidates. Maximal degree in co-relation 72324. Up to 3229 conditions per place. [2022-12-06 07:53:12,326 INFO L137 encePairwiseOnDemand]: 27/74 looper letters, 511 selfloop transitions, 454 changer transitions 19/985 dead transitions. [2022-12-06 07:53:12,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 985 transitions, 32919 flow [2022-12-06 07:53:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:53:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:53:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-06 07:53:12,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2918918918918919 [2022-12-06 07:53:12,327 INFO L175 Difference]: Start difference. First operand has 327 places, 811 transitions, 25702 flow. Second operand 5 states and 108 transitions. [2022-12-06 07:53:12,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 985 transitions, 32919 flow [2022-12-06 07:53:13,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 985 transitions, 32437 flow, removed 198 selfloop flow, removed 12 redundant places. [2022-12-06 07:53:13,689 INFO L231 Difference]: Finished difference. Result has 322 places, 913 transitions, 30583 flow [2022-12-06 07:53:13,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=25310, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=30583, PETRI_PLACES=322, PETRI_TRANSITIONS=913} [2022-12-06 07:53:13,689 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 301 predicate places. [2022-12-06 07:53:13,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:13,690 INFO L89 Accepts]: Start accepts. Operand has 322 places, 913 transitions, 30583 flow [2022-12-06 07:53:13,695 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:13,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:13,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 322 places, 913 transitions, 30583 flow [2022-12-06 07:53:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 913 transitions, 30583 flow [2022-12-06 07:53:14,360 INFO L130 PetriNetUnfolder]: 877/2537 cut-off events. [2022-12-06 07:53:14,360 INFO L131 PetriNetUnfolder]: For 145526/146946 co-relation queries the response was YES. [2022-12-06 07:53:14,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28893 conditions, 2537 events. 877/2537 cut-off events. For 145526/146946 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 23872 event pairs, 13 based on Foata normal form. 349/2881 useless extension candidates. Maximal degree in co-relation 28710. Up to 844 conditions per place. [2022-12-06 07:53:14,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 913 transitions, 30583 flow [2022-12-06 07:53:14,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 3084 [2022-12-06 07:53:14,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_1207 4)) (.cse0 (select |v_#memory_int_847| v_~q~0.base_579))) (and (not (= (ite (= (select .cse0 (+ v_~q~0.offset_579 .cse1 4)) 1) 1 0) 0)) (= (+ 5 v_~q_back~0_1207) v_~q_back~0_1205) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_584| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_579 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_616|) (= |v_thread1Thread1of1ForFork0_~i~0#1_621| 5) (< |v_thread1Thread1of1ForFork0_~i~0#1_621| (+ v_~N~0_446 1)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1207 4))) (and (<= 0 .cse2) (< .cse2 v_~n~0_570))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_636| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_584| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_584|) (= v_~q_front~0_1038 (+ v_~q_front~0_1039 1)) (not (= (ite (= 1 (select .cse0 (+ 12 v_~q~0.offset_579 .cse1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_616| 0)) (= (ite (= (select .cse0 (+ 16 v_~q~0.offset_579 .cse1)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_584| (ite (and (< v_~q_front~0_1039 v_~n~0_570) (<= 0 v_~q_front~0_1039) (< v_~q_front~0_1039 (+ 3 v_~q_back~0_1207))) 1 0)) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_579 .cse1)) 1) 1 0) 0)) (= (+ v_~s~0_967 |v_thread2Thread1of1ForFork1_~j~0#1_636|) v_~s~0_966) (not (= (ite (and (< v_~q_back~0_1207 v_~n~0_570) (<= 0 v_~q_back~0_1207)) 1 0) 0)) (= (select .cse0 (+ (* v_~q_front~0_1039 4) v_~q~0.offset_579)) |v_thread2Thread1of1ForFork1_~j~0#1_636|))) InVars {~q_back~0=v_~q_back~0_1207, #memory_int=|v_#memory_int_847|, ~N~0=v_~N~0_446, ~q~0.base=v_~q~0.base_579, ~n~0=v_~n~0_570, ~q~0.offset=v_~q~0.offset_579, ~s~0=v_~s~0_967, ~q_front~0=v_~q_front~0_1039} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_636|, ~q_back~0=v_~q_back~0_1205, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_584|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_429|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_584|, ~N~0=v_~N~0_446, ~q~0.base=v_~q~0.base_579, ~q~0.offset=v_~q~0.offset_579, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_584|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_584|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_433|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_429|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_621|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_616|, #memory_int=|v_#memory_int_847|, ~n~0=v_~n~0_570, ~s~0=v_~s~0_966, ~q_front~0=v_~q_front~0_1038} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:53:14,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:14,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1231 [2022-12-06 07:53:14,920 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 913 transitions, 30612 flow [2022-12-06 07:53:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:14,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:14,920 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:14,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-06 07:53:14,920 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1774602825, now seen corresponding path program 1 times [2022-12-06 07:53:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:14,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568149080] [2022-12-06 07:53:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568149080] [2022-12-06 07:53:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568149080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572456142] [2022-12-06 07:53:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:15,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:15,324 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:15,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-06 07:53:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:15,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:53:15,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:15,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:15,663 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:53:15,663 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 25 treesize of output 16 [2022-12-06 07:53:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:15,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572456142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:15,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:15,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-12-06 07:53:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196420824] [2022-12-06 07:53:15,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:15,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:53:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:15,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:53:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:53:15,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 69 [2022-12-06 07:53:15,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 913 transitions, 30612 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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 07:53:15,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:15,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 69 [2022-12-06 07:53:15,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:19,032 INFO L130 PetriNetUnfolder]: 3754/7025 cut-off events. [2022-12-06 07:53:19,032 INFO L131 PetriNetUnfolder]: For 408312/408637 co-relation queries the response was YES. [2022-12-06 07:53:19,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87858 conditions, 7025 events. 3754/7025 cut-off events. For 408312/408637 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 54563 event pairs, 416 based on Foata normal form. 170/7195 useless extension candidates. Maximal degree in co-relation 87493. Up to 3972 conditions per place. [2022-12-06 07:53:19,129 INFO L137 encePairwiseOnDemand]: 16/69 looper letters, 500 selfloop transitions, 652 changer transitions 1/1154 dead transitions. [2022-12-06 07:53:19,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1154 transitions, 38986 flow [2022-12-06 07:53:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:53:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:53:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 204 transitions. [2022-12-06 07:53:19,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19710144927536233 [2022-12-06 07:53:19,130 INFO L175 Difference]: Start difference. First operand has 318 places, 913 transitions, 30612 flow. Second operand 15 states and 204 transitions. [2022-12-06 07:53:19,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1154 transitions, 38986 flow [2022-12-06 07:53:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1154 transitions, 38356 flow, removed 238 selfloop flow, removed 11 redundant places. [2022-12-06 07:53:21,445 INFO L231 Difference]: Finished difference. Result has 328 places, 1063 transitions, 37509 flow [2022-12-06 07:53:21,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=29991, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=530, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=37509, PETRI_PLACES=328, PETRI_TRANSITIONS=1063} [2022-12-06 07:53:21,445 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 307 predicate places. [2022-12-06 07:53:21,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:21,446 INFO L89 Accepts]: Start accepts. Operand has 328 places, 1063 transitions, 37509 flow [2022-12-06 07:53:21,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:21,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:21,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 328 places, 1063 transitions, 37509 flow [2022-12-06 07:53:21,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 1063 transitions, 37509 flow [2022-12-06 07:53:22,235 INFO L130 PetriNetUnfolder]: 980/2979 cut-off events. [2022-12-06 07:53:22,235 INFO L131 PetriNetUnfolder]: For 177595/179472 co-relation queries the response was YES. [2022-12-06 07:53:22,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34203 conditions, 2979 events. 980/2979 cut-off events. For 177595/179472 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 29303 event pairs, 18 based on Foata normal form. 382/3356 useless extension candidates. Maximal degree in co-relation 33838. Up to 1028 conditions per place. [2022-12-06 07:53:22,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 328 places, 1063 transitions, 37509 flow [2022-12-06 07:53:22,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 3546 [2022-12-06 07:53:22,284 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:22,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 839 [2022-12-06 07:53:22,284 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 1063 transitions, 37509 flow [2022-12-06 07:53:22,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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 07:53:22,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:22,285 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:22,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:22,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:22,491 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 367583795, now seen corresponding path program 1 times [2022-12-06 07:53:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226625392] [2022-12-06 07:53:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:23,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:23,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226625392] [2022-12-06 07:53:23,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226625392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:23,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924398654] [2022-12-06 07:53:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:23,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:23,357 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:23,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-06 07:53:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:23,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 07:53:23,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:23,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:23,654 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 31 treesize of output 31 [2022-12-06 07:53:23,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:23,823 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 92 treesize of output 20 [2022-12-06 07:53:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:23,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:24,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:24,056 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 271 treesize of output 382 [2022-12-06 07:53:24,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:24,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:53:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:26,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924398654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:26,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:26,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 07:53:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527002557] [2022-12-06 07:53:26,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:53:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:53:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:53:26,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 69 [2022-12-06 07:53:26,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1063 transitions, 37509 flow. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 07:53:26,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:26,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 69 [2022-12-06 07:53:26,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:30,318 INFO L130 PetriNetUnfolder]: 3769/7059 cut-off events. [2022-12-06 07:53:30,318 INFO L131 PetriNetUnfolder]: For 381334/381595 co-relation queries the response was YES. [2022-12-06 07:53:30,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90266 conditions, 7059 events. 3769/7059 cut-off events. For 381334/381595 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 54768 event pairs, 979 based on Foata normal form. 101/7160 useless extension candidates. Maximal degree in co-relation 89580. Up to 6914 conditions per place. [2022-12-06 07:53:30,403 INFO L137 encePairwiseOnDemand]: 33/69 looper letters, 1022 selfloop transitions, 44 changer transitions 30/1097 dead transitions. [2022-12-06 07:53:30,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1097 transitions, 40063 flow [2022-12-06 07:53:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:53:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:53:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2022-12-06 07:53:30,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14381270903010032 [2022-12-06 07:53:30,404 INFO L175 Difference]: Start difference. First operand has 328 places, 1063 transitions, 37509 flow. Second operand 13 states and 129 transitions. [2022-12-06 07:53:30,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1097 transitions, 40063 flow [2022-12-06 07:53:32,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1097 transitions, 38051 flow, removed 954 selfloop flow, removed 9 redundant places. [2022-12-06 07:53:32,852 INFO L231 Difference]: Finished difference. Result has 335 places, 1059 transitions, 35468 flow [2022-12-06 07:53:32,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=35501, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35468, PETRI_PLACES=335, PETRI_TRANSITIONS=1059} [2022-12-06 07:53:32,853 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 314 predicate places. [2022-12-06 07:53:32,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:32,853 INFO L89 Accepts]: Start accepts. Operand has 335 places, 1059 transitions, 35468 flow [2022-12-06 07:53:32,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:32,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:32,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 1059 transitions, 35468 flow [2022-12-06 07:53:32,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 329 places, 1059 transitions, 35468 flow [2022-12-06 07:53:33,758 INFO L130 PetriNetUnfolder]: 978/2970 cut-off events. [2022-12-06 07:53:33,758 INFO L131 PetriNetUnfolder]: For 156354/158000 co-relation queries the response was YES. [2022-12-06 07:53:33,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32509 conditions, 2970 events. 978/2970 cut-off events. For 156354/158000 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 29160 event pairs, 18 based on Foata normal form. 374/3339 useless extension candidates. Maximal degree in co-relation 32128. Up to 1025 conditions per place. [2022-12-06 07:53:33,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 1059 transitions, 35468 flow [2022-12-06 07:53:33,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 3526 [2022-12-06 07:53:33,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] L65-2-->L47-4: Formula: (let ((.cse3 (select |v_#memory_int_872| v_~q~0.base_595)) (.cse5 (* v_~q_front~0_1104 4))) (let ((.cse4 (* v_~q_back~0_1259 4)) (.cse0 (select .cse3 (+ .cse5 v_~q~0.offset_595)))) (and (not (= .cse0 0)) (= (ite (let ((.cse1 (+ v_~q_front~0_1104 1))) (and (<= 0 .cse1) (< .cse1 v_~n~0_586) (< .cse1 v_~q_back~0_1259))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629|) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1259 1))) (and (< .cse2 v_~n~0_586) (<= 0 .cse2))) 1 0) 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_657| 1) v_~N~0_460) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_629|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_629| 0)) (not (= (ite (= (select .cse3 (+ v_~q~0.offset_595 .cse4)) 1) 1 0) 0)) (= v_~q_back~0_1257 (+ 2 v_~q_back~0_1259)) (= (+ v_~q_front~0_1104 2) v_~q_front~0_1103) (= |v_thread1Thread1of1ForFork0_~i~0#1_655| (+ |v_thread1Thread1of1ForFork0_~i~0#1_657| 2)) (not (= (ite (and (< v_~q_front~0_1104 v_~q_back~0_1259) (< v_~q_front~0_1104 v_~n~0_586) (<= 0 v_~q_front~0_1104)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_655| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_655|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_687| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_655| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_655| (ite (= (select .cse3 (+ v_~q~0.offset_595 4 .cse4)) 1) 1 0)) (= (+ .cse0 v_~s~0_1032 |v_thread2Thread1of1ForFork1_~j~0#1_687|) v_~s~0_1031) (= (select .cse3 (+ .cse5 v_~q~0.offset_595 4)) |v_thread2Thread1of1ForFork1_~j~0#1_687|)))) InVars {~q_back~0=v_~q_back~0_1259, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_657|, #memory_int=|v_#memory_int_872|, ~N~0=v_~N~0_460, ~q~0.base=v_~q~0.base_595, ~n~0=v_~n~0_586, ~q~0.offset=v_~q~0.offset_595, ~s~0=v_~s~0_1032, ~q_front~0=v_~q_front~0_1104} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_687|, ~q_back~0=v_~q_back~0_1257, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_462|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_629|, ~N~0=v_~N~0_460, ~q~0.base=v_~q~0.base_595, ~q~0.offset=v_~q~0.offset_595, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_629|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_629|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_655|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_466|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_462|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_655|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_655|, #memory_int=|v_#memory_int_872|, ~n~0=v_~n~0_586, ~s~0=v_~s~0_1031, ~q_front~0=v_~q_front~0_1103} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:53:34,196 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:34,196 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:34,196 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:34,196 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:34,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:34,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1630 [2022-12-06 07:53:34,483 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 1059 transitions, 35512 flow [2022-12-06 07:53:34,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 07:53:34,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:34,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:34,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:34,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:34,689 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash -714074185, now seen corresponding path program 1 times [2022-12-06 07:53:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:34,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340015834] [2022-12-06 07:53:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:35,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340015834] [2022-12-06 07:53:35,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340015834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:35,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104353127] [2022-12-06 07:53:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:35,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:35,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:35,269 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:35,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-06 07:53:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:35,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 07:53:35,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:35,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:35,603 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 07:53:35,622 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 07:53:35,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:53:35,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104353127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:35,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:53:35,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 07:53:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911011309] [2022-12-06 07:53:35,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:35,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:53:35,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:35,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:53:35,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:53:35,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 71 [2022-12-06 07:53:35,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1059 transitions, 35512 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 07:53:35,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:35,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 71 [2022-12-06 07:53:35,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:38,735 INFO L130 PetriNetUnfolder]: 3709/6928 cut-off events. [2022-12-06 07:53:38,735 INFO L131 PetriNetUnfolder]: For 350796/351109 co-relation queries the response was YES. [2022-12-06 07:53:38,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84466 conditions, 6928 events. 3709/6928 cut-off events. For 350796/351109 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 52987 event pairs, 412 based on Foata normal form. 77/7005 useless extension candidates. Maximal degree in co-relation 83833. Up to 5530 conditions per place. [2022-12-06 07:53:38,814 INFO L137 encePairwiseOnDemand]: 18/71 looper letters, 789 selfloop transitions, 283 changer transitions 1/1074 dead transitions. [2022-12-06 07:53:38,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1074 transitions, 37831 flow [2022-12-06 07:53:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 07:53:38,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29577464788732394 [2022-12-06 07:53:38,815 INFO L175 Difference]: Start difference. First operand has 329 places, 1059 transitions, 35512 flow. Second operand 4 states and 84 transitions. [2022-12-06 07:53:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1074 transitions, 37831 flow [2022-12-06 07:53:40,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1074 transitions, 37688 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-06 07:53:40,809 INFO L231 Difference]: Finished difference. Result has 324 places, 1055 transitions, 36066 flow [2022-12-06 07:53:40,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=35242, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=36066, PETRI_PLACES=324, PETRI_TRANSITIONS=1055} [2022-12-06 07:53:40,810 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 303 predicate places. [2022-12-06 07:53:40,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:40,810 INFO L89 Accepts]: Start accepts. Operand has 324 places, 1055 transitions, 36066 flow [2022-12-06 07:53:40,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:40,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:40,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 1055 transitions, 36066 flow [2022-12-06 07:53:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 1055 transitions, 36066 flow [2022-12-06 07:53:41,622 INFO L130 PetriNetUnfolder]: 972/2934 cut-off events. [2022-12-06 07:53:41,622 INFO L131 PetriNetUnfolder]: For 154929/156367 co-relation queries the response was YES. [2022-12-06 07:53:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32417 conditions, 2934 events. 972/2934 cut-off events. For 154929/156367 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 28603 event pairs, 17 based on Foata normal form. 348/3278 useless extension candidates. Maximal degree in co-relation 32041. Up to 1012 conditions per place. [2022-12-06 07:53:41,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 323 places, 1055 transitions, 36066 flow [2022-12-06 07:53:41,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 3510 [2022-12-06 07:53:41,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_859| v_~q~0.base_587)) (.cse1 (* v_~q_back~0_1228 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_587)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ v_~N~0_452 1)) (= v_~q_front~0_1063 (+ v_~q_front~0_1064 1)) (not (= (ite (and (< v_~q_back~0_1228 v_~n~0_578) (<= 0 v_~q_back~0_1228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| 3) (= (select .cse0 (+ (* v_~q_front~0_1064 4) v_~q~0.offset_587)) |v_thread2Thread1of1ForFork1_~j~0#1_656|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602| (ite (and (< v_~q_front~0_1064 v_~q_back~0_1227) (< v_~q_front~0_1064 v_~n~0_578) (<= 0 v_~q_front~0_1064)) 1 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1228))) (and (< .cse2 v_~n~0_578) (<= 0 .cse2))) 1 0) 0)) (= (+ 3 v_~q_back~0_1228) v_~q_back~0_1227) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_587 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_587)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_656| 0)) (= (+ v_~s~0_992 |v_thread2Thread1of1ForFork1_~j~0#1_656|) v_~s~0_991) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602| 0)))) InVars {~q_back~0=v_~q_back~0_1228, #memory_int=|v_#memory_int_859|, ~N~0=v_~N~0_452, ~q~0.base=v_~q~0.base_587, ~n~0=v_~n~0_578, ~q~0.offset=v_~q~0.offset_587, ~s~0=v_~s~0_992, ~q_front~0=v_~q_front~0_1064} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_656|, ~q_back~0=v_~q_back~0_1227, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_602|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_443|, ~N~0=v_~N~0_452, ~q~0.base=v_~q~0.base_587, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_602|, ~q~0.offset=v_~q~0.offset_587, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_447|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_443|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, #memory_int=|v_#memory_int_859|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631|, ~n~0=v_~n~0_578, ~s~0=v_~s~0_991, ~q_front~0=v_~q_front~0_1063} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:53:41,688 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:41,688 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:41,688 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:41,688 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:41,688 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:41,688 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,056 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,056 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,057 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,057 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,057 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,057 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:42,311 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:42,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1502 [2022-12-06 07:53:42,312 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 1055 transitions, 36132 flow [2022-12-06 07:53:42,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 07:53:42,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:42,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:42,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:42,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2022-12-06 07:53:42,517 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1223916392, now seen corresponding path program 1 times [2022-12-06 07:53:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:42,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273958140] [2022-12-06 07:53:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:43,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273958140] [2022-12-06 07:53:43,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273958140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:43,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969137888] [2022-12-06 07:53:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:43,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:43,740 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:43,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-06 07:53:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:44,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 07:53:44,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:44,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:44,048 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 31 treesize of output 31 [2022-12-06 07:53:44,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:44,165 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 90 treesize of output 20 [2022-12-06 07:53:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:44,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:44,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:44,385 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 271 treesize of output 382 [2022-12-06 07:53:44,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:44,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:53:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:45,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969137888] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:45,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:45,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:53:45,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871482876] [2022-12-06 07:53:45,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:45,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:53:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:45,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:53:45,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:53:45,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 72 [2022-12-06 07:53:45,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 1055 transitions, 36132 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:53:45,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:45,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 72 [2022-12-06 07:53:45,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:49,796 INFO L130 PetriNetUnfolder]: 3720/6952 cut-off events. [2022-12-06 07:53:49,796 INFO L131 PetriNetUnfolder]: For 342838/343070 co-relation queries the response was YES. [2022-12-06 07:53:49,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85844 conditions, 6952 events. 3720/6952 cut-off events. For 342838/343070 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 53749 event pairs, 910 based on Foata normal form. 90/7042 useless extension candidates. Maximal degree in co-relation 84956. Up to 6770 conditions per place. [2022-12-06 07:53:49,926 INFO L137 encePairwiseOnDemand]: 26/72 looper letters, 991 selfloop transitions, 75 changer transitions 23/1090 dead transitions. [2022-12-06 07:53:49,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1090 transitions, 38711 flow [2022-12-06 07:53:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:53:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:53:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2022-12-06 07:53:49,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14102564102564102 [2022-12-06 07:53:49,928 INFO L175 Difference]: Start difference. First operand has 323 places, 1055 transitions, 36132 flow. Second operand 13 states and 132 transitions. [2022-12-06 07:53:49,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1090 transitions, 38711 flow [2022-12-06 07:53:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 1090 transitions, 38380 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 07:53:51,900 INFO L231 Difference]: Finished difference. Result has 336 places, 1055 transitions, 35969 flow [2022-12-06 07:53:51,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=35801, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=980, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35969, PETRI_PLACES=336, PETRI_TRANSITIONS=1055} [2022-12-06 07:53:51,900 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 315 predicate places. [2022-12-06 07:53:51,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:51,900 INFO L89 Accepts]: Start accepts. Operand has 336 places, 1055 transitions, 35969 flow [2022-12-06 07:53:51,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:51,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:51,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 1055 transitions, 35969 flow [2022-12-06 07:53:51,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 1055 transitions, 35969 flow [2022-12-06 07:53:52,636 INFO L130 PetriNetUnfolder]: 970/2924 cut-off events. [2022-12-06 07:53:52,636 INFO L131 PetriNetUnfolder]: For 156236/157714 co-relation queries the response was YES. [2022-12-06 07:53:52,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32373 conditions, 2924 events. 970/2924 cut-off events. For 156236/157714 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 28578 event pairs, 16 based on Foata normal form. 344/3264 useless extension candidates. Maximal degree in co-relation 31963. Up to 1010 conditions per place. [2022-12-06 07:53:52,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 1055 transitions, 35969 flow [2022-12-06 07:53:52,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 3502 [2022-12-06 07:53:52,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_756| v_~q~0.base_513))) (and (= (+ 1 v_~q_front~0_904) v_~q_front~0_903) (= |v_thread1Thread1of1ForFork0_~i~0#1_526| (+ |v_thread1Thread1of1ForFork0_~i~0#1_527| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| (ite (and (< v_~q_front~0_904 v_~q_back~0_1032) (< v_~q_front~0_904 v_~n~0_504) (<= 0 v_~q_front~0_904)) 1 0)) (not (= (ite (and (<= 0 v_~q_back~0_1032) (< v_~q_back~0_1032 v_~n~0_504)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507| 0)) (= (+ v_~s~0_830 |v_thread2Thread1of1ForFork1_~j~0#1_544|) v_~s~0_829) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_544| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_527| v_~N~0_382) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507| (ite (= (select .cse0 (+ (* v_~q_back~0_1032 4) v_~q~0.offset_513)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_904) v_~q~0.offset_513)) |v_thread2Thread1of1ForFork1_~j~0#1_544|) (= (+ v_~q_back~0_1032 1) v_~q_back~0_1031))) InVars {~q_back~0=v_~q_back~0_1032, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_527|, #memory_int=|v_#memory_int_756|, ~N~0=v_~N~0_382, ~q~0.base=v_~q~0.base_513, ~n~0=v_~n~0_504, ~q~0.offset=v_~q~0.offset_513, ~s~0=v_~s~0_830, ~q_front~0=v_~q_front~0_904} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_544|, ~q_back~0=v_~q_back~0_1031, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_351|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_498|, ~N~0=v_~N~0_382, ~q~0.base=v_~q~0.base_513, ~q~0.offset=v_~q~0.offset_513, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_498|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_355|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_351|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_526|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|, #memory_int=|v_#memory_int_756|, ~n~0=v_~n~0_504, ~s~0=v_~s~0_829, ~q_front~0=v_~q_front~0_903} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:53:52,697 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,697 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,697 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,697 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,697 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,697 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,948 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,948 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,948 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,948 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,948 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:52,948 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:53:53,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:53,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1414 [2022-12-06 07:53:53,314 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 1055 transitions, 36007 flow [2022-12-06 07:53:53,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 07:53:53,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:53,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:53,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:53,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:53,520 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1739359493, now seen corresponding path program 1 times [2022-12-06 07:53:53,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:53,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834628405] [2022-12-06 07:53:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:54,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:54,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834628405] [2022-12-06 07:53:54,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834628405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:54,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571298687] [2022-12-06 07:53:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:54,288 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:54,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-06 07:53:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:54,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:53:54,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:54,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:54,624 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 68 treesize of output 16 [2022-12-06 07:53:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:54,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:54,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:54,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 150 [2022-12-06 07:53:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:54,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571298687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:54,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:54,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:53:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006768147] [2022-12-06 07:53:54,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:53:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:53:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:53:54,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-06 07:53:54,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1055 transitions, 36007 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:54,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:54,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-06 07:53:54,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:58,200 INFO L130 PetriNetUnfolder]: 3713/6947 cut-off events. [2022-12-06 07:53:58,200 INFO L131 PetriNetUnfolder]: For 338039/338341 co-relation queries the response was YES. [2022-12-06 07:53:58,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85371 conditions, 6947 events. 3713/6947 cut-off events. For 338039/338341 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 53396 event pairs, 891 based on Foata normal form. 97/7044 useless extension candidates. Maximal degree in co-relation 84606. Up to 6718 conditions per place. [2022-12-06 07:53:58,282 INFO L137 encePairwiseOnDemand]: 29/73 looper letters, 977 selfloop transitions, 100 changer transitions 14/1092 dead transitions. [2022-12-06 07:53:58,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1092 transitions, 38528 flow [2022-12-06 07:53:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:53:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:53:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 142 transitions. [2022-12-06 07:53:58,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12968036529680366 [2022-12-06 07:53:58,283 INFO L175 Difference]: Start difference. First operand has 331 places, 1055 transitions, 36007 flow. Second operand 15 states and 142 transitions. [2022-12-06 07:53:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 1092 transitions, 38528 flow [2022-12-06 07:54:00,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 1092 transitions, 38252 flow, removed 38 selfloop flow, removed 10 redundant places. [2022-12-06 07:54:00,271 INFO L231 Difference]: Finished difference. Result has 339 places, 1057 transitions, 35982 flow [2022-12-06 07:54:00,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=35735, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=35982, PETRI_PLACES=339, PETRI_TRANSITIONS=1057} [2022-12-06 07:54:00,272 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 318 predicate places. [2022-12-06 07:54:00,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:00,272 INFO L89 Accepts]: Start accepts. Operand has 339 places, 1057 transitions, 35982 flow [2022-12-06 07:54:00,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:00,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:00,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 1057 transitions, 35982 flow [2022-12-06 07:54:00,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 1057 transitions, 35982 flow [2022-12-06 07:54:01,006 INFO L130 PetriNetUnfolder]: 970/2931 cut-off events. [2022-12-06 07:54:01,006 INFO L131 PetriNetUnfolder]: For 154545/156199 co-relation queries the response was YES. [2022-12-06 07:54:01,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32420 conditions, 2931 events. 970/2931 cut-off events. For 154545/156199 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 28558 event pairs, 17 based on Foata normal form. 340/3265 useless extension candidates. Maximal degree in co-relation 32064. Up to 1014 conditions per place. [2022-12-06 07:54:01,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 1057 transitions, 35982 flow [2022-12-06 07:54:01,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 3504 [2022-12-06 07:54:01,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:54:01,178 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:01,178 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:01,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [891] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (* v_~q_back~0_1436 4)) (.cse0 (select |v_#memory_int_984| v_~q~0.base_660)) (.cse2 (* v_~q_front~0_1314 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_660)) 1) 1 0) 0)) (= (+ v_~s~0_1246 |v_thread2Thread1of1ForFork1_~j~0#1_846| (select .cse0 (+ .cse2 v_~q~0.offset_660))) v_~s~0_1244) (not (= (ite (and (<= 0 v_~q_back~0_1436) (< v_~q_back~0_1436 v_~n~0_648)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_773| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_773|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_766| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_660 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_766| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_660)) 1) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1314) (< v_~q_front~0_1314 v_~q_back~0_1435) (< v_~q_front~0_1314 v_~n~0_648)) 1 0) 0)) (not (= v_~s~0_1244 (+ v_~s~0_1246 |v_thread2Thread1of1ForFork1_~j~0#1_846|))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_766| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_766|) (= (+ v_~q_front~0_1314 2) v_~q_front~0_1312) (< |v_thread1Thread1of1ForFork0_~i~0#1_766| (+ v_~N~0_502 1)) (= (select .cse0 (+ .cse2 v_~q~0.offset_660 4)) |v_thread2Thread1of1ForFork1_~j~0#1_846|) (not (= (ite (let ((.cse3 (+ 2 v_~q_back~0_1436))) (and (< .cse3 v_~n~0_648) (<= 0 .cse3))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_846| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_773| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_773| (ite (let ((.cse4 (+ v_~q_front~0_1314 1))) (and (< .cse4 v_~n~0_648) (< .cse4 v_~q_back~0_1435) (<= 0 .cse4))) 1 0)) (= (+ 3 v_~q_back~0_1436) v_~q_back~0_1435) (= |v_thread1Thread1of1ForFork0_~i~0#1_766| 3))) InVars {~q_back~0=v_~q_back~0_1436, #memory_int=|v_#memory_int_984|, ~N~0=v_~N~0_502, ~q~0.base=v_~q~0.base_660, ~n~0=v_~n~0_648, ~q~0.offset=v_~q~0.offset_660, ~s~0=v_~s~0_1246, ~q_front~0=v_~q_front~0_1314} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_846|, ~q_back~0=v_~q_back~0_1435, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_773|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_773|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_544|, ~N~0=v_~N~0_502, ~q~0.base=v_~q~0.base_660, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_773|, ~q~0.offset=v_~q~0.offset_660, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_773|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_766|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_548|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_544|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_766|, #memory_int=|v_#memory_int_984|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_766|, ~n~0=v_~n~0_648, ~s~0=v_~s~0_1244, ~q_front~0=v_~q_front~0_1312} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:54:02,219 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:02,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1947 [2022-12-06 07:54:02,219 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 1056 transitions, 36024 flow [2022-12-06 07:54:02,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-12-06 07:54:02,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:02,420 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1071850554, now seen corresponding path program 1 times [2022-12-06 07:54:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:02,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759133092] [2022-12-06 07:54:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:03,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759133092] [2022-12-06 07:54:03,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759133092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:03,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675680574] [2022-12-06 07:54:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:03,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:03,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:03,499 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:03,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-06 07:54:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:03,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 07:54:03,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:03,823 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 30 treesize of output 30 [2022-12-06 07:54:03,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:03,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 07:54:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:03,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:04,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:04,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 243 [2022-12-06 07:54:04,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:04,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 115 treesize of output 108 [2022-12-06 07:54:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:04,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675680574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:04,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:04,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 07:54:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743353445] [2022-12-06 07:54:04,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:04,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:54:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:54:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:54:04,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 07:54:04,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1056 transitions, 36024 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:04,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:04,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 07:54:04,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:08,541 INFO L130 PetriNetUnfolder]: 3771/7077 cut-off events. [2022-12-06 07:54:08,541 INFO L131 PetriNetUnfolder]: For 358916/359055 co-relation queries the response was YES. [2022-12-06 07:54:08,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87016 conditions, 7077 events. 3771/7077 cut-off events. For 358916/359055 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 54857 event pairs, 689 based on Foata normal form. 25/7102 useless extension candidates. Maximal degree in co-relation 86410. Up to 5899 conditions per place. [2022-12-06 07:54:08,624 INFO L137 encePairwiseOnDemand]: 24/74 looper letters, 880 selfloop transitions, 245 changer transitions 17/1143 dead transitions. [2022-12-06 07:54:08,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1143 transitions, 40063 flow [2022-12-06 07:54:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:54:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:54:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2022-12-06 07:54:08,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13873873873873874 [2022-12-06 07:54:08,625 INFO L175 Difference]: Start difference. First operand has 334 places, 1056 transitions, 36024 flow. Second operand 15 states and 154 transitions. [2022-12-06 07:54:08,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1143 transitions, 40063 flow [2022-12-06 07:54:10,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1143 transitions, 39751 flow, removed 48 selfloop flow, removed 11 redundant places. [2022-12-06 07:54:10,974 INFO L231 Difference]: Finished difference. Result has 343 places, 1075 transitions, 37170 flow [2022-12-06 07:54:10,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=35724, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=37170, PETRI_PLACES=343, PETRI_TRANSITIONS=1075} [2022-12-06 07:54:10,975 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 322 predicate places. [2022-12-06 07:54:10,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:10,975 INFO L89 Accepts]: Start accepts. Operand has 343 places, 1075 transitions, 37170 flow [2022-12-06 07:54:10,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:10,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:10,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 1075 transitions, 37170 flow [2022-12-06 07:54:10,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 1075 transitions, 37170 flow [2022-12-06 07:54:11,751 INFO L130 PetriNetUnfolder]: 982/2979 cut-off events. [2022-12-06 07:54:11,751 INFO L131 PetriNetUnfolder]: For 162443/164250 co-relation queries the response was YES. [2022-12-06 07:54:11,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33257 conditions, 2979 events. 982/2979 cut-off events. For 162443/164250 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 29267 event pairs, 21 based on Foata normal form. 341/3311 useless extension candidates. Maximal degree in co-relation 32892. Up to 1030 conditions per place. [2022-12-06 07:54:11,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 1075 transitions, 37170 flow [2022-12-06 07:54:11,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 3556 [2022-12-06 07:54:11,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [899] $Ultimate##0-->L47-4: Formula: (let ((.cse3 (+ v_~q_front~0_1347 1)) (.cse2 (* v_~q_front~0_1347 4)) (.cse4 (+ v_~q_front~0_1347 2)) (.cse0 (select |v_#memory_int_997| v_~q~0.base_670)) (.cse1 (* v_~q_back~0_1467 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_797| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_797|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_872| 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_670)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_872| (select .cse0 (+ .cse2 v_~q~0.offset_670 4))) (< 3 v_~N~0_512) (not (= 0 (ite (and (<= 1 v_~q_back~0_1465) (< v_~q_back~0_1465 (+ v_~n~0_658 1))) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_787| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_787|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_670)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_787| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_792| 4) (= (+ v_~q_back~0_1467 4) v_~q_back~0_1465) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1465 4) (- 4) v_~q~0.offset_670)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_787|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_797| (ite (and (<= 0 .cse3) (< .cse3 v_~n~0_658) (< .cse4 v_~q_back~0_1465)) 1 0)) (not (= (ite (and (< .cse3 v_~q_back~0_1465) (< v_~q_front~0_1347 v_~n~0_658) (<= 0 v_~q_front~0_1347)) 1 0) 0)) (= (+ (select .cse0 (+ .cse2 v_~q~0.offset_670)) v_~s~0_1283 |v_thread2Thread1of1ForFork1_~j~0#1_872|) v_~s~0_1282) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_797| 0)) (not (= v_~s~0_1282 (+ v_~s~0_1283 |v_thread2Thread1of1ForFork1_~j~0#1_872|))) (= v_~q_front~0_1346 .cse4) (not (= (ite (and (<= 0 v_~q_back~0_1467) (< v_~q_back~0_1467 v_~n~0_658)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_670 4)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1467, #memory_int=|v_#memory_int_997|, ~N~0=v_~N~0_512, ~q~0.base=v_~q~0.base_670, ~n~0=v_~n~0_658, ~q~0.offset=v_~q~0.offset_670, ~s~0=v_~s~0_1283, ~q_front~0=v_~q_front~0_1347} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_872|, ~q_back~0=v_~q_back~0_1465, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_797|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_563|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_797|, ~N~0=v_~N~0_512, ~q~0.base=v_~q~0.base_670, ~q~0.offset=v_~q~0.offset_670, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_797|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_797|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_787|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_567|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_563|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_787|, #memory_int=|v_#memory_int_997|, ~n~0=v_~n~0_658, ~s~0=v_~s~0_1282, ~q_front~0=v_~q_front~0_1346} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:54:11,819 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:11,819 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:11,820 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:11,820 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:11,820 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:11,820 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:12,306 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:12,306 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:12,306 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:12,306 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:12,306 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:12,306 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:13,349 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:13,349 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:13,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_988| v_~q~0.base_662)) (.cse2 (* v_~q_front~0_1324 4))) (let ((.cse0 (select .cse1 (+ .cse2 v_~q~0.offset_662)))) (and (not (= .cse0 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_772| (ite (= (select .cse1 (+ v_~q~0.offset_662 (* v_~q_back~0_1444 4))) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_855| 0)) (not (= (ite (and (<= 0 v_~q_front~0_1324) (< v_~q_front~0_1324 v_~n~0_650) (< v_~q_front~0_1324 v_~q_back~0_1444)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_773| v_~N~0_504) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_772| 0)) (= v_~s~0_1256 (+ .cse0 v_~s~0_1258 |v_thread2Thread1of1ForFork1_~j~0#1_855|)) (= (select .cse1 (+ .cse2 v_~q~0.offset_662 4)) |v_thread2Thread1of1ForFork1_~j~0#1_855|) (not (= (ite (and (<= 0 v_~q_back~0_1444) (< v_~q_back~0_1444 v_~n~0_650)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_781| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_781|) (= v_~q_front~0_1322 (+ v_~q_front~0_1324 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_781| (ite (let ((.cse3 (+ v_~q_front~0_1324 1))) (and (< .cse3 v_~q_back~0_1443) (< .cse3 v_~n~0_650) (<= 0 .cse3))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_772| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_772|) (= |v_thread1Thread1of1ForFork0_~i~0#1_772| (+ |v_thread1Thread1of1ForFork0_~i~0#1_773| 1)) (= (+ v_~q_back~0_1444 1) v_~q_back~0_1443)))) InVars {~q_back~0=v_~q_back~0_1444, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_773|, #memory_int=|v_#memory_int_988|, ~N~0=v_~N~0_504, ~q~0.base=v_~q~0.base_662, ~n~0=v_~n~0_650, ~q~0.offset=v_~q~0.offset_662, ~s~0=v_~s~0_1258, ~q_front~0=v_~q_front~0_1324} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_855|, ~q_back~0=v_~q_back~0_1443, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_781|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_781|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_549|, ~N~0=v_~N~0_504, ~q~0.base=v_~q~0.base_662, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_781|, ~q~0.offset=v_~q~0.offset_662, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_781|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_772|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_553|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_549|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_772|, #memory_int=|v_#memory_int_988|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_772|, ~n~0=v_~n~0_650, ~s~0=v_~s~0_1256, ~q_front~0=v_~q_front~0_1322} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:54:13,780 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:13,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2806 [2022-12-06 07:54:13,781 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 1075 transitions, 37308 flow [2022-12-06 07:54:13,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:13,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:13,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:13,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:13,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-12-06 07:54:13,987 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash -334191268, now seen corresponding path program 1 times [2022-12-06 07:54:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:13,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538432276] [2022-12-06 07:54:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:14,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538432276] [2022-12-06 07:54:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538432276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85337678] [2022-12-06 07:54:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:14,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:14,344 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:14,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-06 07:54:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:14,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:54:14,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:14,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:14,673 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:54:14,673 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 27 treesize of output 16 [2022-12-06 07:54:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:14,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85337678] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:14,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:14,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 07:54:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734301385] [2022-12-06 07:54:14,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:14,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:54:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:54:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:54:14,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 78 [2022-12-06 07:54:14,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1075 transitions, 37308 flow. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 07:54:14,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:14,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 78 [2022-12-06 07:54:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:17,918 INFO L130 PetriNetUnfolder]: 3828/7156 cut-off events. [2022-12-06 07:54:17,918 INFO L131 PetriNetUnfolder]: For 374892/375161 co-relation queries the response was YES. [2022-12-06 07:54:17,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89238 conditions, 7156 events. 3828/7156 cut-off events. For 374892/375161 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 55623 event pairs, 775 based on Foata normal form. 120/7276 useless extension candidates. Maximal degree in co-relation 88554. Up to 5499 conditions per place. [2022-12-06 07:54:18,149 INFO L137 encePairwiseOnDemand]: 27/78 looper letters, 855 selfloop transitions, 334 changer transitions 3/1193 dead transitions. [2022-12-06 07:54:18,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1193 transitions, 42079 flow [2022-12-06 07:54:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:54:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:54:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2022-12-06 07:54:18,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1794871794871795 [2022-12-06 07:54:18,150 INFO L175 Difference]: Start difference. First operand has 340 places, 1075 transitions, 37308 flow. Second operand 10 states and 140 transitions. [2022-12-06 07:54:18,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 1193 transitions, 42079 flow [2022-12-06 07:54:20,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1193 transitions, 41841 flow, removed 81 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:20,178 INFO L231 Difference]: Finished difference. Result has 346 places, 1088 transitions, 38421 flow [2022-12-06 07:54:20,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=37076, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=38421, PETRI_PLACES=346, PETRI_TRANSITIONS=1088} [2022-12-06 07:54:20,179 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 325 predicate places. [2022-12-06 07:54:20,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:20,179 INFO L89 Accepts]: Start accepts. Operand has 346 places, 1088 transitions, 38421 flow [2022-12-06 07:54:20,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:20,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:20,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 346 places, 1088 transitions, 38421 flow [2022-12-06 07:54:20,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 1088 transitions, 38421 flow [2022-12-06 07:54:20,973 INFO L130 PetriNetUnfolder]: 1000/3027 cut-off events. [2022-12-06 07:54:20,973 INFO L131 PetriNetUnfolder]: For 168576/170253 co-relation queries the response was YES. [2022-12-06 07:54:20,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34343 conditions, 3027 events. 1000/3027 cut-off events. For 168576/170253 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 29919 event pairs, 20 based on Foata normal form. 351/3372 useless extension candidates. Maximal degree in co-relation 34118. Up to 1058 conditions per place. [2022-12-06 07:54:21,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 1088 transitions, 38421 flow [2022-12-06 07:54:21,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 3622 [2022-12-06 07:54:21,027 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:21,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 849 [2022-12-06 07:54:21,028 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 1088 transitions, 38421 flow [2022-12-06 07:54:21,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 07:54:21,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:21,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:21,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:21,233 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1987593659, now seen corresponding path program 1 times [2022-12-06 07:54:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144812347] [2022-12-06 07:54:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:22,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144812347] [2022-12-06 07:54:22,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144812347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:22,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528463808] [2022-12-06 07:54:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:22,667 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:22,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-12-06 07:54:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:22,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:54:22,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:23,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:23,034 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 92 treesize of output 20 [2022-12-06 07:54:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:23,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:23,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:23,189 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 139 treesize of output 250 [2022-12-06 07:54:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:23,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528463808] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:23,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:23,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 07:54:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274647233] [2022-12-06 07:54:23,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:23,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:54:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:54:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:54:23,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 07:54:23,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 1088 transitions, 38421 flow. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 07:54:23,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:23,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 07:54:23,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:26,879 INFO L130 PetriNetUnfolder]: 3838/7190 cut-off events. [2022-12-06 07:54:26,880 INFO L131 PetriNetUnfolder]: For 376138/376439 co-relation queries the response was YES. [2022-12-06 07:54:26,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90691 conditions, 7190 events. 3838/7190 cut-off events. For 376138/376439 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 55899 event pairs, 914 based on Foata normal form. 98/7288 useless extension candidates. Maximal degree in co-relation 90120. Up to 6917 conditions per place. [2022-12-06 07:54:26,979 INFO L137 encePairwiseOnDemand]: 28/77 looper letters, 1002 selfloop transitions, 113 changer transitions 7/1123 dead transitions. [2022-12-06 07:54:26,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1123 transitions, 41079 flow [2022-12-06 07:54:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:54:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:54:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-12-06 07:54:26,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15702479338842976 [2022-12-06 07:54:26,980 INFO L175 Difference]: Start difference. First operand has 345 places, 1088 transitions, 38421 flow. Second operand 11 states and 133 transitions. [2022-12-06 07:54:26,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1123 transitions, 41079 flow [2022-12-06 07:54:29,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1123 transitions, 40650 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-12-06 07:54:29,751 INFO L231 Difference]: Finished difference. Result has 352 places, 1091 transitions, 38322 flow [2022-12-06 07:54:29,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=37992, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=38322, PETRI_PLACES=352, PETRI_TRANSITIONS=1091} [2022-12-06 07:54:29,752 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 331 predicate places. [2022-12-06 07:54:29,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:29,752 INFO L89 Accepts]: Start accepts. Operand has 352 places, 1091 transitions, 38322 flow [2022-12-06 07:54:29,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:29,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:29,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 352 places, 1091 transitions, 38322 flow [2022-12-06 07:54:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 1091 transitions, 38322 flow [2022-12-06 07:54:30,579 INFO L130 PetriNetUnfolder]: 999/3036 cut-off events. [2022-12-06 07:54:30,579 INFO L131 PetriNetUnfolder]: For 170160/171750 co-relation queries the response was YES. [2022-12-06 07:54:30,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34386 conditions, 3036 events. 999/3036 cut-off events. For 170160/171750 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 30039 event pairs, 22 based on Foata normal form. 357/3388 useless extension candidates. Maximal degree in co-relation 33983. Up to 1060 conditions per place. [2022-12-06 07:54:30,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 1091 transitions, 38322 flow [2022-12-06 07:54:30,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 3626 [2022-12-06 07:54:30,641 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:30,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 889 [2022-12-06 07:54:30,641 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1091 transitions, 38322 flow [2022-12-06 07:54:30,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 07:54:30,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:30,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:30,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:30,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-12-06 07:54:30,847 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:30,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash -414254352, now seen corresponding path program 1 times [2022-12-06 07:54:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:30,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541934219] [2022-12-06 07:54:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:31,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541934219] [2022-12-06 07:54:31,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541934219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:31,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485157917] [2022-12-06 07:54:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:31,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:31,509 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:31,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-12-06 07:54:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:31,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:54:31,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:31,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:31,906 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 90 treesize of output 20 [2022-12-06 07:54:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:31,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:32,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:32,045 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 141 treesize of output 252 [2022-12-06 07:54:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:32,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485157917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:32,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:32,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:54:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90966561] [2022-12-06 07:54:32,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:32,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:54:32,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:54:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:54:32,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 07:54:32,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1091 transitions, 38322 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:32,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:32,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 07:54:32,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:35,758 INFO L130 PetriNetUnfolder]: 3830/7169 cut-off events. [2022-12-06 07:54:35,758 INFO L131 PetriNetUnfolder]: For 374045/374354 co-relation queries the response was YES. [2022-12-06 07:54:35,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90031 conditions, 7169 events. 3830/7169 cut-off events. For 374045/374354 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 56005 event pairs, 945 based on Foata normal form. 102/7271 useless extension candidates. Maximal degree in co-relation 89353. Up to 6960 conditions per place. [2022-12-06 07:54:35,851 INFO L137 encePairwiseOnDemand]: 30/77 looper letters, 999 selfloop transitions, 92 changer transitions 23/1115 dead transitions. [2022-12-06 07:54:35,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1115 transitions, 40736 flow [2022-12-06 07:54:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:54:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:54:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2022-12-06 07:54:35,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-06 07:54:35,852 INFO L175 Difference]: Start difference. First operand has 351 places, 1091 transitions, 38322 flow. Second operand 10 states and 126 transitions. [2022-12-06 07:54:35,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1115 transitions, 40736 flow [2022-12-06 07:54:38,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1115 transitions, 40466 flow, removed 39 selfloop flow, removed 6 redundant places. [2022-12-06 07:54:38,616 INFO L231 Difference]: Finished difference. Result has 351 places, 1083 transitions, 38072 flow [2022-12-06 07:54:38,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=38024, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=38072, PETRI_PLACES=351, PETRI_TRANSITIONS=1083} [2022-12-06 07:54:38,617 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 330 predicate places. [2022-12-06 07:54:38,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:38,617 INFO L89 Accepts]: Start accepts. Operand has 351 places, 1083 transitions, 38072 flow [2022-12-06 07:54:38,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:38,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:38,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 1083 transitions, 38072 flow [2022-12-06 07:54:38,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 1083 transitions, 38072 flow [2022-12-06 07:54:39,373 INFO L130 PetriNetUnfolder]: 995/3001 cut-off events. [2022-12-06 07:54:39,373 INFO L131 PetriNetUnfolder]: For 168941/170566 co-relation queries the response was YES. [2022-12-06 07:54:39,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33984 conditions, 3001 events. 995/3001 cut-off events. For 168941/170566 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 29558 event pairs, 18 based on Foata normal form. 350/3346 useless extension candidates. Maximal degree in co-relation 33581. Up to 1050 conditions per place. [2022-12-06 07:54:39,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 347 places, 1083 transitions, 38072 flow [2022-12-06 07:54:39,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 3600 [2022-12-06 07:54:39,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:54:39,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:54:39,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:39,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1005 [2022-12-06 07:54:39,622 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 1082 transitions, 38067 flow [2022-12-06 07:54:39,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:39,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:39,623 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:39,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-12-06 07:54:39,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-12-06 07:54:39,828 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:39,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1969742842, now seen corresponding path program 2 times [2022-12-06 07:54:39,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:39,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473915984] [2022-12-06 07:54:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:40,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473915984] [2022-12-06 07:54:40,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473915984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:40,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573355909] [2022-12-06 07:54:40,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:54:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:40,469 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:40,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-12-06 07:54:40,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:54:40,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:54:40,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:54:40,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:40,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:40,946 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 92 treesize of output 20 [2022-12-06 07:54:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:40,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:41,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:41,077 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 139 treesize of output 250 [2022-12-06 07:54:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:41,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573355909] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:41,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:41,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:54:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676982018] [2022-12-06 07:54:41,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:41,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:41,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:41,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:41,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:54:41,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 79 [2022-12-06 07:54:41,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1082 transitions, 38067 flow. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:41,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:41,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 79 [2022-12-06 07:54:41,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:44,815 INFO L130 PetriNetUnfolder]: 3815/7134 cut-off events. [2022-12-06 07:54:44,816 INFO L131 PetriNetUnfolder]: For 376060/376297 co-relation queries the response was YES. [2022-12-06 07:54:44,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89531 conditions, 7134 events. 3815/7134 cut-off events. For 376060/376297 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 55400 event pairs, 1274 based on Foata normal form. 43/7177 useless extension candidates. Maximal degree in co-relation 88789. Up to 6974 conditions per place. [2022-12-06 07:54:44,918 INFO L137 encePairwiseOnDemand]: 37/79 looper letters, 1025 selfloop transitions, 56 changer transitions 33/1115 dead transitions. [2022-12-06 07:54:44,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1115 transitions, 40679 flow [2022-12-06 07:54:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:54:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:54:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-12-06 07:54:44,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1620253164556962 [2022-12-06 07:54:44,920 INFO L175 Difference]: Start difference. First operand has 346 places, 1082 transitions, 38067 flow. Second operand 10 states and 128 transitions. [2022-12-06 07:54:44,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1115 transitions, 40679 flow [2022-12-06 07:54:47,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1115 transitions, 40429 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:47,371 INFO L231 Difference]: Finished difference. Result has 354 places, 1076 transitions, 37683 flow [2022-12-06 07:54:47,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=37817, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1082, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=37683, PETRI_PLACES=354, PETRI_TRANSITIONS=1076} [2022-12-06 07:54:47,372 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 333 predicate places. [2022-12-06 07:54:47,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:47,372 INFO L89 Accepts]: Start accepts. Operand has 354 places, 1076 transitions, 37683 flow [2022-12-06 07:54:47,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:47,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:47,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 1076 transitions, 37683 flow [2022-12-06 07:54:47,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 348 places, 1076 transitions, 37683 flow [2022-12-06 07:54:48,230 INFO L130 PetriNetUnfolder]: 992/2984 cut-off events. [2022-12-06 07:54:48,230 INFO L131 PetriNetUnfolder]: For 164702/166423 co-relation queries the response was YES. [2022-12-06 07:54:48,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33718 conditions, 2984 events. 992/2984 cut-off events. For 164702/166423 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 29308 event pairs, 17 based on Foata normal form. 340/3318 useless extension candidates. Maximal degree in co-relation 33551. Up to 1033 conditions per place. [2022-12-06 07:54:48,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 348 places, 1076 transitions, 37683 flow [2022-12-06 07:54:48,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 3562 [2022-12-06 07:54:48,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [845] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (+ v_~q_front~0_1128 1)) (.cse2 (* v_~q_back~0_1283 4)) (.cse1 (select |v_#memory_int_880| v_~q~0.base_601))) (and (= v_~q_front~0_1127 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_673| (+ v_~N~0_466 1)) (not (= 0 (ite (and (<= 1 v_~q_back~0_1281) (< v_~q_back~0_1281 (+ v_~n~0_592 1))) 1 0))) (= (+ v_~q_back~0_1283 4) v_~q_back~0_1281) (not (= (ite (and (<= 0 v_~q_back~0_1283) (< v_~q_back~0_1283 v_~n~0_592)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_645| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_645|) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_601 4 .cse2)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672| 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_601 .cse2)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_673| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_645| (ite (and (< .cse0 v_~q_back~0_1281) (<= 0 v_~q_front~0_1128) (< v_~q_front~0_1128 v_~n~0_592)) 1 0)) (= (+ v_~s~0_1056 |v_thread2Thread1of1ForFork1_~j~0#1_705|) v_~s~0_1055) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_705| 0)) (= (select .cse1 (+ (* v_~q_front~0_1128 4) v_~q~0.offset_601)) |v_thread2Thread1of1ForFork1_~j~0#1_705|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672|) (not (= 0 (ite (= 1 (select .cse1 (+ 8 v_~q~0.offset_601 .cse2))) 1 0))) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1281 4) (- 4) v_~q~0.offset_601)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_645| 0)))) InVars {~q_back~0=v_~q_back~0_1283, #memory_int=|v_#memory_int_880|, ~N~0=v_~N~0_466, ~q~0.base=v_~q~0.base_601, ~n~0=v_~n~0_592, ~q~0.offset=v_~q~0.offset_601, ~s~0=v_~s~0_1056, ~q_front~0=v_~q_front~0_1128} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_705|, ~q_back~0=v_~q_back~0_1281, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_645|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_476|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_645|, ~N~0=v_~N~0_466, ~q~0.base=v_~q~0.base_601, ~q~0.offset=v_~q~0.offset_601, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_645|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_645|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_480|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_476|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_673|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672|, #memory_int=|v_#memory_int_880|, ~n~0=v_~n~0_592, ~s~0=v_~s~0_1055, ~q_front~0=v_~q_front~0_1127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:54:48,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:48,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1331 [2022-12-06 07:54:48,703 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 1076 transitions, 37706 flow [2022-12-06 07:54:48,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:48,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:48,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:48,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-12-06 07:54:48,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:48,911 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1537291848, now seen corresponding path program 1 times [2022-12-06 07:54:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:48,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878967704] [2022-12-06 07:54:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878967704] [2022-12-06 07:54:49,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878967704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990596155] [2022-12-06 07:54:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:49,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:49,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:49,371 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:49,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-12-06 07:54:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:49,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:54:49,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:49,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:49,728 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:54:49,728 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 27 treesize of output 18 [2022-12-06 07:54:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:49,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990596155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:49,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 07:54:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112781603] [2022-12-06 07:54:49,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:49,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:54:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:49,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:54:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:54:49,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 78 [2022-12-06 07:54:49,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 1076 transitions, 37706 flow. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 07:54:49,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:49,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 78 [2022-12-06 07:54:49,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:53,721 INFO L130 PetriNetUnfolder]: 3974/7383 cut-off events. [2022-12-06 07:54:53,721 INFO L131 PetriNetUnfolder]: For 423845/424054 co-relation queries the response was YES. [2022-12-06 07:54:53,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93353 conditions, 7383 events. 3974/7383 cut-off events. For 423845/424054 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 57546 event pairs, 570 based on Foata normal form. 181/7564 useless extension candidates. Maximal degree in co-relation 92607. Up to 5399 conditions per place. [2022-12-06 07:54:53,806 INFO L137 encePairwiseOnDemand]: 18/78 looper letters, 856 selfloop transitions, 422 changer transitions 2/1281 dead transitions. [2022-12-06 07:54:53,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1281 transitions, 44970 flow [2022-12-06 07:54:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 07:54:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 07:54:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 201 transitions. [2022-12-06 07:54:53,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1227106227106227 [2022-12-06 07:54:53,814 INFO L175 Difference]: Start difference. First operand has 348 places, 1076 transitions, 37706 flow. Second operand 21 states and 201 transitions. [2022-12-06 07:54:53,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 1281 transitions, 44970 flow [2022-12-06 07:54:56,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1281 transitions, 44814 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-06 07:54:56,288 INFO L231 Difference]: Finished difference. Result has 365 places, 1134 transitions, 41219 flow [2022-12-06 07:54:56,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=37554, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=41219, PETRI_PLACES=365, PETRI_TRANSITIONS=1134} [2022-12-06 07:54:56,288 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 344 predicate places. [2022-12-06 07:54:56,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:56,289 INFO L89 Accepts]: Start accepts. Operand has 365 places, 1134 transitions, 41219 flow [2022-12-06 07:54:56,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:56,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:56,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 1134 transitions, 41219 flow [2022-12-06 07:54:56,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 365 places, 1134 transitions, 41219 flow [2022-12-06 07:54:57,231 INFO L130 PetriNetUnfolder]: 1046/3116 cut-off events. [2022-12-06 07:54:57,231 INFO L131 PetriNetUnfolder]: For 186868/188588 co-relation queries the response was YES. [2022-12-06 07:54:57,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36525 conditions, 3116 events. 1046/3116 cut-off events. For 186868/188588 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 30795 event pairs, 17 based on Foata normal form. 345/3454 useless extension candidates. Maximal degree in co-relation 36114. Up to 1094 conditions per place. [2022-12-06 07:54:57,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 1134 transitions, 41219 flow [2022-12-06 07:54:57,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 3758 [2022-12-06 07:54:57,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [907] L65-2-->L47-4: Formula: (let ((.cse4 (select |v_#memory_int_1009| v_~q~0.base_680)) (.cse6 (* v_~q_front~0_1376 4))) (let ((.cse1 (select .cse4 (+ v_~q~0.offset_680 .cse6))) (.cse0 (< v_~q_front~0_1376 v_~q_back~0_1497)) (.cse5 (* v_~q_back~0_1497 4))) (and (= (+ 2 v_~q_back~0_1497) v_~q_back~0_1495) (not (= (ite (and .cse0 (< v_~q_front~0_1376 v_~n~0_668) (<= 0 v_~q_front~0_1376)) 1 0) 0)) (= (+ .cse1 v_~s~0_1313 |v_thread2Thread1of1ForFork1_~j~0#1_891|) v_~s~0_1312) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_807| 0)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1497 1))) (and (< .cse2 v_~n~0_668) (<= 0 .cse2))) 1 0) 0)) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_815| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_815|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_815| (ite (let ((.cse3 (+ v_~q_front~0_1376 1))) (and .cse0 (< .cse3 v_~n~0_668) (<= 0 .cse3))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_812| (+ |v_thread1Thread1of1ForFork0_~i~0#1_814| 2)) (= v_~q_front~0_1375 (+ v_~q_front~0_1376 2)) (not (= (ite (= (select .cse4 (+ .cse5 v_~q~0.offset_680)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_812| (+ v_~N~0_522 1)) (= (ite (= (select .cse4 (+ .cse5 v_~q~0.offset_680 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_807|) (= (select .cse4 (+ v_~q~0.offset_680 4 .cse6)) |v_thread2Thread1of1ForFork1_~j~0#1_891|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_807| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_807|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_891| 0))))) InVars {~q_back~0=v_~q_back~0_1497, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_814|, #memory_int=|v_#memory_int_1009|, ~N~0=v_~N~0_522, ~q~0.base=v_~q~0.base_680, ~n~0=v_~n~0_668, ~q~0.offset=v_~q~0.offset_680, ~s~0=v_~s~0_1313, ~q_front~0=v_~q_front~0_1376} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_891|, ~q_back~0=v_~q_back~0_1495, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_815|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_580|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_815|, ~N~0=v_~N~0_522, ~q~0.base=v_~q~0.base_680, ~q~0.offset=v_~q~0.offset_680, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_815|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_815|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_807|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_584|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_580|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_812|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_807|, #memory_int=|v_#memory_int_1009|, ~n~0=v_~n~0_668, ~s~0=v_~s~0_1312, ~q_front~0=v_~q_front~0_1375} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:54:57,304 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:57,304 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:57,304 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:57,304 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:57,304 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:57,304 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,056 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,056 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,056 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,056 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,056 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,056 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,400 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,400 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,400 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:58,400 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [910] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1019| v_~q~0.base_686))) (let ((.cse1 (* v_~q_back~0_1518 4)) (.cse3 (+ v_~n~0_674 1)) (.cse2 (select .cse0 (+ (* v_~q_front~0_1410 4) v_~q~0.offset_686)))) (and (not (= (ite (and (< v_~q_front~0_1410 v_~n~0_674) (<= 0 v_~q_front~0_1410) (< (+ v_~q_front~0_1410 1) v_~q_back~0_1517)) 1 0) 0)) (= (+ v_~q_front~0_1410 2) v_~q_front~0_1408) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_825| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_825|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_918| 0)) (= (select .cse0 (+ (* v_~q_front~0_1408 4) (- 4) v_~q~0.offset_686)) |v_thread2Thread1of1ForFork1_~j~0#1_918|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_686)) 1) 1 0) 0)) (not (= .cse2 0)) (= (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1517 4) v_~q~0.offset_686)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_825|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_825| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_838| (ite (and (< v_~q_front~0_1408 (+ v_~q_back~0_1517 1)) (< v_~q_front~0_1408 .cse3) (<= 1 v_~q_front~0_1408)) 1 0)) (not (= (ite (and (< v_~q_back~0_1518 v_~n~0_674) (<= 0 v_~q_back~0_1518)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_686 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_838| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_838|) (= |v_thread1Thread1of1ForFork0_~i~0#1_834| 4) (< |v_thread1Thread1of1ForFork0_~i~0#1_834| (+ v_~N~0_528 1)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_686)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1517 .cse3) (<= 1 v_~q_back~0_1517)) 1 0) 0)) (= (+ v_~q_back~0_1518 4) v_~q_back~0_1517) (= (+ .cse2 v_~s~0_1349 |v_thread2Thread1of1ForFork1_~j~0#1_918|) v_~s~0_1347)))) InVars {~q_back~0=v_~q_back~0_1518, #memory_int=|v_#memory_int_1019|, ~N~0=v_~N~0_528, ~q~0.base=v_~q~0.base_686, ~n~0=v_~n~0_674, ~q~0.offset=v_~q~0.offset_686, ~s~0=v_~s~0_1349, ~q_front~0=v_~q_front~0_1410} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_918|, ~q_back~0=v_~q_back~0_1517, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_838|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_838|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_596|, ~N~0=v_~N~0_528, ~q~0.base=v_~q~0.base_686, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_838|, ~q~0.offset=v_~q~0.offset_686, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_838|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_825|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_600|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_596|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_834|, #memory_int=|v_#memory_int_1019|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_825|, ~n~0=v_~n~0_674, ~s~0=v_~s~0_1347, ~q_front~0=v_~q_front~0_1408} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:54:59,381 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,381 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,381 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,381 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,381 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,381 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:54:59,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [910] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1019| v_~q~0.base_686))) (let ((.cse1 (* v_~q_back~0_1518 4)) (.cse3 (+ v_~n~0_674 1)) (.cse2 (select .cse0 (+ (* v_~q_front~0_1410 4) v_~q~0.offset_686)))) (and (not (= (ite (and (< v_~q_front~0_1410 v_~n~0_674) (<= 0 v_~q_front~0_1410) (< (+ v_~q_front~0_1410 1) v_~q_back~0_1517)) 1 0) 0)) (= (+ v_~q_front~0_1410 2) v_~q_front~0_1408) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_825| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_825|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_918| 0)) (= (select .cse0 (+ (* v_~q_front~0_1408 4) (- 4) v_~q~0.offset_686)) |v_thread2Thread1of1ForFork1_~j~0#1_918|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_686)) 1) 1 0) 0)) (not (= .cse2 0)) (= (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1517 4) v_~q~0.offset_686)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_825|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_825| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_838| (ite (and (< v_~q_front~0_1408 (+ v_~q_back~0_1517 1)) (< v_~q_front~0_1408 .cse3) (<= 1 v_~q_front~0_1408)) 1 0)) (not (= (ite (and (< v_~q_back~0_1518 v_~n~0_674) (<= 0 v_~q_back~0_1518)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_686 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_838| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_838|) (= |v_thread1Thread1of1ForFork0_~i~0#1_834| 4) (< |v_thread1Thread1of1ForFork0_~i~0#1_834| (+ v_~N~0_528 1)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_686)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1517 .cse3) (<= 1 v_~q_back~0_1517)) 1 0) 0)) (= (+ v_~q_back~0_1518 4) v_~q_back~0_1517) (= (+ .cse2 v_~s~0_1349 |v_thread2Thread1of1ForFork1_~j~0#1_918|) v_~s~0_1347)))) InVars {~q_back~0=v_~q_back~0_1518, #memory_int=|v_#memory_int_1019|, ~N~0=v_~N~0_528, ~q~0.base=v_~q~0.base_686, ~n~0=v_~n~0_674, ~q~0.offset=v_~q~0.offset_686, ~s~0=v_~s~0_1349, ~q_front~0=v_~q_front~0_1410} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_918|, ~q_back~0=v_~q_back~0_1517, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_838|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_838|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_596|, ~N~0=v_~N~0_528, ~q~0.base=v_~q~0.base_686, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_838|, ~q~0.offset=v_~q~0.offset_686, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_838|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_825|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_600|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_596|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_834|, #memory_int=|v_#memory_int_1019|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_825|, ~n~0=v_~n~0_674, ~s~0=v_~s~0_1347, ~q_front~0=v_~q_front~0_1408} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:55:00,499 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:00,499 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:00,499 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:00,499 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:00,499 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:00,499 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:00,829 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:55:00,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4542 [2022-12-06 07:55:00,830 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 1134 transitions, 41463 flow [2022-12-06 07:55:00,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 07:55:00,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:00,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:00,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:01,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:01,030 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash -168757320, now seen corresponding path program 2 times [2022-12-06 07:55:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:01,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591941106] [2022-12-06 07:55:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:01,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591941106] [2022-12-06 07:55:01,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591941106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:01,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770385495] [2022-12-06 07:55:01,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:55:01,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:01,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:01,860 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:01,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-12-06 07:55:02,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:55:02,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:55:02,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:55:02,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:02,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:02,259 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 30 treesize of output 30 [2022-12-06 07:55:02,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:02,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 07:55:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:02,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:02,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:02,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 264 [2022-12-06 07:55:02,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:02,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 128 treesize of output 115 [2022-12-06 07:55:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770385495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:03,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:55:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204824172] [2022-12-06 07:55:03,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:03,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:55:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:55:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:55:03,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-06 07:55:03,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 1134 transitions, 41463 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:55:03,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:03,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-06 07:55:03,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:07,251 INFO L130 PetriNetUnfolder]: 3980/7393 cut-off events. [2022-12-06 07:55:07,251 INFO L131 PetriNetUnfolder]: For 421674/421876 co-relation queries the response was YES. [2022-12-06 07:55:07,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96455 conditions, 7393 events. 3980/7393 cut-off events. For 421674/421876 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 57552 event pairs, 952 based on Foata normal form. 100/7493 useless extension candidates. Maximal degree in co-relation 95756. Up to 7210 conditions per place. [2022-12-06 07:55:07,352 INFO L137 encePairwiseOnDemand]: 33/86 looper letters, 1053 selfloop transitions, 80 changer transitions 27/1161 dead transitions. [2022-12-06 07:55:07,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1161 transitions, 44019 flow [2022-12-06 07:55:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:55:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:55:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-12-06 07:55:07,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13275193798449614 [2022-12-06 07:55:07,353 INFO L175 Difference]: Start difference. First operand has 365 places, 1134 transitions, 41463 flow. Second operand 12 states and 137 transitions. [2022-12-06 07:55:07,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1161 transitions, 44019 flow [2022-12-06 07:55:10,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1161 transitions, 42447 flow, removed 720 selfloop flow, removed 9 redundant places. [2022-12-06 07:55:10,363 INFO L231 Difference]: Finished difference. Result has 368 places, 1126 transitions, 39792 flow [2022-12-06 07:55:10,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=39886, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=39792, PETRI_PLACES=368, PETRI_TRANSITIONS=1126} [2022-12-06 07:55:10,364 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 347 predicate places. [2022-12-06 07:55:10,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:10,364 INFO L89 Accepts]: Start accepts. Operand has 368 places, 1126 transitions, 39792 flow [2022-12-06 07:55:10,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:10,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:10,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 368 places, 1126 transitions, 39792 flow [2022-12-06 07:55:10,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 358 places, 1126 transitions, 39792 flow [2022-12-06 07:55:11,216 INFO L130 PetriNetUnfolder]: 1044/3096 cut-off events. [2022-12-06 07:55:11,216 INFO L131 PetriNetUnfolder]: For 183427/185261 co-relation queries the response was YES. [2022-12-06 07:55:11,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35638 conditions, 3096 events. 1044/3096 cut-off events. For 183427/185261 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 30404 event pairs, 14 based on Foata normal form. 347/3437 useless extension candidates. Maximal degree in co-relation 35235. Up to 1094 conditions per place. [2022-12-06 07:55:11,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 358 places, 1126 transitions, 39792 flow [2022-12-06 07:55:11,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 3736 [2022-12-06 07:55:11,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [906] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1007| v_~q~0.base_678)) (.cse3 (* v_~q_front~0_1371 4))) (let ((.cse2 (select .cse1 (+ v_~q~0.offset_678 .cse3 4))) (.cse0 (select .cse1 (+ v_~q~0.offset_678 .cse3)))) (and (not (= .cse0 0)) (= (+ v_~q_back~0_1492 1) v_~q_back~0_1491) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_805| 0)) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1492 4) v_~q~0.offset_678)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_805|) (< |v_thread1Thread1of1ForFork0_~i~0#1_809| v_~N~0_520) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_809| 1) |v_thread1Thread1of1ForFork0_~i~0#1_808|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_805| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_805|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_811| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_811|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_887| 0)) (= (select .cse1 (+ (* v_~q_front~0_1369 4) (- 4) v_~q~0.offset_678)) |v_thread2Thread1of1ForFork1_~j~0#1_887|) (not (= (ite (and (< v_~q_back~0_1492 v_~n~0_666) (<= 0 v_~q_back~0_1492)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_811| 0)) (= v_~q_front~0_1369 (+ v_~q_front~0_1371 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_811| (ite (and (< v_~q_front~0_1369 (+ v_~n~0_666 1)) (< v_~q_front~0_1369 (+ v_~q_back~0_1491 1)) (<= 1 v_~q_front~0_1369)) 1 0)) (not (= .cse2 0)) (= (+ .cse2 v_~s~0_1308 |v_thread2Thread1of1ForFork1_~j~0#1_887| .cse0) v_~s~0_1306) (not (= (ite (and (< v_~q_front~0_1371 v_~n~0_666) (< v_~q_front~0_1371 v_~q_back~0_1492) (<= 0 v_~q_front~0_1371)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1492, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_809|, #memory_int=|v_#memory_int_1007|, ~N~0=v_~N~0_520, ~q~0.base=v_~q~0.base_678, ~n~0=v_~n~0_666, ~q~0.offset=v_~q~0.offset_678, ~s~0=v_~s~0_1308, ~q_front~0=v_~q_front~0_1371} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_887|, ~q_back~0=v_~q_back~0_1491, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_811|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_811|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_578|, ~N~0=v_~N~0_520, ~q~0.base=v_~q~0.base_678, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_811|, ~q~0.offset=v_~q~0.offset_678, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_811|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_805|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_582|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_578|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_808|, #memory_int=|v_#memory_int_1007|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_805|, ~n~0=v_~n~0_666, ~s~0=v_~s~0_1306, ~q_front~0=v_~q_front~0_1369} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:55:11,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:11,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1301 [2022-12-06 07:55:11,665 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 1125 transitions, 39782 flow [2022-12-06 07:55:11,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 07:55:11,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:11,665 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:11,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:11,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-12-06 07:55:11,871 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1313333252, now seen corresponding path program 1 times [2022-12-06 07:55:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:11,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111025236] [2022-12-06 07:55:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:12,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111025236] [2022-12-06 07:55:12,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111025236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113601089] [2022-12-06 07:55:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:12,757 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:12,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-12-06 07:55:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:13,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 07:55:13,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:13,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:13,077 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 31 treesize of output 31 [2022-12-06 07:55:13,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:13,202 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 90 treesize of output 20 [2022-12-06 07:55:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:13,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:13,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:13,390 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 271 treesize of output 382 [2022-12-06 07:55:13,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:13,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:55:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:15,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113601089] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:15,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:15,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:55:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873022565] [2022-12-06 07:55:15,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:55:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:55:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:55:15,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 82 [2022-12-06 07:55:15,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1125 transitions, 39782 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:55:15,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:15,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 82 [2022-12-06 07:55:15,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:19,273 INFO L130 PetriNetUnfolder]: 3963/7351 cut-off events. [2022-12-06 07:55:19,273 INFO L131 PetriNetUnfolder]: For 409496/409712 co-relation queries the response was YES. [2022-12-06 07:55:19,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93602 conditions, 7351 events. 3963/7351 cut-off events. For 409496/409712 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 57005 event pairs, 1314 based on Foata normal form. 40/7391 useless extension candidates. Maximal degree in co-relation 92850. Up to 7239 conditions per place. [2022-12-06 07:55:19,356 INFO L137 encePairwiseOnDemand]: 39/82 looper letters, 1082 selfloop transitions, 46 changer transitions 15/1144 dead transitions. [2022-12-06 07:55:19,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1144 transitions, 42243 flow [2022-12-06 07:55:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:55:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:55:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 07:55:19,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17378048780487804 [2022-12-06 07:55:19,357 INFO L175 Difference]: Start difference. First operand has 357 places, 1125 transitions, 39782 flow. Second operand 8 states and 114 transitions. [2022-12-06 07:55:19,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1144 transitions, 42243 flow [2022-12-06 07:55:22,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1144 transitions, 41881 flow, removed 20 selfloop flow, removed 13 redundant places. [2022-12-06 07:55:22,040 INFO L231 Difference]: Finished difference. Result has 353 places, 1123 transitions, 39448 flow [2022-12-06 07:55:22,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=39420, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1079, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=39448, PETRI_PLACES=353, PETRI_TRANSITIONS=1123} [2022-12-06 07:55:22,041 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 332 predicate places. [2022-12-06 07:55:22,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:22,041 INFO L89 Accepts]: Start accepts. Operand has 353 places, 1123 transitions, 39448 flow [2022-12-06 07:55:22,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:22,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:22,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 1123 transitions, 39448 flow [2022-12-06 07:55:22,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 1123 transitions, 39448 flow [2022-12-06 07:55:23,000 INFO L130 PetriNetUnfolder]: 1043/3092 cut-off events. [2022-12-06 07:55:23,000 INFO L131 PetriNetUnfolder]: For 179141/180672 co-relation queries the response was YES. [2022-12-06 07:55:23,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35111 conditions, 3092 events. 1043/3092 cut-off events. For 179141/180672 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 30421 event pairs, 16 based on Foata normal form. 352/3438 useless extension candidates. Maximal degree in co-relation 34967. Up to 1092 conditions per place. [2022-12-06 07:55:23,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 1123 transitions, 39448 flow [2022-12-06 07:55:23,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 3722 [2022-12-06 07:55:23,061 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:23,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1021 [2022-12-06 07:55:23,062 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 1123 transitions, 39448 flow [2022-12-06 07:55:23,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:55:23,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:23,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:23,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-12-06 07:55:23,268 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash -500459083, now seen corresponding path program 1 times [2022-12-06 07:55:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773541937] [2022-12-06 07:55:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:23,315 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 07:55:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773541937] [2022-12-06 07:55:23,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773541937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:23,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:23,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:55:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867472808] [2022-12-06 07:55:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:23,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:55:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:55:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:55:23,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 81 [2022-12-06 07:55:23,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 1123 transitions, 39448 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:23,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:23,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 81 [2022-12-06 07:55:23,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:27,239 INFO L130 PetriNetUnfolder]: 4680/8827 cut-off events. [2022-12-06 07:55:27,239 INFO L131 PetriNetUnfolder]: For 499371/499549 co-relation queries the response was YES. [2022-12-06 07:55:27,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112331 conditions, 8827 events. 4680/8827 cut-off events. For 499371/499549 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 71541 event pairs, 1675 based on Foata normal form. 65/8892 useless extension candidates. Maximal degree in co-relation 111572. Up to 5083 conditions per place. [2022-12-06 07:55:27,357 INFO L137 encePairwiseOnDemand]: 73/81 looper letters, 1336 selfloop transitions, 4 changer transitions 2/1343 dead transitions. [2022-12-06 07:55:27,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1343 transitions, 49749 flow [2022-12-06 07:55:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:55:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:55:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-06 07:55:27,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33024691358024694 [2022-12-06 07:55:27,358 INFO L175 Difference]: Start difference. First operand has 350 places, 1123 transitions, 39448 flow. Second operand 4 states and 107 transitions. [2022-12-06 07:55:27,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1343 transitions, 49749 flow [2022-12-06 07:55:30,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1343 transitions, 49641 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 07:55:30,654 INFO L231 Difference]: Finished difference. Result has 347 places, 1116 transitions, 39090 flow [2022-12-06 07:55:30,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=39184, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=39090, PETRI_PLACES=347, PETRI_TRANSITIONS=1116} [2022-12-06 07:55:30,655 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 326 predicate places. [2022-12-06 07:55:30,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:30,655 INFO L89 Accepts]: Start accepts. Operand has 347 places, 1116 transitions, 39090 flow [2022-12-06 07:55:30,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:30,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:30,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 347 places, 1116 transitions, 39090 flow [2022-12-06 07:55:30,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 1116 transitions, 39090 flow [2022-12-06 07:55:31,695 INFO L130 PetriNetUnfolder]: 1216/3728 cut-off events. [2022-12-06 07:55:31,696 INFO L131 PetriNetUnfolder]: For 226816/229260 co-relation queries the response was YES. [2022-12-06 07:55:31,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42531 conditions, 3728 events. 1216/3728 cut-off events. For 226816/229260 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 38533 event pairs, 28 based on Foata normal form. 417/4133 useless extension candidates. Maximal degree in co-relation 42056. Up to 1350 conditions per place. [2022-12-06 07:55:31,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 347 places, 1116 transitions, 39090 flow [2022-12-06 07:55:31,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 3700 [2022-12-06 07:55:31,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L92-2: Formula: (let ((.cse1 (store |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_467| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_104| 1))) (and (= (select |v_#valid_123| 2) 1) (= 5 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_84|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_56| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_78|) (= (select .cse0 0) 48) (= |v_#NULL.offset_26| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_126| (ite (<= 0 v_~N~0_236) 1 0)) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_304| 2147483647) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| 0)) (< |v_#StackHeapBarrier_61| |v_ULTIMATE.start_main_~#t2~0#1.base_104|) (= (select |v_#length_118| 2) 25) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_104|) 0) (= (select |v_#valid_123| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= (select |v_#valid_123| 1) 1) (= |v_#valid_122| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| |v_#StackHeapBarrier_61|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_57| 0) (<= v_~N~0_236 2147483647) (= (+ |v_#pthreadsForks_165| 1) |v_#pthreadsForks_164|) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_305| 2147483648)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_84| |v_ULTIMATE.start_create_fresh_int_array_~size#1_78|)) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_303| 2147483648)) (= (let ((.cse3 (store |v_#memory_int_467| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (store (store (store (store (select |v_#memory_int_467| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_301|) (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_304|) (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 8) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_303|) (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 12) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_302|) (+ 16 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_305|)))) (store .cse3 |v_ULTIMATE.start_main_~#t1~0#1.base_57| (store (select .cse3 |v_ULTIMATE.start_main_~#t1~0#1.base_57|) |v_ULTIMATE.start_main_~#t1~0#1.offset_57| |v_ULTIMATE.start_main_#t~pre12#1_137|))) |v_#memory_int_465|) (< |v_#StackHeapBarrier_61| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= |v_#NULL.base_26| 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 0) (= |v_ULTIMATE.start_main_#t~pre12#1_137| |v_#pthreadsForks_165|) (= (select |v_#valid_123| 0) 0) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_301| 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_302| 2147483647) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_56| v_~q~0.offset_319) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_305| 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_303| 2147483647) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_146| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_56| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|) (= |v_#length_117| (store (store (store |v_#length_118| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_104| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_78| 1073741824) 4))) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_304| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_301| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_56| v_~q~0.base_319) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_102| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 0) (<= 0 (+ 2147483648 v_~q_front~0_517)) (< 0 |v_#StackHeapBarrier_61|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37| v_~n~0_330) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_302| 2147483648)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_126| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_146|) (= v_~q_back~0_631 v_~q_front~0_517) (< 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_78|) (<= v_~q_front~0_517 2147483647) (= v_~s~0_445 0) (= (select |v_#length_118| 1) 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_61|, #pthreadsForks=|v_#pthreadsForks_165|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_467|, #length=|v_#length_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ~q_back~0=v_~q_back~0_631, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_59|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_102|, #NULL.offset=|v_#NULL.offset_26|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_84|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_300|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_56|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, ~q~0.offset=v_~q~0.offset_319, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_137|, #pthreadsForks=|v_#pthreadsForks_164|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_146|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_84|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_69|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_113|, #length=|v_#length_117|, ~q_front~0=v_~q_front~0_517, ~s~0=v_~s~0_445, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_55|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_61|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_82|, ~N~0=v_~N~0_236, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~q~0.base=v_~q~0.base_319, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_78|, #NULL.base=|v_#NULL.base_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_56|, #StackHeapBarrier=|v_#StackHeapBarrier_61|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_138|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_55|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_465|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_55|, ~n~0=v_~n~0_330, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_104|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_60|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_126|} AuxVars[|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_304|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_305|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_302|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_303|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_301|] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [918] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1030| v_~q~0.base_696)) (.cse1 (* v_~q_back~0_1550 4))) (and (= (select .cse0 (+ (* v_~q_front~0_1438 4) v_~q~0.offset_696)) |v_thread2Thread1of1ForFork1_~j~0#1_937|) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_1550) (< v_~q_back~0_1550 v_~n~0_684)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_696 4)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_857| (+ v_~N~0_538 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845| 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_857| v_~N~0_538)) (= |v_thread1Thread1of1ForFork0_#res#1.base_340| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_857| 5) (= (ite (and (< v_~q_front~0_1438 v_~n~0_684) (<= 0 v_~q_front~0_1438) (< v_~q_front~0_1438 (+ 3 v_~q_back~0_1550))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845|) (= v_~s~0_1374 (+ v_~s~0_1375 |v_thread2Thread1of1ForFork1_~j~0#1_937|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845| (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_696)) 0) 1 0)) (= (+ v_~q_front~0_1438 1) v_~q_front~0_1437) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_696)) 1) 1 0) 0)) (= (+ 6 v_~q_back~0_1550) v_~q_back~0_1548) (not (= (ite (let ((.cse2 (+ 5 v_~q_back~0_1550))) (and (<= 0 .cse2) (< .cse2 v_~n~0_684))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_340| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_937| 0)))) InVars {~q_back~0=v_~q_back~0_1550, #memory_int=|v_#memory_int_1030|, ~N~0=v_~N~0_538, ~q~0.base=v_~q~0.base_696, ~n~0=v_~n~0_684, ~q~0.offset=v_~q~0.offset_696, ~s~0=v_~s~0_1375, ~q_front~0=v_~q_front~0_1438} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_937|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_340|, ~q_back~0=v_~q_back~0_1548, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_358|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_613|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_856|, ~N~0=v_~N~0_538, ~q~0.base=v_~q~0.base_696, ~q~0.offset=v_~q~0.offset_696, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_856|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_617|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_613|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_857|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_358|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845|, #memory_int=|v_#memory_int_1030|, ~n~0=v_~n~0_684, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_340|, ~s~0=v_~s~0_1374, ~q_front~0=v_~q_front~0_1437} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] [2022-12-06 07:55:31,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L92-2: Formula: (let ((.cse4 (store |v_#valid_115| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (let ((.cse0 (select |v_#memory_int_336| 1)) (.cse3 (store .cse4 |v_ULTIMATE.start_main_~#t2~0#1.base_83| 1))) (and (= (select |v_#valid_115| 0) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_78| (+ 1 |v_ULTIMATE.start_create_fresh_int_array_~size#1_74|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_50| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_50| v_~q~0.base_232) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_153| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_152| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_50| v_~q~0.offset_232) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_78| |v_ULTIMATE.start_create_fresh_int_array_~size#1_74|)) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_110| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_130|) (= 2 (select |v_#length_110| 1)) (= v_~s~0_253 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_110| (ite (<= 0 v_~N~0_163) 1 0)) (<= v_~q_front~0_319 2147483647) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| |v_#StackHeapBarrier_57|) (< |v_#StackHeapBarrier_57| |v_ULTIMATE.start_main_~#t2~0#1.base_83|) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_153| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_78| 4) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_53| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_74|) (= v_~q_back~0_416 v_~q_front~0_319) (< 0 |v_#StackHeapBarrier_57|) (= (select |v_#length_110| 2) 25) (<= v_~N~0_163 2147483647) (= (+ |v_#pthreadsForks_117| 1) |v_#pthreadsForks_116|) (= (select .cse0 1) 0) (= |v_#NULL.offset_22| 0) (= (let ((.cse1 (store |v_#memory_int_336| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (let ((.cse2 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_78| 4))) (store (store (store (store (select |v_#memory_int_336| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_153|) (+ .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| (- 12)) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_152|) (+ .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| (- 8)) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_151|) (+ .cse2 (- 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_154|))))) (store .cse1 |v_ULTIMATE.start_main_~#t1~0#1.base_53| (store (select .cse1 |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_53| |v_ULTIMATE.start_main_#t~pre12#1_104|))) |v_#memory_int_334|) (= |v_ULTIMATE.start_main_#t~pre12#1_104| |v_#pthreadsForks_117|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| 0)) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_151| 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_152| 2147483647) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_130| 0)) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 0) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_154| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_50| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_154| 2147483647) (<= 0 (+ 2147483648 v_~q_front~0_319)) (= (store (store (store |v_#length_110| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_83| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_74| 1073741824) 4)) |v_#length_109|) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_151| 2147483648)) (= (select |v_#valid_115| 2) 1) (< |v_#StackHeapBarrier_57| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_81| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t2~0#1.base_83|) 0) (= |v_#NULL.base_22| 0) (= (select |v_#valid_115| 1) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n~0_243) (= |v_#valid_114| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| 1))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_57|, #pthreadsForks=|v_#pthreadsForks_117|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_336|, #length=|v_#length_110|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ~q_back~0=v_~q_back~0_416, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_81|, #NULL.offset=|v_#NULL.offset_22|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_78|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_150|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_50|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ~q~0.offset=v_~q~0.offset_232, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_104|, #pthreadsForks=|v_#pthreadsForks_116|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_130|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_60|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_63|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_82|, #length=|v_#length_109|, ~q_front~0=v_~q_front~0_319, ~s~0=v_~s~0_253, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_51|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_55|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_58|, ~N~0=v_~N~0_163, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~q~0.base=v_~q~0.base_232, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_74|, #NULL.base=|v_#NULL.base_22|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_50|, #StackHeapBarrier=|v_#StackHeapBarrier_57|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_97|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_63|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_51|, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_334|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_51|, ~n~0=v_~n~0_243, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_83|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_46|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_110|} AuxVars[|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_153|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_154|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_151|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_152|] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~nondet8#1, #valid, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [918] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1030| v_~q~0.base_696)) (.cse1 (* v_~q_back~0_1550 4))) (and (= (select .cse0 (+ (* v_~q_front~0_1438 4) v_~q~0.offset_696)) |v_thread2Thread1of1ForFork1_~j~0#1_937|) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_1550) (< v_~q_back~0_1550 v_~n~0_684)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_696 4)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_857| (+ v_~N~0_538 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845| 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_857| v_~N~0_538)) (= |v_thread1Thread1of1ForFork0_#res#1.base_340| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_857| 5) (= (ite (and (< v_~q_front~0_1438 v_~n~0_684) (<= 0 v_~q_front~0_1438) (< v_~q_front~0_1438 (+ 3 v_~q_back~0_1550))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845|) (= v_~s~0_1374 (+ v_~s~0_1375 |v_thread2Thread1of1ForFork1_~j~0#1_937|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845| (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_696)) 0) 1 0)) (= (+ v_~q_front~0_1438 1) v_~q_front~0_1437) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_696)) 1) 1 0) 0)) (= (+ 6 v_~q_back~0_1550) v_~q_back~0_1548) (not (= (ite (let ((.cse2 (+ 5 v_~q_back~0_1550))) (and (<= 0 .cse2) (< .cse2 v_~n~0_684))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_340| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_937| 0)))) InVars {~q_back~0=v_~q_back~0_1550, #memory_int=|v_#memory_int_1030|, ~N~0=v_~N~0_538, ~q~0.base=v_~q~0.base_696, ~n~0=v_~n~0_684, ~q~0.offset=v_~q~0.offset_696, ~s~0=v_~s~0_1375, ~q_front~0=v_~q_front~0_1438} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_937|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_340|, ~q_back~0=v_~q_back~0_1548, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_358|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_613|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_856|, ~N~0=v_~N~0_538, ~q~0.base=v_~q~0.base_696, ~q~0.offset=v_~q~0.offset_696, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_856|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_617|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_613|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_857|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_358|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845|, #memory_int=|v_#memory_int_1030|, ~n~0=v_~n~0_684, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_340|, ~s~0=v_~s~0_1374, ~q_front~0=v_~q_front~0_1437} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] [2022-12-06 07:55:31,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [918] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1030| v_~q~0.base_696)) (.cse1 (* v_~q_back~0_1550 4))) (and (= (select .cse0 (+ (* v_~q_front~0_1438 4) v_~q~0.offset_696)) |v_thread2Thread1of1ForFork1_~j~0#1_937|) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_1550) (< v_~q_back~0_1550 v_~n~0_684)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_696 4)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_857| (+ v_~N~0_538 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_696)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845| 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_857| v_~N~0_538)) (= |v_thread1Thread1of1ForFork0_#res#1.base_340| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_857| 5) (= (ite (and (< v_~q_front~0_1438 v_~n~0_684) (<= 0 v_~q_front~0_1438) (< v_~q_front~0_1438 (+ 3 v_~q_back~0_1550))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845|) (= v_~s~0_1374 (+ v_~s~0_1375 |v_thread2Thread1of1ForFork1_~j~0#1_937|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845| (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_696)) 0) 1 0)) (= (+ v_~q_front~0_1438 1) v_~q_front~0_1437) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_696)) 1) 1 0) 0)) (= (+ 6 v_~q_back~0_1550) v_~q_back~0_1548) (not (= (ite (let ((.cse2 (+ 5 v_~q_back~0_1550))) (and (<= 0 .cse2) (< .cse2 v_~n~0_684))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_340| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_937| 0)))) InVars {~q_back~0=v_~q_back~0_1550, #memory_int=|v_#memory_int_1030|, ~N~0=v_~N~0_538, ~q~0.base=v_~q~0.base_696, ~n~0=v_~n~0_684, ~q~0.offset=v_~q~0.offset_696, ~s~0=v_~s~0_1375, ~q_front~0=v_~q_front~0_1438} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_937|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_340|, ~q_back~0=v_~q_back~0_1548, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_358|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_856|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_613|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_856|, ~N~0=v_~N~0_538, ~q~0.base=v_~q~0.base_696, ~q~0.offset=v_~q~0.offset_696, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_856|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_856|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_845|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_617|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_613|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_857|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_358|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_845|, #memory_int=|v_#memory_int_1030|, ~n~0=v_~n~0_684, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_340|, ~s~0=v_~s~0_1374, ~q_front~0=v_~q_front~0_1437} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:55:32,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [925] $Ultimate##0-->thread1EXIT: Formula: false InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_87|, ~q_back~0=v_~q_back~0_1584, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_176|, #NULL.offset=|v_#NULL.offset_34|, ~q~0.offset=v_~q~0.offset_706, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_289|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_637|, #pthreadsForks=|v_#pthreadsForks_388|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_214|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_245|, #length=|v_#length_133|, ~s~0=v_~s~0_1410, ~q_front~0=v_~q_front~0_1470, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_87|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_90|, ~q~0.base=v_~q~0.base_706, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_98|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_877|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_328|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_633|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_63|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_63|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_126|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_877|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_633|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_126|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1272|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_75|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_238|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_97|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_366|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_870|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_348|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_960|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_348|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_366|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_206|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_877|, ~N~0=v_~N~0_548, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_75|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_877|, #NULL.base=|v_#NULL.base_34|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_870|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_97|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_881|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_1044|, ~n~0=v_~n~0_694, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_179|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_218|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_#t~post1#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~s~0, ~q_front~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, thread1Thread1of1ForFork0_#t~post3#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_main_#t~nondet15#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, ULTIMATE.start_main_#t~nondet10#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, thread2Thread1of1ForFork1_#t~mem6#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, thread2Thread1of1ForFork1_#t~post7#1, #NULL.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, thread1Thread1of1ForFork0_~i~0#1, #valid, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:55:32,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [926] $Ultimate##0-->thread1EXIT: Formula: false InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ~q_back~0=v_~q_back~0_1588, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_69|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_178|, #NULL.offset=|v_#NULL.offset_36|, ~q~0.offset=v_~q~0.offset_708, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_639|, #pthreadsForks=|v_#pthreadsForks_392|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_216|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_247|, #length=|v_#length_137|, ~s~0=v_~s~0_1414, ~q_front~0=v_~q_front~0_1474, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_65|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_92|, ~q~0.base=v_~q~0.base_708, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_100|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_879|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_86|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_330|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_635|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_65|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_65|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_128|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_879|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_635|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_128|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1284|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_86|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_77|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_47|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_240|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_99|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_368|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_872|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_350|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_962|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_63|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_350|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_368|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_208|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_879|, ~N~0=v_~N~0_550, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_77|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_879|, #NULL.base=|v_#NULL.base_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_872|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_99|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_883|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_1048|, ~n~0=v_~n~0_696, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_181|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_220|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_#t~post1#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~s~0, ~q_front~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, thread1Thread1of1ForFork0_#t~post3#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_main_#t~nondet15#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, ULTIMATE.start_main_#t~nondet10#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, thread2Thread1of1ForFork1_#t~mem6#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, thread2Thread1of1ForFork1_#t~post7#1, #NULL.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, thread1Thread1of1ForFork0_~i~0#1, #valid, #memory_int, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:55:32,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [800] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_797| v_~q~0.base_543)) (.cse4 (* 4 v_~q_front~0_965))) (let ((.cse2 (select .cse0 (+ .cse4 v_~q~0.offset_543))) (.cse1 (* v_~q_back~0_1110 4))) (and (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_543 .cse1)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_536| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_568| 5) (= (ite (= (select .cse0 (+ 16 v_~q~0.offset_543 .cse1)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_554|) (= (+ .cse2 v_~s~0_891 |v_thread2Thread1of1ForFork1_~j~0#1_584|) v_~s~0_890) (= (+ 2 v_~q_front~0_965) v_~q_front~0_964) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_554| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554|) (not (= (ite (and (<= 0 v_~q_front~0_965) (< v_~q_front~0_965 (+ 3 v_~q_back~0_1110)) (< v_~q_front~0_965 v_~n~0_534)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_543 .cse1 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse3 (+ v_~q_back~0_1110 4))) (and (< .cse3 v_~n~0_534) (<= 0 .cse3))) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_543 .cse1)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554| 0)) (not (= .cse2 0)) (= (select .cse0 (+ .cse4 v_~q~0.offset_543 4)) |v_thread2Thread1of1ForFork1_~j~0#1_584|) (not (= (ite (and (<= 0 v_~q_back~0_1110) (< v_~q_back~0_1110 v_~n~0_534)) 1 0) 0)) (= (+ 5 v_~q_back~0_1110) v_~q_back~0_1108) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_584| 0)) (< 4 v_~N~0_412) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_536| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_536|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_536| (ite (let ((.cse5 (+ 1 v_~q_front~0_965))) (and (< v_~q_front~0_965 (+ 2 v_~q_back~0_1110)) (< .cse5 v_~n~0_534) (<= 0 .cse5))) 1 0)) (not (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_543 .cse1)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1110, #memory_int=|v_#memory_int_797|, ~N~0=v_~N~0_412, ~q~0.base=v_~q~0.base_543, ~n~0=v_~n~0_534, ~q~0.offset=v_~q~0.offset_543, ~s~0=v_~s~0_891, ~q_front~0=v_~q_front~0_965} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_584|, ~q_back~0=v_~q_back~0_1108, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_536|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_382|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_536|, ~N~0=v_~N~0_412, ~q~0.base=v_~q~0.base_543, ~q~0.offset=v_~q~0.offset_543, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_536|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_536|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_554|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_386|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_382|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_568|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554|, #memory_int=|v_#memory_int_797|, ~n~0=v_~n~0_534, ~s~0=v_~s~0_890, ~q_front~0=v_~q_front~0_964} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:55:33,147 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:55:33,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2493 [2022-12-06 07:55:33,148 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 1115 transitions, 39082 flow [2022-12-06 07:55:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:33,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:33,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-06 07:55:33,148 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash 875337049, now seen corresponding path program 1 times [2022-12-06 07:55:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:33,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151954649] [2022-12-06 07:55:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151954649] [2022-12-06 07:55:34,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151954649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52756166] [2022-12-06 07:55:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:34,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:34,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:34,161 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:34,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-12-06 07:55:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:34,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:55:34,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:34,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:34,491 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 30 treesize of output 30 [2022-12-06 07:55:34,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:34,570 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 90 treesize of output 20 [2022-12-06 07:55:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:34,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:34,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:34,776 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 271 treesize of output 382 [2022-12-06 07:55:34,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:34,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:55:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52756166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:35,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:55:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112464264] [2022-12-06 07:55:35,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:35,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:55:35,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:55:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:55:35,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 80 [2022-12-06 07:55:35,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1115 transitions, 39082 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:55:35,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:35,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 80 [2022-12-06 07:55:35,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:40,799 INFO L130 PetriNetUnfolder]: 4885/9292 cut-off events. [2022-12-06 07:55:40,799 INFO L131 PetriNetUnfolder]: For 529547/529744 co-relation queries the response was YES. [2022-12-06 07:55:40,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118847 conditions, 9292 events. 4885/9292 cut-off events. For 529547/529744 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 76653 event pairs, 1174 based on Foata normal form. 97/9389 useless extension candidates. Maximal degree in co-relation 118118. Up to 9077 conditions per place. [2022-12-06 07:55:40,916 INFO L137 encePairwiseOnDemand]: 31/80 looper letters, 1041 selfloop transitions, 97 changer transitions 7/1146 dead transitions. [2022-12-06 07:55:40,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1146 transitions, 41743 flow [2022-12-06 07:55:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:55:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:55:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2022-12-06 07:55:40,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13854166666666667 [2022-12-06 07:55:40,917 INFO L175 Difference]: Start difference. First operand has 347 places, 1115 transitions, 39082 flow. Second operand 12 states and 133 transitions. [2022-12-06 07:55:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1146 transitions, 41743 flow [2022-12-06 07:55:44,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1146 transitions, 41687 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-06 07:55:44,665 INFO L231 Difference]: Finished difference. Result has 359 places, 1120 transitions, 39391 flow [2022-12-06 07:55:44,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=39026, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=39391, PETRI_PLACES=359, PETRI_TRANSITIONS=1120} [2022-12-06 07:55:44,666 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 338 predicate places. [2022-12-06 07:55:44,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:44,666 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1120 transitions, 39391 flow [2022-12-06 07:55:44,672 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:44,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:44,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1120 transitions, 39391 flow [2022-12-06 07:55:44,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 358 places, 1120 transitions, 39391 flow [2022-12-06 07:55:45,654 INFO L130 PetriNetUnfolder]: 1083/3295 cut-off events. [2022-12-06 07:55:45,654 INFO L131 PetriNetUnfolder]: For 196951/198824 co-relation queries the response was YES. [2022-12-06 07:55:45,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37668 conditions, 3295 events. 1083/3295 cut-off events. For 196951/198824 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 33066 event pairs, 20 based on Foata normal form. 362/3647 useless extension candidates. Maximal degree in co-relation 37263. Up to 1141 conditions per place. [2022-12-06 07:55:45,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 358 places, 1120 transitions, 39391 flow [2022-12-06 07:55:45,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 3702 [2022-12-06 07:55:45,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [930] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_1058| v_~q~0.base_716)) (.cse6 (* v_~q_front~0_1494 4))) (let ((.cse1 (select .cse2 (+ .cse6 v_~q~0.offset_716 4))) (.cse0 (select .cse2 (+ .cse6 v_~q~0.offset_716))) (.cse3 (* v_~q_back~0_1601 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893| (ite (and (<= 1 v_~q_front~0_1492) (< v_~q_front~0_1492 (+ v_~n~0_704 1)) (< v_~q_front~0_1492 (+ v_~q_back~0_1600 1))) 1 0)) (= (+ v_~s~0_1434 |v_thread2Thread1of1ForFork1_~j~0#1_976| .cse0 .cse1) v_~s~0_1432) (not (= 0 .cse1)) (< 4 v_~N~0_558) (= v_~q_front~0_1492 (+ v_~q_front~0_1494 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893|) (not (= .cse0 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_880| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_880|) (not (= (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_716)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_891| 5) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_880| 0)) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_716)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_976| 0)) (not (= (ite (and (< v_~q_front~0_1494 v_~n~0_704) (< v_~q_front~0_1494 (+ 3 v_~q_back~0_1601)) (<= 0 v_~q_front~0_1494)) 1 0) 0)) (= (select .cse2 (+ (* v_~q_front~0_1492 4) (- 4) v_~q~0.offset_716)) |v_thread2Thread1of1ForFork1_~j~0#1_976|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_880| (ite (= (select .cse2 (+ 16 .cse3 v_~q~0.offset_716)) 1) 1 0)) (= (+ 5 v_~q_back~0_1601) v_~q_back~0_1600) (not (= (ite (and (<= 0 v_~q_back~0_1601) (< v_~q_back~0_1601 v_~n~0_704)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_716 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse4 (+ v_~q_back~0_1601 4))) (and (<= 0 .cse4) (< .cse4 v_~n~0_704))) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_716)) 1) 1 0) 0)) (not (= (ite (let ((.cse5 (+ v_~q_front~0_1494 1))) (and (< .cse5 v_~n~0_704) (< v_~q_front~0_1494 (+ 2 v_~q_back~0_1601)) (<= 0 .cse5))) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1601, #memory_int=|v_#memory_int_1058|, ~N~0=v_~N~0_558, ~q~0.base=v_~q~0.base_716, ~n~0=v_~n~0_704, ~q~0.offset=v_~q~0.offset_716, ~s~0=v_~s~0_1434, ~q_front~0=v_~q_front~0_1494} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_976|, ~q_back~0=v_~q_back~0_1600, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_893|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_643|, ~N~0=v_~N~0_558, ~q~0.base=v_~q~0.base_716, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_893|, ~q~0.offset=v_~q~0.offset_716, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_880|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_647|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_643|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_891|, #memory_int=|v_#memory_int_1058|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_880|, ~n~0=v_~n~0_704, ~s~0=v_~s~0_1432, ~q_front~0=v_~q_front~0_1492} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:55:46,414 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:46,415 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:46,415 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:46,415 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:46,415 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:46,415 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [930] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_1058| v_~q~0.base_716)) (.cse6 (* v_~q_front~0_1494 4))) (let ((.cse1 (select .cse2 (+ .cse6 v_~q~0.offset_716 4))) (.cse0 (select .cse2 (+ .cse6 v_~q~0.offset_716))) (.cse3 (* v_~q_back~0_1601 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893| (ite (and (<= 1 v_~q_front~0_1492) (< v_~q_front~0_1492 (+ v_~n~0_704 1)) (< v_~q_front~0_1492 (+ v_~q_back~0_1600 1))) 1 0)) (= (+ v_~s~0_1434 |v_thread2Thread1of1ForFork1_~j~0#1_976| .cse0 .cse1) v_~s~0_1432) (not (= 0 .cse1)) (< 4 v_~N~0_558) (= v_~q_front~0_1492 (+ v_~q_front~0_1494 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893|) (not (= .cse0 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_880| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_880|) (not (= (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_716)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_891| 5) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_880| 0)) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_716)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_976| 0)) (not (= (ite (and (< v_~q_front~0_1494 v_~n~0_704) (< v_~q_front~0_1494 (+ 3 v_~q_back~0_1601)) (<= 0 v_~q_front~0_1494)) 1 0) 0)) (= (select .cse2 (+ (* v_~q_front~0_1492 4) (- 4) v_~q~0.offset_716)) |v_thread2Thread1of1ForFork1_~j~0#1_976|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_880| (ite (= (select .cse2 (+ 16 .cse3 v_~q~0.offset_716)) 1) 1 0)) (= (+ 5 v_~q_back~0_1601) v_~q_back~0_1600) (not (= (ite (and (<= 0 v_~q_back~0_1601) (< v_~q_back~0_1601 v_~n~0_704)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_716 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse4 (+ v_~q_back~0_1601 4))) (and (<= 0 .cse4) (< .cse4 v_~n~0_704))) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_716)) 1) 1 0) 0)) (not (= (ite (let ((.cse5 (+ v_~q_front~0_1494 1))) (and (< .cse5 v_~n~0_704) (< v_~q_front~0_1494 (+ 2 v_~q_back~0_1601)) (<= 0 .cse5))) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1601, #memory_int=|v_#memory_int_1058|, ~N~0=v_~N~0_558, ~q~0.base=v_~q~0.base_716, ~n~0=v_~n~0_704, ~q~0.offset=v_~q~0.offset_716, ~s~0=v_~s~0_1434, ~q_front~0=v_~q_front~0_1494} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_976|, ~q_back~0=v_~q_back~0_1600, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_893|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_643|, ~N~0=v_~N~0_558, ~q~0.base=v_~q~0.base_716, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_893|, ~q~0.offset=v_~q~0.offset_716, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_880|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_647|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_643|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_891|, #memory_int=|v_#memory_int_1058|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_880|, ~n~0=v_~n~0_704, ~s~0=v_~s~0_1432, ~q_front~0=v_~q_front~0_1492} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:55:47,106 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,106 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,106 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,106 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,106 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,107 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:55:47,746 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:47,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3081 [2022-12-06 07:55:47,747 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1120 transitions, 39497 flow [2022-12-06 07:55:47,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:55:47,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:47,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:47,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-12-06 07:55:47,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:47,953 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 857506963, now seen corresponding path program 2 times [2022-12-06 07:55:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:47,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279880806] [2022-12-06 07:55:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279880806] [2022-12-06 07:55:48,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279880806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713848194] [2022-12-06 07:55:48,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:55:48,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:48,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:48,678 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:48,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-12-06 07:55:49,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:55:49,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:55:49,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:55:49,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:49,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:49,080 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 30 treesize of output 30 [2022-12-06 07:55:49,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:49,222 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 92 treesize of output 20 [2022-12-06 07:55:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:49,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:49,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:49,430 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 271 treesize of output 382 [2022-12-06 07:55:49,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:49,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 07:55:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713848194] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:50,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:50,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:55:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141401084] [2022-12-06 07:55:50,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:50,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:55:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:55:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:55:50,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 83 [2022-12-06 07:55:50,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1120 transitions, 39497 flow. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:50,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:50,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 83 [2022-12-06 07:55:50,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:55,021 INFO L130 PetriNetUnfolder]: 4145/7789 cut-off events. [2022-12-06 07:55:55,021 INFO L131 PetriNetUnfolder]: For 444506/444722 co-relation queries the response was YES. [2022-12-06 07:55:55,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99098 conditions, 7789 events. 4145/7789 cut-off events. For 444506/444722 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 61439 event pairs, 1378 based on Foata normal form. 46/7835 useless extension candidates. Maximal degree in co-relation 98474. Up to 7598 conditions per place. [2022-12-06 07:55:55,113 INFO L137 encePairwiseOnDemand]: 31/83 looper letters, 1041 selfloop transitions, 85 changer transitions 23/1150 dead transitions. [2022-12-06 07:55:55,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1150 transitions, 42116 flow [2022-12-06 07:55:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:55:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:55:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2022-12-06 07:55:55,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13654618473895583 [2022-12-06 07:55:55,114 INFO L175 Difference]: Start difference. First operand has 358 places, 1120 transitions, 39497 flow. Second operand 12 states and 136 transitions. [2022-12-06 07:55:55,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 1150 transitions, 42116 flow [2022-12-06 07:55:57,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1150 transitions, 41894 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-12-06 07:55:58,020 INFO L231 Difference]: Finished difference. Result has 364 places, 1118 transitions, 39441 flow [2022-12-06 07:55:58,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=39268, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=39441, PETRI_PLACES=364, PETRI_TRANSITIONS=1118} [2022-12-06 07:55:58,021 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 343 predicate places. [2022-12-06 07:55:58,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:58,021 INFO L89 Accepts]: Start accepts. Operand has 364 places, 1118 transitions, 39441 flow [2022-12-06 07:55:58,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:58,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:58,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 364 places, 1118 transitions, 39441 flow [2022-12-06 07:55:58,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 358 places, 1118 transitions, 39441 flow [2022-12-06 07:55:58,937 INFO L130 PetriNetUnfolder]: 1081/3280 cut-off events. [2022-12-06 07:55:58,937 INFO L131 PetriNetUnfolder]: For 198325/200138 co-relation queries the response was YES. [2022-12-06 07:55:58,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37603 conditions, 3280 events. 1081/3280 cut-off events. For 198325/200138 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 32755 event pairs, 19 based on Foata normal form. 370/3641 useless extension candidates. Maximal degree in co-relation 37333. Up to 1139 conditions per place. [2022-12-06 07:55:59,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 358 places, 1118 transitions, 39441 flow [2022-12-06 07:55:59,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 3692 [2022-12-06 07:55:59,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:59,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 987 [2022-12-06 07:55:59,008 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1118 transitions, 39441 flow [2022-12-06 07:55:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:59,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:59,008 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:59,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:59,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:59,214 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:59,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1769542418, now seen corresponding path program 1 times [2022-12-06 07:55:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:59,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666533332] [2022-12-06 07:55:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666533332] [2022-12-06 07:55:59,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666533332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:59,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607530440] [2022-12-06 07:55:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:59,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:59,400 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:59,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-12-06 07:55:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:59,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:55:59,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:59,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:59,895 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:55:59,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 16 [2022-12-06 07:55:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:59,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607530440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:59,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:59,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 07:55:59,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176535094] [2022-12-06 07:55:59,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:59,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:55:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:59,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:55:59,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:55:59,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 82 [2022-12-06 07:55:59,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1118 transitions, 39441 flow. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 07:55:59,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:59,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 82 [2022-12-06 07:55:59,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:04,582 INFO L130 PetriNetUnfolder]: 4550/8493 cut-off events. [2022-12-06 07:56:04,582 INFO L131 PetriNetUnfolder]: For 535186/535484 co-relation queries the response was YES. [2022-12-06 07:56:04,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108950 conditions, 8493 events. 4550/8493 cut-off events. For 535186/535484 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 67712 event pairs, 1250 based on Foata normal form. 144/8637 useless extension candidates. Maximal degree in co-relation 108440. Up to 6524 conditions per place. [2022-12-06 07:56:04,700 INFO L137 encePairwiseOnDemand]: 27/82 looper letters, 1009 selfloop transitions, 326 changer transitions 0/1336 dead transitions. [2022-12-06 07:56:04,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1336 transitions, 46915 flow [2022-12-06 07:56:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:56:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:56:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-12-06 07:56:04,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13093709884467267 [2022-12-06 07:56:04,701 INFO L175 Difference]: Start difference. First operand has 358 places, 1118 transitions, 39441 flow. Second operand 19 states and 204 transitions. [2022-12-06 07:56:04,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 1336 transitions, 46915 flow [2022-12-06 07:56:07,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 1336 transitions, 46744 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 07:56:07,924 INFO L231 Difference]: Finished difference. Result has 376 places, 1208 transitions, 43301 flow [2022-12-06 07:56:07,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=39278, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=43301, PETRI_PLACES=376, PETRI_TRANSITIONS=1208} [2022-12-06 07:56:07,924 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 355 predicate places. [2022-12-06 07:56:07,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:07,925 INFO L89 Accepts]: Start accepts. Operand has 376 places, 1208 transitions, 43301 flow [2022-12-06 07:56:07,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:07,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:07,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 1208 transitions, 43301 flow [2022-12-06 07:56:07,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 376 places, 1208 transitions, 43301 flow [2022-12-06 07:56:09,036 INFO L130 PetriNetUnfolder]: 1199/3566 cut-off events. [2022-12-06 07:56:09,036 INFO L131 PetriNetUnfolder]: For 242682/244847 co-relation queries the response was YES. [2022-12-06 07:56:09,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43287 conditions, 3566 events. 1199/3566 cut-off events. For 242682/244847 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 35860 event pairs, 28 based on Foata normal form. 377/3932 useless extension candidates. Maximal degree in co-relation 42875. Up to 1330 conditions per place. [2022-12-06 07:56:09,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 376 places, 1208 transitions, 43301 flow [2022-12-06 07:56:09,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 3980 [2022-12-06 07:56:09,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [935] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1066| v_~q~0.base_722)) (.cse7 (* v_~q_front~0_1513 4))) (let ((.cse3 (select .cse0 (+ v_~q~0.offset_722 .cse7))) (.cse2 (+ 6 v_~q_back~0_1621)) (.cse4 (select .cse0 (+ v_~q~0.offset_722 .cse7 4))) (.cse1 (* v_~q_back~0_1621 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_722)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_722)) 1) 1 0) 0)) (= (select .cse0 (+ (* v_~q_front~0_1512 4) (- 4) v_~q~0.offset_722)) |v_thread2Thread1of1ForFork1_~j~0#1_991|) (= .cse2 v_~q_back~0_1619) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_892| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_892|) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_901| 6) (< 5 v_~N~0_564) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_722)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_722 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_1513 v_~n~0_710) (< v_~q_front~0_1513 (+ 3 v_~q_back~0_1621)) (<= 0 v_~q_front~0_1513)) 1 0) 0)) (= (+ .cse4 .cse3 v_~s~0_1455 |v_thread2Thread1of1ForFork1_~j~0#1_991|) v_~s~0_1454) (not (= (ite (let ((.cse5 (+ 5 v_~q_back~0_1621))) (and (< .cse5 v_~n~0_710) (<= 0 .cse5))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_907| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_907|) (= (ite (and (<= 1 v_~q_front~0_1512) (< v_~q_front~0_1512 .cse2) (< v_~q_front~0_1512 (+ v_~n~0_710 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_907|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_892| 0)) (= v_~q_front~0_1512 (+ v_~q_front~0_1513 3)) (not (= .cse4 0)) (not (= (ite (let ((.cse6 (+ v_~q_front~0_1513 1))) (and (<= 0 .cse6) (< v_~q_front~0_1513 (+ 2 v_~q_back~0_1621)) (< .cse6 v_~n~0_710))) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_722)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_892|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_991| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_722)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1621 v_~n~0_710) (<= 0 v_~q_back~0_1621)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1621, #memory_int=|v_#memory_int_1066|, ~N~0=v_~N~0_564, ~q~0.base=v_~q~0.base_722, ~n~0=v_~n~0_710, ~q~0.offset=v_~q~0.offset_722, ~s~0=v_~s~0_1455, ~q_front~0=v_~q_front~0_1513} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_991|, ~q_back~0=v_~q_back~0_1619, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_907|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_652|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_907|, ~N~0=v_~N~0_564, ~q~0.base=v_~q~0.base_722, ~q~0.offset=v_~q~0.offset_722, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_907|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_907|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_892|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_656|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_652|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_901|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_892|, #memory_int=|v_#memory_int_1066|, ~n~0=v_~n~0_710, ~s~0=v_~s~0_1454, ~q_front~0=v_~q_front~0_1512} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:56:09,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [931] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1062| v_~q~0.base_718)) (.cse7 (* v_~q_front~0_1503 4))) (let ((.cse2 (+ 6 v_~q_back~0_1611)) (.cse1 (* v_~q_back~0_1611 4)) (.cse4 (select .cse0 (+ .cse7 v_~q~0.offset_718 4))) (.cse5 (select .cse0 (+ .cse7 v_~q~0.offset_718)))) (and (not (= (ite (and (< v_~q_back~0_1611 v_~n~0_706) (<= 0 v_~q_back~0_1611)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_718 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_718)) 1) 1 0) 0)) (< 4 v_~N~0_560) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_886| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_886|) (= (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_718)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_886|) (not (= (ite (and (< v_~q_front~0_1503 v_~n~0_706) (< v_~q_front~0_1503 (+ 3 v_~q_back~0_1611)) (<= 0 v_~q_front~0_1503)) 1 0) 0)) (= .cse2 v_~q_back~0_1609) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_718)) 1) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_897| v_~N~0_560)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_360| 0) (= (select .cse0 (+ (* v_~q_front~0_1502 4) (- 4) v_~q~0.offset_718)) |v_thread2Thread1of1ForFork1_~j~0#1_985|) (not (= (ite (let ((.cse3 (+ v_~q_front~0_1503 1))) (and (<= 0 .cse3) (< .cse3 v_~n~0_706) (< v_~q_front~0_1503 (+ 2 v_~q_back~0_1611)))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_985| 0)) (= v_~q_front~0_1502 (+ v_~q_front~0_1503 3)) (= |v_thread1Thread1of1ForFork0_~i~0#1_897| 5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_901| (ite (and (< v_~q_front~0_1502 .cse2) (< v_~q_front~0_1502 (+ v_~n~0_706 1)) (<= 1 v_~q_front~0_1502)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_718)) 1) 1 0) 0)) (= (+ .cse4 v_~s~0_1445 |v_thread2Thread1of1ForFork1_~j~0#1_985| .cse5) v_~s~0_1444) (= |v_thread1Thread1of1ForFork0_#res#1.base_360| 0) (not (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_718)) 1) 1 0) 0)) (not (= .cse4 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_901| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_901|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_886| 0)) (not (= .cse5 0)) (not (= (ite (let ((.cse6 (+ 5 v_~q_back~0_1611))) (and (< .cse6 v_~n~0_706) (<= 0 .cse6))) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1611, #memory_int=|v_#memory_int_1062|, ~N~0=v_~N~0_560, ~q~0.base=v_~q~0.base_718, ~n~0=v_~n~0_706, ~q~0.offset=v_~q~0.offset_718, ~s~0=v_~s~0_1445, ~q_front~0=v_~q_front~0_1503} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_985|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_360|, ~q_back~0=v_~q_back~0_1609, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_378|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_901|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_901|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_648|, ~N~0=v_~N~0_560, ~q~0.base=v_~q~0.base_718, ~q~0.offset=v_~q~0.offset_718, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_901|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_901|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_886|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_652|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_648|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_897|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_378|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_886|, #memory_int=|v_#memory_int_1062|, ~n~0=v_~n~0_706, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_360|, ~s~0=v_~s~0_1444, ~q_front~0=v_~q_front~0_1502} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:56:09,875 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,875 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:09,876 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,770 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,770 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:10,853 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:11,560 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:56:11,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3637 [2022-12-06 07:56:11,561 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1205 transitions, 43257 flow [2022-12-06 07:56:11,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 07:56:11,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:11,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:11,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-12-06 07:56:11,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:11,767 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1439475742, now seen corresponding path program 1 times [2022-12-06 07:56:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738377581] [2022-12-06 07:56:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:12,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738377581] [2022-12-06 07:56:12,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738377581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:12,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366145172] [2022-12-06 07:56:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:12,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:12,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:12,441 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:12,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-12-06 07:56:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:12,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-06 07:56:12,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:12,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 59 [2022-12-06 07:56:12,794 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 07:56:12,834 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 07:56:12,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:56:12,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 24 [2022-12-06 07:56:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:12,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:13,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366145172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:13,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:13,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:56:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301260771] [2022-12-06 07:56:13,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:13,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:56:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:13,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:56:13,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=181, Unknown=1, NotChecked=0, Total=240 [2022-12-06 07:56:13,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 83 [2022-12-06 07:56:13,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1205 transitions, 43257 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:13,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:13,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 83 [2022-12-06 07:56:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:19,839 INFO L130 PetriNetUnfolder]: 4766/8937 cut-off events. [2022-12-06 07:56:19,839 INFO L131 PetriNetUnfolder]: For 573484/573684 co-relation queries the response was YES. [2022-12-06 07:56:19,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119851 conditions, 8937 events. 4766/8937 cut-off events. For 573484/573684 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 72111 event pairs, 1006 based on Foata normal form. 96/9033 useless extension candidates. Maximal degree in co-relation 119119. Up to 8083 conditions per place. [2022-12-06 07:56:19,940 INFO L137 encePairwiseOnDemand]: 33/83 looper letters, 1106 selfloop transitions, 294 changer transitions 33/1434 dead transitions. [2022-12-06 07:56:19,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1434 transitions, 52065 flow [2022-12-06 07:56:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 07:56:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 07:56:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 261 transitions. [2022-12-06 07:56:19,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11646586345381527 [2022-12-06 07:56:19,941 INFO L175 Difference]: Start difference. First operand has 373 places, 1205 transitions, 43257 flow. Second operand 27 states and 261 transitions. [2022-12-06 07:56:19,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1434 transitions, 52065 flow [2022-12-06 07:56:24,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1434 transitions, 50438 flow, removed 800 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:24,357 INFO L231 Difference]: Finished difference. Result has 416 places, 1326 transitions, 47089 flow [2022-12-06 07:56:24,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=41871, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=47089, PETRI_PLACES=416, PETRI_TRANSITIONS=1326} [2022-12-06 07:56:24,357 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 395 predicate places. [2022-12-06 07:56:24,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:24,357 INFO L89 Accepts]: Start accepts. Operand has 416 places, 1326 transitions, 47089 flow [2022-12-06 07:56:24,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:24,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:24,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 416 places, 1326 transitions, 47089 flow [2022-12-06 07:56:24,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 1326 transitions, 47089 flow [2022-12-06 07:56:25,515 INFO L130 PetriNetUnfolder]: 1272/3769 cut-off events. [2022-12-06 07:56:25,515 INFO L131 PetriNetUnfolder]: For 276402/278453 co-relation queries the response was YES. [2022-12-06 07:56:25,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47488 conditions, 3769 events. 1272/3769 cut-off events. For 276402/278453 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 38424 event pairs, 43 based on Foata normal form. 381/4120 useless extension candidates. Maximal degree in co-relation 47270. Up to 1352 conditions per place. [2022-12-06 07:56:25,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 412 places, 1326 transitions, 47089 flow [2022-12-06 07:56:25,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 4276 [2022-12-06 07:56:25,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:56:25,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [933] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_1064| v_~q~0.base_720)) (.cse5 (* v_~q_front~0_1508 4))) (let ((.cse3 (* v_~q_back~0_1616 4)) (.cse4 (select .cse2 (+ 8 v_~q~0.offset_720 .cse5))) (.cse7 (select .cse2 (+ v_~q~0.offset_720 4 .cse5))) (.cse0 (select .cse2 (+ v_~q~0.offset_720 .cse5)))) (and (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_903| (ite (let ((.cse1 (+ v_~q_front~0_1508 3))) (and (< .cse1 v_~q_back~0_1615) (<= 0 .cse1) (< .cse1 v_~n~0_708))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_899| 5) (not (= 0 (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_720)) 1) 1 0))) (not (= .cse4 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_720)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_720)) 1) 1 0) 0)) (< 4 v_~N~0_562) (= (+ 5 v_~q_back~0_1616) v_~q_back~0_1615) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_903| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_903|) (= v_~q_front~0_1506 (+ v_~q_front~0_1508 4)) (= (select .cse2 (+ 12 v_~q~0.offset_720 .cse5)) |v_thread2Thread1of1ForFork1_~j~0#1_987|) (= (ite (= (select .cse2 (+ .cse3 16 v_~q~0.offset_720)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_890|) (not (= (ite (let ((.cse6 (+ v_~q_front~0_1508 1))) (and (< v_~q_front~0_1508 (+ 2 v_~q_back~0_1616)) (< .cse6 v_~n~0_708) (<= 0 .cse6))) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_720 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_890| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_890|) (not (= .cse7 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_987| 0)) (= (+ .cse4 .cse7 .cse0 v_~s~0_1450 |v_thread2Thread1of1ForFork1_~j~0#1_987|) v_~s~0_1448) (not (= (ite (and (<= 0 v_~q_back~0_1616) (< v_~q_back~0_1616 v_~n~0_708)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_890| 0)) (not (= (ite (and (< v_~q_front~0_1508 (+ 3 v_~q_back~0_1616)) (<= 0 v_~q_front~0_1508) (< v_~q_front~0_1508 v_~n~0_708)) 1 0) 0)) (not (= (ite (let ((.cse8 (+ v_~q_back~0_1616 4))) (and (<= 0 .cse8) (< .cse8 v_~n~0_708))) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1616, #memory_int=|v_#memory_int_1064|, ~N~0=v_~N~0_562, ~q~0.base=v_~q~0.base_720, ~n~0=v_~n~0_708, ~q~0.offset=v_~q~0.offset_720, ~s~0=v_~s~0_1450, ~q_front~0=v_~q_front~0_1508} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_987|, ~q_back~0=v_~q_back~0_1615, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_903|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_903|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_650|, ~N~0=v_~N~0_562, ~q~0.base=v_~q~0.base_720, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_903|, ~q~0.offset=v_~q~0.offset_720, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_903|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_890|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_654|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_650|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_899|, #memory_int=|v_#memory_int_1064|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_890|, ~n~0=v_~n~0_708, ~s~0=v_~s~0_1448, ~q_front~0=v_~q_front~0_1506} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:56:26,451 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:26,451 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:27,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] L93-4-->L94-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) |v_ULTIMATE.start_main_#t~mem16#1_18|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:56:27,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] L93-4-->L94-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) |v_ULTIMATE.start_main_#t~mem16#1_18|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:56:27,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [946] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1086| v_~q~0.base_736)) (.cse2 (* v_~q_front~0_1566 4))) (let ((.cse1 (* v_~q_back~0_1656 4)) (.cse5 (select .cse0 (+ v_~q~0.offset_736 4 .cse2))) (.cse6 (select .cse0 (+ v_~q~0.offset_736 .cse2))) (.cse4 (select .cse0 (+ 8 v_~q~0.offset_736 .cse2)))) (and (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_736 .cse1)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1029| (select .cse0 (+ 16 v_~q~0.offset_736 .cse2))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_942| (ite (let ((.cse3 (+ v_~q_front~0_1566 4))) (and (<= 0 .cse3) (< .cse3 v_~q_back~0_1655) (< .cse3 v_~n~0_724))) 1 0)) (not (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_736 .cse1)) 1) 1 0) 0)) (< 4 v_~N~0_576) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1029| (select .cse0 (+ 12 v_~q~0.offset_736 .cse2)) v_~s~0_1508 .cse4 .cse5 .cse6) v_~s~0_1506) (not (= .cse6 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_736 4 .cse1)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_736 .cse1)) 1) 1 0) 0)) (not (= (ite (let ((.cse7 (+ v_~q_back~0_1656 4))) (and (<= 0 .cse7) (< .cse7 v_~n~0_724))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1029| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_915| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_915|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_915| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_942| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_915| (ite (= (select .cse0 (+ 16 v_~q~0.offset_736 .cse1)) 1) 1 0)) (= v_~q_back~0_1655 (+ 5 v_~q_back~0_1656)) (not (= .cse5 0)) (= v_~q_front~0_1564 (+ v_~q_front~0_1566 5)) (not (= (ite (and (< v_~q_front~0_1566 v_~n~0_724) (< v_~q_front~0_1566 (+ 3 v_~q_back~0_1656)) (<= 0 v_~q_front~0_1566)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_942| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_942|) (= |v_thread1Thread1of1ForFork0_~i~0#1_923| 5) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1029| v_~s~0_1508 .cse4 .cse5 .cse6) v_~s~0_1506)) (not (= .cse4 0))))) InVars {~q_back~0=v_~q_back~0_1656, #memory_int=|v_#memory_int_1086|, ~N~0=v_~N~0_576, ~q~0.base=v_~q~0.base_736, ~n~0=v_~n~0_724, ~q~0.offset=v_~q~0.offset_736, ~s~0=v_~s~0_1508, ~q_front~0=v_~q_front~0_1566} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1029|, ~q_back~0=v_~q_back~0_1655, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_942|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_942|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_673|, ~N~0=v_~N~0_576, ~q~0.base=v_~q~0.base_736, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_942|, ~q~0.offset=v_~q~0.offset_736, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_942|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_915|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_677|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_673|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_923|, #memory_int=|v_#memory_int_1086|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_915|, ~n~0=v_~n~0_724, ~s~0=v_~s~0_1506, ~q_front~0=v_~q_front~0_1564} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:56:27,866 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:56:27,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3510 [2022-12-06 07:56:27,867 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 1326 transitions, 47209 flow [2022-12-06 07:56:27,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:27,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:27,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:27,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-12-06 07:56:28,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-12-06 07:56:28,074 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 76718633, now seen corresponding path program 1 times [2022-12-06 07:56:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:28,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884199236] [2022-12-06 07:56:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884199236] [2022-12-06 07:56:28,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884199236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296759404] [2022-12-06 07:56:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:28,519 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:28,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-12-06 07:56:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:28,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:56:28,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:28,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:56:28,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 24 [2022-12-06 07:56:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:28,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:29,165 INFO L321 Elim1Store]: treesize reduction 42, result has 87.7 percent of original size [2022-12-06 07:56:29,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 174 treesize of output 340 [2022-12-06 07:56:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:29,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296759404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:29,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:29,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-06 07:56:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52453715] [2022-12-06 07:56:29,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:29,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:56:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:29,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:56:29,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:56:29,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 88 [2022-12-06 07:56:29,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 1326 transitions, 47209 flow. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:29,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:29,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 88 [2022-12-06 07:56:29,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:34,895 INFO L130 PetriNetUnfolder]: 4827/8997 cut-off events. [2022-12-06 07:56:34,895 INFO L131 PetriNetUnfolder]: For 609280/609565 co-relation queries the response was YES. [2022-12-06 07:56:34,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126209 conditions, 8997 events. 4827/8997 cut-off events. For 609280/609565 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 72830 event pairs, 1107 based on Foata normal form. 76/9073 useless extension candidates. Maximal degree in co-relation 125928. Up to 7202 conditions per place. [2022-12-06 07:56:35,015 INFO L137 encePairwiseOnDemand]: 34/88 looper letters, 1092 selfloop transitions, 293 changer transitions 9/1395 dead transitions. [2022-12-06 07:56:35,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1395 transitions, 51992 flow [2022-12-06 07:56:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:56:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:56:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-12-06 07:56:35,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21103896103896103 [2022-12-06 07:56:35,026 INFO L175 Difference]: Start difference. First operand has 412 places, 1326 transitions, 47209 flow. Second operand 7 states and 130 transitions. [2022-12-06 07:56:35,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1395 transitions, 51992 flow [2022-12-06 07:56:39,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 1395 transitions, 50589 flow, removed 662 selfloop flow, removed 7 redundant places. [2022-12-06 07:56:39,912 INFO L231 Difference]: Finished difference. Result has 414 places, 1339 transitions, 47695 flow [2022-12-06 07:56:39,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=45880, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=47695, PETRI_PLACES=414, PETRI_TRANSITIONS=1339} [2022-12-06 07:56:39,939 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 393 predicate places. [2022-12-06 07:56:39,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:39,939 INFO L89 Accepts]: Start accepts. Operand has 414 places, 1339 transitions, 47695 flow [2022-12-06 07:56:39,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:39,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:39,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 414 places, 1339 transitions, 47695 flow [2022-12-06 07:56:39,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 411 places, 1339 transitions, 47695 flow [2022-12-06 07:56:41,281 INFO L130 PetriNetUnfolder]: 1301/3812 cut-off events. [2022-12-06 07:56:41,281 INFO L131 PetriNetUnfolder]: For 293312/295561 co-relation queries the response was YES. [2022-12-06 07:56:41,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48479 conditions, 3812 events. 1301/3812 cut-off events. For 293312/295561 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 38833 event pairs, 44 based on Foata normal form. 376/4157 useless extension candidates. Maximal degree in co-relation 48200. Up to 1374 conditions per place. [2022-12-06 07:56:41,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 411 places, 1339 transitions, 47695 flow [2022-12-06 07:56:41,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 4298 [2022-12-06 07:56:41,362 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:41,362 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:42,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [528] L93-4-->L94-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) |v_ULTIMATE.start_main_#t~mem16#1_18|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 07:56:42,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [528] L93-4-->L94-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) |v_ULTIMATE.start_main_#t~mem16#1_18|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 07:56:42,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [528] L93-4-->L94-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) |v_ULTIMATE.start_main_#t~mem16#1_18|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 07:56:42,408 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:42,409 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:56:43,466 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:56:43,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3528 [2022-12-06 07:56:43,467 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 1337 transitions, 47687 flow [2022-12-06 07:56:43,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:43,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:43,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:43,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-12-06 07:56:43,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-12-06 07:56:43,675 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1895588635, now seen corresponding path program 1 times [2022-12-06 07:56:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:43,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806609756] [2022-12-06 07:56:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:43,747 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 07:56:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806609756] [2022-12-06 07:56:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806609756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:43,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:56:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031535114] [2022-12-06 07:56:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:43,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 88 [2022-12-06 07:56:43,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1337 transitions, 47687 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:43,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:43,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 88 [2022-12-06 07:56:43,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:49,650 INFO L130 PetriNetUnfolder]: 5457/10287 cut-off events. [2022-12-06 07:56:49,650 INFO L131 PetriNetUnfolder]: For 716976/717133 co-relation queries the response was YES. [2022-12-06 07:56:49,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144253 conditions, 10287 events. 5457/10287 cut-off events. For 716976/717133 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 85420 event pairs, 1983 based on Foata normal form. 36/10323 useless extension candidates. Maximal degree in co-relation 144050. Up to 5154 conditions per place. [2022-12-06 07:56:49,791 INFO L137 encePairwiseOnDemand]: 84/88 looper letters, 1527 selfloop transitions, 3 changer transitions 0/1531 dead transitions. [2022-12-06 07:56:49,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1531 transitions, 58087 flow [2022-12-06 07:56:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:56:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:56:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-12-06 07:56:49,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2022-12-06 07:56:49,792 INFO L175 Difference]: Start difference. First operand has 408 places, 1337 transitions, 47687 flow. Second operand 3 states and 103 transitions. [2022-12-06 07:56:49,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1531 transitions, 58087 flow [2022-12-06 07:56:55,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 1531 transitions, 57728 flow, removed 78 selfloop flow, removed 9 redundant places. [2022-12-06 07:56:55,976 INFO L231 Difference]: Finished difference. Result has 399 places, 1333 transitions, 47234 flow [2022-12-06 07:56:55,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=47228, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=47234, PETRI_PLACES=399, PETRI_TRANSITIONS=1333} [2022-12-06 07:56:55,977 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 378 predicate places. [2022-12-06 07:56:55,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:55,977 INFO L89 Accepts]: Start accepts. Operand has 399 places, 1333 transitions, 47234 flow [2022-12-06 07:56:55,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:55,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:55,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 1333 transitions, 47234 flow [2022-12-06 07:56:55,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 399 places, 1333 transitions, 47234 flow [2022-12-06 07:56:57,325 INFO L130 PetriNetUnfolder]: 1472/4422 cut-off events. [2022-12-06 07:56:57,326 INFO L131 PetriNetUnfolder]: For 337904/341127 co-relation queries the response was YES. [2022-12-06 07:56:57,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55597 conditions, 4422 events. 1472/4422 cut-off events. For 337904/341127 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 46577 event pairs, 57 based on Foata normal form. 461/4841 useless extension candidates. Maximal degree in co-relation 55148. Up to 1622 conditions per place. [2022-12-06 07:56:57,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 1333 transitions, 47234 flow [2022-12-06 07:56:57,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 4272 [2022-12-06 07:56:57,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [954] L65-2-->L94-1: Formula: (and (= (+ v_~q_front~0_1597 1) v_~q_front~0_1596) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1050| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_962| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_962|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1050| v_~s~0_1543) v_~s~0_1542) (= (select (select |v_#memory_int_1101| v_~q~0.base_748) (+ v_~q~0.offset_748 (* v_~q_front~0_1597 4))) |v_thread2Thread1of1ForFork1_~j~0#1_1050|) (= |v_ULTIMATE.start_main_#t~mem16#1_232| (select (select |v_#memory_int_1101| |v_ULTIMATE.start_main_~#t1~0#1.base_91|) |v_ULTIMATE.start_main_~#t1~0#1.offset_91|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_962| (ite (and (< v_~q_front~0_1597 v_~n~0_736) (< v_~q_front~0_1597 v_~q_back~0_1676) (<= 0 v_~q_front~0_1597)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_962| 0))) InVars {~q_back~0=v_~q_back~0_1676, #memory_int=|v_#memory_int_1101|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_91|, ~q~0.base=v_~q~0.base_748, ~n~0=v_~n~0_736, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_91|, ~q~0.offset=v_~q~0.offset_748, ~s~0=v_~s~0_1543, ~q_front~0=v_~q_front~0_1597} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1050|, ~q_back~0=v_~q_back~0_1676, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_232|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_962|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_962|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_91|, ~q~0.base=v_~q~0.base_748, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_91|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_962|, ~q~0.offset=v_~q~0.offset_748, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_962|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_354|, #memory_int=|v_#memory_int_1101|, ~n~0=v_~n~0_736, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_147|, ~s~0=v_~s~0_1542, ~q_front~0=v_~q_front~0_1596} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ULTIMATE.start_main_#t~nondet15#1, ~s~0, ~q_front~0] and [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:56:57,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:56:57,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:56:57,747 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:57,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1770 [2022-12-06 07:56:57,747 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 1332 transitions, 47242 flow [2022-12-06 07:56:57,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:57,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:57,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:57,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-06 07:56:57,748 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -939489979, now seen corresponding path program 1 times [2022-12-06 07:56:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:57,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613118096] [2022-12-06 07:56:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:57,804 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 07:56:57,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:57,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613118096] [2022-12-06 07:56:57,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613118096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:57,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:57,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741693689] [2022-12-06 07:56:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:56:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:56:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:56:57,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 88 [2022-12-06 07:56:57,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1332 transitions, 47242 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:57,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:57,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 88 [2022-12-06 07:56:57,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:03,204 INFO L130 PetriNetUnfolder]: 5081/9585 cut-off events. [2022-12-06 07:57:03,204 INFO L131 PetriNetUnfolder]: For 648448/648651 co-relation queries the response was YES. [2022-12-06 07:57:03,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132944 conditions, 9585 events. 5081/9585 cut-off events. For 648448/648651 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 78873 event pairs, 1260 based on Foata normal form. 65/9650 useless extension candidates. Maximal degree in co-relation 132211. Up to 8849 conditions per place. [2022-12-06 07:57:03,325 INFO L137 encePairwiseOnDemand]: 73/88 looper letters, 1126 selfloop transitions, 107 changer transitions 11/1245 dead transitions. [2022-12-06 07:57:03,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1245 transitions, 47150 flow [2022-12-06 07:57:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:57:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:57:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-06 07:57:03,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2431818181818182 [2022-12-06 07:57:03,326 INFO L175 Difference]: Start difference. First operand has 398 places, 1332 transitions, 47242 flow. Second operand 5 states and 107 transitions. [2022-12-06 07:57:03,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 1245 transitions, 47150 flow [2022-12-06 07:57:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1245 transitions, 46876 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-06 07:57:08,308 INFO L231 Difference]: Finished difference. Result has 386 places, 1222 transitions, 44058 flow [2022-12-06 07:57:08,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=44195, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=44058, PETRI_PLACES=386, PETRI_TRANSITIONS=1222} [2022-12-06 07:57:08,309 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 365 predicate places. [2022-12-06 07:57:08,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:08,309 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1222 transitions, 44058 flow [2022-12-06 07:57:08,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:08,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:08,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1222 transitions, 44058 flow [2022-12-06 07:57:08,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 1222 transitions, 44058 flow [2022-12-06 07:57:09,595 INFO L130 PetriNetUnfolder]: 1349/4078 cut-off events. [2022-12-06 07:57:09,595 INFO L131 PetriNetUnfolder]: For 292950/295411 co-relation queries the response was YES. [2022-12-06 07:57:09,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49858 conditions, 4078 events. 1349/4078 cut-off events. For 292950/295411 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 42617 event pairs, 47 based on Foata normal form. 396/4443 useless extension candidates. Maximal degree in co-relation 49438. Up to 1462 conditions per place. [2022-12-06 07:57:09,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 380 places, 1222 transitions, 44058 flow [2022-12-06 07:57:09,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 3982 [2022-12-06 07:57:09,681 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:09,681 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:09,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:09,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1462 [2022-12-06 07:57:09,771 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 1222 transitions, 44086 flow [2022-12-06 07:57:09,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:09,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:09,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:09,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-06 07:57:09,772 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 687872214, now seen corresponding path program 1 times [2022-12-06 07:57:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:09,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108436413] [2022-12-06 07:57:09,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:09,829 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 07:57:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:09,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108436413] [2022-12-06 07:57:09,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108436413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:57:09,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:57:09,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:57:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251608658] [2022-12-06 07:57:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:57:09,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:57:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:09,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:57:09,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:57:09,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 79 [2022-12-06 07:57:09,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1222 transitions, 44086 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:09,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:09,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 79 [2022-12-06 07:57:09,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:14,689 INFO L130 PetriNetUnfolder]: 4848/9237 cut-off events. [2022-12-06 07:57:14,690 INFO L131 PetriNetUnfolder]: For 640669/640925 co-relation queries the response was YES. [2022-12-06 07:57:14,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127468 conditions, 9237 events. 4848/9237 cut-off events. For 640669/640925 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 76190 event pairs, 1751 based on Foata normal form. 145/9382 useless extension candidates. Maximal degree in co-relation 126689. Up to 5077 conditions per place. [2022-12-06 07:57:14,811 INFO L137 encePairwiseOnDemand]: 69/79 looper letters, 1338 selfloop transitions, 12 changer transitions 25/1376 dead transitions. [2022-12-06 07:57:14,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1376 transitions, 52734 flow [2022-12-06 07:57:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:57:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:57:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-06 07:57:14,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2759493670886076 [2022-12-06 07:57:14,812 INFO L175 Difference]: Start difference. First operand has 380 places, 1222 transitions, 44086 flow. Second operand 5 states and 109 transitions. [2022-12-06 07:57:14,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1376 transitions, 52734 flow [2022-12-06 07:57:19,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1376 transitions, 52311 flow, removed 52 selfloop flow, removed 8 redundant places. [2022-12-06 07:57:19,327 INFO L231 Difference]: Finished difference. Result has 376 places, 1161 transitions, 41810 flow [2022-12-06 07:57:19,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=42456, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=41810, PETRI_PLACES=376, PETRI_TRANSITIONS=1161} [2022-12-06 07:57:19,328 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 355 predicate places. [2022-12-06 07:57:19,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:19,328 INFO L89 Accepts]: Start accepts. Operand has 376 places, 1161 transitions, 41810 flow [2022-12-06 07:57:19,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:19,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:19,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 1161 transitions, 41810 flow [2022-12-06 07:57:19,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 374 places, 1161 transitions, 41810 flow [2022-12-06 07:57:20,692 INFO L130 PetriNetUnfolder]: 1266/3918 cut-off events. [2022-12-06 07:57:20,693 INFO L131 PetriNetUnfolder]: For 280851/283248 co-relation queries the response was YES. [2022-12-06 07:57:20,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47781 conditions, 3918 events. 1266/3918 cut-off events. For 280851/283248 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 40963 event pairs, 49 based on Foata normal form. 396/4280 useless extension candidates. Maximal degree in co-relation 47345. Up to 1396 conditions per place. [2022-12-06 07:57:20,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 1161 transitions, 41810 flow [2022-12-06 07:57:20,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 3772 [2022-12-06 07:57:20,880 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:20,880 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:20,880 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:20,880 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:20,880 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:20,880 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:21,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [835] $Ultimate##0-->L47-4: Formula: (let ((.cse6 (+ v_~q_front~0_1068 2)) (.cse3 (select |v_#memory_int_861| v_~q~0.base_589)) (.cse7 (* v_~q_front~0_1068 4))) (let ((.cse0 (select .cse3 (+ .cse7 v_~q~0.offset_589))) (.cse2 (< .cse6 v_~q_back~0_1231)) (.cse4 (* v_~q_back~0_1231 4)) (.cse5 (* v_~q_back~0_1233 4))) (and (= (+ .cse0 v_~s~0_996 |v_thread2Thread1of1ForFork1_~j~0#1_658|) v_~s~0_995) (= |v_thread1Thread1of1ForFork0_~i~0#1_637| 5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| (ite (let ((.cse1 (+ v_~q_front~0_1068 1))) (and (< .cse1 v_~n~0_580) (<= 0 .cse1) .cse2)) 1 0)) (= (ite (= (select .cse3 (+ .cse4 (- 4) v_~q~0.offset_589)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633|) (< |v_thread1Thread1of1ForFork0_~i~0#1_637| (+ v_~N~0_454 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633|) (not (= .cse0 0)) (not (= (ite (and (< v_~q_front~0_1068 v_~n~0_580) .cse2 (<= 0 v_~q_front~0_1068)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_604|) (not (= 0 (ite (= (select .cse3 (+ .cse5 8 v_~q~0.offset_589)) 1) 1 0))) (= v_~q_front~0_1067 .cse6) (not (= (ite (and (<= 0 v_~q_back~0_1233) (< v_~q_back~0_1233 v_~n~0_580)) 1 0) 0)) (not (= (ite (= (select .cse3 (+ .cse4 v_~q~0.offset_589 (- 8))) 1) 1 0) 0)) (not (= (ite (= (select .cse3 (+ .cse5 v_~q~0.offset_589 4)) 1) 1 0) 0)) (= (select .cse3 (+ .cse7 v_~q~0.offset_589 4)) |v_thread2Thread1of1ForFork1_~j~0#1_658|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_658| 0)) (= (+ 5 v_~q_back~0_1233) v_~q_back~0_1231) (not (= (ite (= (select .cse3 (+ .cse5 v_~q~0.offset_589)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633| 0)) (not (= (ite (and (< v_~q_back~0_1231 (+ v_~n~0_580 1)) (<= 1 v_~q_back~0_1231)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1233, #memory_int=|v_#memory_int_861|, ~N~0=v_~N~0_454, ~q~0.base=v_~q~0.base_589, ~n~0=v_~n~0_580, ~q~0.offset=v_~q~0.offset_589, ~s~0=v_~s~0_996, ~q_front~0=v_~q_front~0_1068} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_658|, ~q_back~0=v_~q_back~0_1231, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_445|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_604|, ~N~0=v_~N~0_454, ~q~0.base=v_~q~0.base_589, ~q~0.offset=v_~q~0.offset_589, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_604|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_604|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_449|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_445|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_637|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633|, #memory_int=|v_#memory_int_861|, ~n~0=v_~n~0_580, ~s~0=v_~s~0_995, ~q_front~0=v_~q_front~0_1067} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [961] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1111| v_~q~0.base_758)) (.cse1 (* v_~q_front~0_1620 4))) (let ((.cse2 (select .cse0 (+ .cse1 v_~q~0.offset_758)))) (and (= |v_thread2Thread1of1ForFork1_~j~0#1_1062| (select .cse0 (+ .cse1 v_~q~0.offset_758 4))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_974| 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1062| .cse2 v_~s~0_1566) v_~s~0_1564) (= (+ v_~q_front~0_1620 2) v_~q_front~0_1618) (not (= (ite (and (<= 0 v_~q_front~0_1620) (< v_~q_front~0_1620 v_~n~0_746) (< v_~q_front~0_1620 v_~q_back~0_1692)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_974| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_974|) (not (= .cse2 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_974| (ite (let ((.cse3 (+ v_~q_front~0_1620 1))) (and (<= 0 .cse3) (< .cse3 v_~n~0_746) (< .cse3 v_~q_back~0_1692))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1062| 0))))) InVars {~q_back~0=v_~q_back~0_1692, #memory_int=|v_#memory_int_1111|, ~q~0.base=v_~q~0.base_758, ~n~0=v_~n~0_746, ~q~0.offset=v_~q~0.offset_758, ~s~0=v_~s~0_1566, ~q_front~0=v_~q_front~0_1620} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_974|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1062|, ~q_back~0=v_~q_back~0_1692, #memory_int=|v_#memory_int_1111|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_974|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_974|, ~q~0.base=v_~q~0.base_758, ~n~0=v_~n~0_746, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_974|, ~q~0.offset=v_~q~0.offset_758, ~s~0=v_~s~0_1564, ~q_front~0=v_~q_front~0_1618} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:57:22,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [835] $Ultimate##0-->L47-4: Formula: (let ((.cse6 (+ v_~q_front~0_1068 2)) (.cse3 (select |v_#memory_int_861| v_~q~0.base_589)) (.cse7 (* v_~q_front~0_1068 4))) (let ((.cse0 (select .cse3 (+ .cse7 v_~q~0.offset_589))) (.cse2 (< .cse6 v_~q_back~0_1231)) (.cse4 (* v_~q_back~0_1231 4)) (.cse5 (* v_~q_back~0_1233 4))) (and (= (+ .cse0 v_~s~0_996 |v_thread2Thread1of1ForFork1_~j~0#1_658|) v_~s~0_995) (= |v_thread1Thread1of1ForFork0_~i~0#1_637| 5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| (ite (let ((.cse1 (+ v_~q_front~0_1068 1))) (and (< .cse1 v_~n~0_580) (<= 0 .cse1) .cse2)) 1 0)) (= (ite (= (select .cse3 (+ .cse4 (- 4) v_~q~0.offset_589)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633|) (< |v_thread1Thread1of1ForFork0_~i~0#1_637| (+ v_~N~0_454 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633|) (not (= .cse0 0)) (not (= (ite (and (< v_~q_front~0_1068 v_~n~0_580) .cse2 (<= 0 v_~q_front~0_1068)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_604|) (not (= 0 (ite (= (select .cse3 (+ .cse5 8 v_~q~0.offset_589)) 1) 1 0))) (= v_~q_front~0_1067 .cse6) (not (= (ite (and (<= 0 v_~q_back~0_1233) (< v_~q_back~0_1233 v_~n~0_580)) 1 0) 0)) (not (= (ite (= (select .cse3 (+ .cse4 v_~q~0.offset_589 (- 8))) 1) 1 0) 0)) (not (= (ite (= (select .cse3 (+ .cse5 v_~q~0.offset_589 4)) 1) 1 0) 0)) (= (select .cse3 (+ .cse7 v_~q~0.offset_589 4)) |v_thread2Thread1of1ForFork1_~j~0#1_658|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_658| 0)) (= (+ 5 v_~q_back~0_1233) v_~q_back~0_1231) (not (= (ite (= (select .cse3 (+ .cse5 v_~q~0.offset_589)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633| 0)) (not (= (ite (and (< v_~q_back~0_1231 (+ v_~n~0_580 1)) (<= 1 v_~q_back~0_1231)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1233, #memory_int=|v_#memory_int_861|, ~N~0=v_~N~0_454, ~q~0.base=v_~q~0.base_589, ~n~0=v_~n~0_580, ~q~0.offset=v_~q~0.offset_589, ~s~0=v_~s~0_996, ~q_front~0=v_~q_front~0_1068} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_658|, ~q_back~0=v_~q_back~0_1231, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_445|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_604|, ~N~0=v_~N~0_454, ~q~0.base=v_~q~0.base_589, ~q~0.offset=v_~q~0.offset_589, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_604|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_604|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_449|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_445|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_637|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633|, #memory_int=|v_#memory_int_861|, ~n~0=v_~n~0_580, ~s~0=v_~s~0_995, ~q_front~0=v_~q_front~0_1067} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:57:23,188 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:57:23,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3860 [2022-12-06 07:57:23,188 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 1161 transitions, 41905 flow [2022-12-06 07:57:23,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:23,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:23,189 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:23,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-06 07:57:23,189 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1238451183, now seen corresponding path program 1 times [2022-12-06 07:57:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078448574] [2022-12-06 07:57:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:23,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:24,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078448574] [2022-12-06 07:57:24,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078448574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:57:24,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908809704] [2022-12-06 07:57:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:24,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:24,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:57:24,031 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:57:24,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-12-06 07:57:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:24,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 07:57:24,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:57:24,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:57:24,409 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 30 treesize of output 30 [2022-12-06 07:57:24,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:57:24,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 07:57:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:24,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:24,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:57:24,602 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 131 treesize of output 132 [2022-12-06 07:57:24,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:57:24,609 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 71 treesize of output 58 [2022-12-06 07:57:24,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:57:24,615 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 58 treesize of output 45 [2022-12-06 07:57:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:57:24,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908809704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:24,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:24,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 16 [2022-12-06 07:57:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845890180] [2022-12-06 07:57:24,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:57:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:57:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:57:24,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 76 [2022-12-06 07:57:24,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1161 transitions, 41905 flow. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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 07:57:24,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:24,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 76 [2022-12-06 07:57:24,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:29,962 INFO L130 PetriNetUnfolder]: 4815/9177 cut-off events. [2022-12-06 07:57:29,963 INFO L131 PetriNetUnfolder]: For 612266/612540 co-relation queries the response was YES. [2022-12-06 07:57:30,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125761 conditions, 9177 events. 4815/9177 cut-off events. For 612266/612540 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 75573 event pairs, 1524 based on Foata normal form. 66/9243 useless extension candidates. Maximal degree in co-relation 125001. Up to 9001 conditions per place. [2022-12-06 07:57:30,087 INFO L137 encePairwiseOnDemand]: 29/76 looper letters, 1105 selfloop transitions, 58 changer transitions 39/1203 dead transitions. [2022-12-06 07:57:30,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1203 transitions, 44807 flow [2022-12-06 07:57:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:57:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:57:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2022-12-06 07:57:30,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14285714285714285 [2022-12-06 07:57:30,089 INFO L175 Difference]: Start difference. First operand has 374 places, 1161 transitions, 41905 flow. Second operand 14 states and 152 transitions. [2022-12-06 07:57:30,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1203 transitions, 44807 flow [2022-12-06 07:57:34,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1203 transitions, 44632 flow, removed 73 selfloop flow, removed 5 redundant places. [2022-12-06 07:57:34,431 INFO L231 Difference]: Finished difference. Result has 386 places, 1150 transitions, 41397 flow [2022-12-06 07:57:34,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=41730, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=41397, PETRI_PLACES=386, PETRI_TRANSITIONS=1150} [2022-12-06 07:57:34,432 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 365 predicate places. [2022-12-06 07:57:34,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:34,432 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1150 transitions, 41397 flow [2022-12-06 07:57:34,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:34,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:34,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1150 transitions, 41397 flow [2022-12-06 07:57:34,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 379 places, 1150 transitions, 41397 flow [2022-12-06 07:57:35,533 INFO L130 PetriNetUnfolder]: 1261/3881 cut-off events. [2022-12-06 07:57:35,534 INFO L131 PetriNetUnfolder]: For 277143/279501 co-relation queries the response was YES. [2022-12-06 07:57:35,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47494 conditions, 3881 events. 1261/3881 cut-off events. For 277143/279501 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 40447 event pairs, 51 based on Foata normal form. 387/4235 useless extension candidates. Maximal degree in co-relation 47323. Up to 1389 conditions per place. [2022-12-06 07:57:35,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 1150 transitions, 41397 flow [2022-12-06 07:57:35,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 3726 [2022-12-06 07:57:46,280 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:57:46,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11849 [2022-12-06 07:57:46,281 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 1149 transitions, 41475 flow [2022-12-06 07:57:46,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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 07:57:46,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:46,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:46,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-12-06 07:57:46,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-12-06 07:57:46,481 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash 193466497, now seen corresponding path program 1 times [2022-12-06 07:57:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:46,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797747808] [2022-12-06 07:57:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:47,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:57:47,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797747808] [2022-12-06 07:57:47,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797747808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:57:47,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493941312] [2022-12-06 07:57:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:47,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:47,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:57:47,082 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:57:47,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-12-06 07:57:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:57:47,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 07:57:47,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:57:47,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:57:47,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 24 [2022-12-06 07:57:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:47,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:57:47,894 INFO L321 Elim1Store]: treesize reduction 42, result has 87.7 percent of original size [2022-12-06 07:57:47,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 174 treesize of output 340 [2022-12-06 07:57:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:57:48,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493941312] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:57:48,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:57:48,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-06 07:57:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061259495] [2022-12-06 07:57:48,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:57:48,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:57:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:57:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:57:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:57:48,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 72 [2022-12-06 07:57:48,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1149 transitions, 41475 flow. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:48,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:57:48,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 72 [2022-12-06 07:57:48,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:53,561 INFO L130 PetriNetUnfolder]: 4784/9106 cut-off events. [2022-12-06 07:57:53,561 INFO L131 PetriNetUnfolder]: For 629239/629630 co-relation queries the response was YES. [2022-12-06 07:57:53,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124625 conditions, 9106 events. 4784/9106 cut-off events. For 629239/629630 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 74912 event pairs, 1525 based on Foata normal form. 91/9195 useless extension candidates. Maximal degree in co-relation 124428. Up to 7744 conditions per place. [2022-12-06 07:57:53,674 INFO L137 encePairwiseOnDemand]: 24/72 looper letters, 971 selfloop transitions, 214 changer transitions 15/1201 dead transitions. [2022-12-06 07:57:53,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1201 transitions, 44835 flow [2022-12-06 07:57:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:57:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:57:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-12-06 07:57:53,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16792929292929293 [2022-12-06 07:57:53,676 INFO L175 Difference]: Start difference. First operand has 378 places, 1149 transitions, 41475 flow. Second operand 11 states and 133 transitions. [2022-12-06 07:57:53,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 1201 transitions, 44835 flow [2022-12-06 07:57:57,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1201 transitions, 44585 flow, removed 44 selfloop flow, removed 13 redundant places. [2022-12-06 07:57:57,652 INFO L231 Difference]: Finished difference. Result has 378 places, 1148 transitions, 41744 flow [2022-12-06 07:57:57,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=41237, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=41744, PETRI_PLACES=378, PETRI_TRANSITIONS=1148} [2022-12-06 07:57:57,653 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 357 predicate places. [2022-12-06 07:57:57,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:57,653 INFO L89 Accepts]: Start accepts. Operand has 378 places, 1148 transitions, 41744 flow [2022-12-06 07:57:57,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:57,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:57,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 378 places, 1148 transitions, 41744 flow [2022-12-06 07:57:57,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 374 places, 1148 transitions, 41744 flow [2022-12-06 07:57:58,770 INFO L130 PetriNetUnfolder]: 1261/3883 cut-off events. [2022-12-06 07:57:58,771 INFO L131 PetriNetUnfolder]: For 284023/286693 co-relation queries the response was YES. [2022-12-06 07:57:58,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47712 conditions, 3883 events. 1261/3883 cut-off events. For 284023/286693 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 40380 event pairs, 49 based on Foata normal form. 396/4240 useless extension candidates. Maximal degree in co-relation 47269. Up to 1392 conditions per place. [2022-12-06 07:57:58,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 1148 transitions, 41744 flow [2022-12-06 07:57:58,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 3726 [2022-12-06 07:57:58,849 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:58,849 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:58,849 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:58,849 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:58,849 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:58,849 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:57:59,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:57:59,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1861 [2022-12-06 07:57:59,514 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1147 transitions, 41734 flow [2022-12-06 07:57:59,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:57:59,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:57:59,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:57:59,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-12-06 07:57:59,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:57:59,715 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:57:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:57:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash 114622606, now seen corresponding path program 1 times [2022-12-06 07:57:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:57:59,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213183542] [2022-12-06 07:57:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:57:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:57:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:00,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213183542] [2022-12-06 07:58:00,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213183542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:00,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713698611] [2022-12-06 07:58:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:00,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:00,960 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:00,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-12-06 07:58:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:01,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 07:58:01,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:01,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:01,310 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 07:58:01,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:01,375 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 46 treesize of output 12 [2022-12-06 07:58:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:01,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:01,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:01,536 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 152 treesize of output 153 [2022-12-06 07:58:01,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:01,548 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 97 treesize of output 90 [2022-12-06 07:58:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:01,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713698611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:01,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:01,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 07:58:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469588241] [2022-12-06 07:58:01,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:01,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:58:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:58:01,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:58:01,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 71 [2022-12-06 07:58:01,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1147 transitions, 41734 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:58:01,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:01,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 71 [2022-12-06 07:58:01,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:06,883 INFO L130 PetriNetUnfolder]: 4907/9355 cut-off events. [2022-12-06 07:58:06,883 INFO L131 PetriNetUnfolder]: For 607346/607548 co-relation queries the response was YES. [2022-12-06 07:58:06,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128088 conditions, 9355 events. 4907/9355 cut-off events. For 607346/607548 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 77580 event pairs, 575 based on Foata normal form. 94/9449 useless extension candidates. Maximal degree in co-relation 127358. Up to 8158 conditions per place. [2022-12-06 07:58:06,991 INFO L137 encePairwiseOnDemand]: 13/71 looper letters, 955 selfloop transitions, 287 changer transitions 24/1267 dead transitions. [2022-12-06 07:58:06,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1267 transitions, 46590 flow [2022-12-06 07:58:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 07:58:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 07:58:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 186 transitions. [2022-12-06 07:58:06,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12474849094567404 [2022-12-06 07:58:06,991 INFO L175 Difference]: Start difference. First operand has 373 places, 1147 transitions, 41734 flow. Second operand 21 states and 186 transitions. [2022-12-06 07:58:06,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 1267 transitions, 46590 flow [2022-12-06 07:58:11,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1267 transitions, 46358 flow, removed 41 selfloop flow, removed 8 redundant places. [2022-12-06 07:58:11,301 INFO L231 Difference]: Finished difference. Result has 394 places, 1184 transitions, 43533 flow [2022-12-06 07:58:11,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=41520, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=43533, PETRI_PLACES=394, PETRI_TRANSITIONS=1184} [2022-12-06 07:58:11,302 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 373 predicate places. [2022-12-06 07:58:11,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:11,302 INFO L89 Accepts]: Start accepts. Operand has 394 places, 1184 transitions, 43533 flow [2022-12-06 07:58:11,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:11,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:11,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 394 places, 1184 transitions, 43533 flow [2022-12-06 07:58:11,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 1184 transitions, 43533 flow [2022-12-06 07:58:12,518 INFO L130 PetriNetUnfolder]: 1285/3976 cut-off events. [2022-12-06 07:58:12,519 INFO L131 PetriNetUnfolder]: For 287834/290245 co-relation queries the response was YES. [2022-12-06 07:58:12,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48909 conditions, 3976 events. 1285/3976 cut-off events. For 287834/290245 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 41833 event pairs, 57 based on Foata normal form. 394/4333 useless extension candidates. Maximal degree in co-relation 48659. Up to 1416 conditions per place. [2022-12-06 07:58:12,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 391 places, 1184 transitions, 43533 flow [2022-12-06 07:58:12,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 3828 [2022-12-06 07:58:12,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:58:12,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:58:12,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:58:13,091 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,091 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,092 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,092 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,092 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,092 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,303 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,303 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,303 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,303 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,303 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,303 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [909] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1016| v_~q~0.base_684))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_831| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_831|) (= (+ v_~q_front~0_1398 1) v_~q_front~0_1397) (= (select .cse0 (+ (* v_~q_front~0_1398 4) v_~q~0.offset_684)) |v_thread2Thread1of1ForFork1_~j~0#1_910|) (= (+ v_~s~0_1336 |v_thread2Thread1of1ForFork1_~j~0#1_910|) v_~s~0_1335) (< |v_thread1Thread1of1ForFork0_~i~0#1_829| v_~N~0_526) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_821| (ite (= (select .cse0 (+ (* v_~q_back~0_1513 4) v_~q~0.offset_684)) 1) 1 0)) (= (+ v_~q_back~0_1513 1) v_~q_back~0_1512) (not (= (ite (and (<= 0 v_~q_back~0_1513) (< v_~q_back~0_1513 v_~n~0_672)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_831| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_821| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_821|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_831| (ite (and (< v_~q_front~0_1398 v_~q_back~0_1513) (< v_~q_front~0_1398 v_~n~0_672) (<= 0 v_~q_front~0_1398)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_828| (+ |v_thread1Thread1of1ForFork0_~i~0#1_829| 1)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_910| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_821| 0)))) InVars {~q_back~0=v_~q_back~0_1513, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_829|, #memory_int=|v_#memory_int_1016|, ~N~0=v_~N~0_526, ~q~0.base=v_~q~0.base_684, ~n~0=v_~n~0_672, ~q~0.offset=v_~q~0.offset_684, ~s~0=v_~s~0_1336, ~q_front~0=v_~q_front~0_1398} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_910|, ~q_back~0=v_~q_back~0_1512, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_831|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_592|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_831|, ~N~0=v_~N~0_526, ~q~0.base=v_~q~0.base_684, ~q~0.offset=v_~q~0.offset_684, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_831|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_831|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_821|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_596|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_592|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_828|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_821|, #memory_int=|v_#memory_int_1016|, ~n~0=v_~n~0_672, ~s~0=v_~s~0_1335, ~q_front~0=v_~q_front~0_1397} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:58:13,654 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,654 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,654 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,654 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,654 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,654 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:13,871 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:58:13,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2569 [2022-12-06 07:58:13,872 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 1181 transitions, 43532 flow [2022-12-06 07:58:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 07:58:13,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:13,872 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:13,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-12-06 07:58:14,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:14,078 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1264440987, now seen corresponding path program 1 times [2022-12-06 07:58:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:14,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855093440] [2022-12-06 07:58:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855093440] [2022-12-06 07:58:14,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855093440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282886521] [2022-12-06 07:58:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:14,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:14,462 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:14,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-12-06 07:58:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:14,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 07:58:14,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:14,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:14,858 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:58:14,858 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 27 treesize of output 16 [2022-12-06 07:58:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:14,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282886521] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:14,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:14,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-06 07:58:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199883658] [2022-12-06 07:58:14,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:14,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:58:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:14,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:58:14,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:58:14,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2022-12-06 07:58:14,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1181 transitions, 43532 flow. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:14,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:14,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2022-12-06 07:58:14,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:20,258 INFO L130 PetriNetUnfolder]: 4965/9429 cut-off events. [2022-12-06 07:58:20,258 INFO L131 PetriNetUnfolder]: For 668437/668804 co-relation queries the response was YES. [2022-12-06 07:58:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130758 conditions, 9429 events. 4965/9429 cut-off events. For 668437/668804 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 78298 event pairs, 920 based on Foata normal form. 205/9634 useless extension candidates. Maximal degree in co-relation 130387. Up to 7198 conditions per place. [2022-12-06 07:58:20,369 INFO L137 encePairwiseOnDemand]: 24/75 looper letters, 919 selfloop transitions, 393 changer transitions 3/1316 dead transitions. [2022-12-06 07:58:20,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1316 transitions, 49318 flow [2022-12-06 07:58:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:58:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:58:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2022-12-06 07:58:20,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16444444444444445 [2022-12-06 07:58:20,370 INFO L175 Difference]: Start difference. First operand has 388 places, 1181 transitions, 43532 flow. Second operand 12 states and 148 transitions. [2022-12-06 07:58:20,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1316 transitions, 49318 flow [2022-12-06 07:58:25,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1316 transitions, 49069 flow, removed 101 selfloop flow, removed 4 redundant places. [2022-12-06 07:58:25,079 INFO L231 Difference]: Finished difference. Result has 398 places, 1209 transitions, 45616 flow [2022-12-06 07:58:25,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=43283, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=45616, PETRI_PLACES=398, PETRI_TRANSITIONS=1209} [2022-12-06 07:58:25,084 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 377 predicate places. [2022-12-06 07:58:25,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:25,084 INFO L89 Accepts]: Start accepts. Operand has 398 places, 1209 transitions, 45616 flow [2022-12-06 07:58:25,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:25,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:25,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 398 places, 1209 transitions, 45616 flow [2022-12-06 07:58:25,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 1209 transitions, 45616 flow [2022-12-06 07:58:26,290 INFO L130 PetriNetUnfolder]: 1311/4033 cut-off events. [2022-12-06 07:58:26,290 INFO L131 PetriNetUnfolder]: For 305691/308266 co-relation queries the response was YES. [2022-12-06 07:58:26,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50935 conditions, 4033 events. 1311/4033 cut-off events. For 305691/308266 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 42393 event pairs, 59 based on Foata normal form. 378/4374 useless extension candidates. Maximal degree in co-relation 50700. Up to 1444 conditions per place. [2022-12-06 07:58:26,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 1209 transitions, 45616 flow [2022-12-06 07:58:26,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 3922 [2022-12-06 07:58:26,374 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:26,374 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:26,374 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:26,374 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:26,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [983] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1171| v_~q~0.base_791)) (.cse1 (* v_~q_back~0_1758 4))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_981| 4) (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_791)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_967|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_791 4)) 1) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_372| |v_#pthreadsForks_419|) (= (+ v_~q_back~0_1758 4) v_~q_back~0_1756) (not (= (ite (= (select (select |v_#memory_int_1172| v_~q~0.base_791) (+ .cse1 v_~q~0.offset_791)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_967| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_967|) (not (= (ite (and (<= 0 v_~q_back~0_1758) (< v_~q_back~0_1758 v_~n~0_774)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_791)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 3 v_~q_back~0_1758))) (and (< .cse2 v_~n~0_774) (<= 0 .cse2))) 1 0) 0)) (= (+ |v_#pthreadsForks_419| 1) |v_#pthreadsForks_418|) (= |v_#memory_int_1171| (store |v_#memory_int_1172| |v_ULTIMATE.start_main_~#t2~0#1.base_193| (store (select |v_#memory_int_1172| |v_ULTIMATE.start_main_~#t2~0#1.base_193|) |v_ULTIMATE.start_main_~#t2~0#1.offset_190| |v_ULTIMATE.start_main_#t~pre14#1_372|))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_967| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_981| (+ v_~N~0_620 1)))) InVars {~q_back~0=v_~q_back~0_1758, #pthreadsForks=|v_#pthreadsForks_419|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_190|, #memory_int=|v_#memory_int_1172|, ~N~0=v_~N~0_620, ~q~0.base=v_~q~0.base_791, ~n~0=v_~n~0_774, ~q~0.offset=v_~q~0.offset_791, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_193|} OutVars{~q_back~0=v_~q_back~0_1756, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_190|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_714|, ~N~0=v_~N~0_620, ~q~0.base=v_~q~0.base_791, ~q~0.offset=v_~q~0.offset_791, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_967|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_317|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_718|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_372|, #pthreadsForks=|v_#pthreadsForks_418|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_714|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_981|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_967|, #memory_int=|v_#memory_int_1171|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_268|, ~n~0=v_~n~0_774, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_193|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:58:26,900 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:58:26,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1816 [2022-12-06 07:58:26,901 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 1209 transitions, 45714 flow [2022-12-06 07:58:26,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:26,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:26,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:26,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:27,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:27,107 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1201381026, now seen corresponding path program 1 times [2022-12-06 07:58:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:27,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218544286] [2022-12-06 07:58:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218544286] [2022-12-06 07:58:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218544286] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136732822] [2022-12-06 07:58:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:28,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:28,269 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-12-06 07:58:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:28,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:58:28,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:28,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:28,710 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 92 treesize of output 20 [2022-12-06 07:58:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:28,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:28,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:28,822 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 151 treesize of output 253 [2022-12-06 07:58:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:28,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136732822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:28,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:28,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-12-06 07:58:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172978559] [2022-12-06 07:58:28,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:28,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:58:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:28,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:58:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:58:28,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 76 [2022-12-06 07:58:28,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1209 transitions, 45714 flow. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:28,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:28,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 76 [2022-12-06 07:58:28,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:34,275 INFO L130 PetriNetUnfolder]: 4961/9426 cut-off events. [2022-12-06 07:58:34,275 INFO L131 PetriNetUnfolder]: For 686156/686502 co-relation queries the response was YES. [2022-12-06 07:58:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133217 conditions, 9426 events. 4961/9426 cut-off events. For 686156/686502 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 78045 event pairs, 1740 based on Foata normal form. 50/9476 useless extension candidates. Maximal degree in co-relation 132568. Up to 9238 conditions per place. [2022-12-06 07:58:34,385 INFO L137 encePairwiseOnDemand]: 20/76 looper letters, 1108 selfloop transitions, 112 changer transitions 9/1230 dead transitions. [2022-12-06 07:58:34,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1230 transitions, 48268 flow [2022-12-06 07:58:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:58:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:58:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2022-12-06 07:58:34,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1519138755980861 [2022-12-06 07:58:34,386 INFO L175 Difference]: Start difference. First operand has 397 places, 1209 transitions, 45714 flow. Second operand 11 states and 127 transitions. [2022-12-06 07:58:34,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 1230 transitions, 48268 flow [2022-12-06 07:58:38,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1230 transitions, 47546 flow, removed 303 selfloop flow, removed 4 redundant places. [2022-12-06 07:58:38,686 INFO L231 Difference]: Finished difference. Result has 404 places, 1209 transitions, 45177 flow [2022-12-06 07:58:38,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=44900, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1095, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=45177, PETRI_PLACES=404, PETRI_TRANSITIONS=1209} [2022-12-06 07:58:38,687 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 383 predicate places. [2022-12-06 07:58:38,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:38,687 INFO L89 Accepts]: Start accepts. Operand has 404 places, 1209 transitions, 45177 flow [2022-12-06 07:58:38,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:38,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:38,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 404 places, 1209 transitions, 45177 flow [2022-12-06 07:58:38,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 1209 transitions, 45177 flow [2022-12-06 07:58:39,832 INFO L130 PetriNetUnfolder]: 1311/4030 cut-off events. [2022-12-06 07:58:39,832 INFO L131 PetriNetUnfolder]: For 301508/304118 co-relation queries the response was YES. [2022-12-06 07:58:39,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50584 conditions, 4030 events. 1311/4030 cut-off events. For 301508/304118 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 42330 event pairs, 58 based on Foata normal form. 376/4370 useless extension candidates. Maximal degree in co-relation 50207. Up to 1445 conditions per place. [2022-12-06 07:58:39,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 1209 transitions, 45177 flow [2022-12-06 07:58:39,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 3918 [2022-12-06 07:58:39,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (* v_~q_back~0_1288 4)) (.cse0 (select |v_#memory_int_882| v_~q~0.base_603)) (.cse4 (* v_~q_front~0_1133 4))) (and (= v_~q_back~0_1287 (+ 3 v_~q_back~0_1288)) (< |v_thread1Thread1of1ForFork0_~i~0#1_677| (+ v_~N~0_468 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_603)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_603 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_677| 3) (not (= (ite (and (<= 0 v_~q_front~0_1133) (< v_~q_front~0_1133 v_~n~0_594) (< v_~q_front~0_1133 v_~q_back~0_1287)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_647| 0)) (not (= (+ v_~s~0_1061 |v_thread2Thread1of1ForFork1_~j~0#1_707|) v_~s~0_1059)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_676| 0)) (not (= 0 (ite (and (<= 0 v_~q_back~0_1288) (< v_~q_back~0_1288 v_~n~0_594)) 1 0))) (= v_~q_front~0_1131 (+ v_~q_front~0_1133 2)) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_603)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_676|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1288))) (and (<= 0 .cse2) (< .cse2 v_~n~0_594))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_647| (ite (let ((.cse3 (+ v_~q_front~0_1133 1))) (and (< .cse3 v_~q_back~0_1287) (< .cse3 v_~n~0_594) (<= 0 .cse3))) 1 0)) (= (select .cse0 (+ v_~q~0.offset_603 4 .cse4)) |v_thread2Thread1of1ForFork1_~j~0#1_707|) (= (+ (select .cse0 (+ v_~q~0.offset_603 .cse4)) v_~s~0_1061 |v_thread2Thread1of1ForFork1_~j~0#1_707|) v_~s~0_1059) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_707| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_647| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_647|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_676| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_676|))) InVars {~q_back~0=v_~q_back~0_1288, #memory_int=|v_#memory_int_882|, ~N~0=v_~N~0_468, ~q~0.base=v_~q~0.base_603, ~n~0=v_~n~0_594, ~q~0.offset=v_~q~0.offset_603, ~s~0=v_~s~0_1061, ~q_front~0=v_~q_front~0_1133} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_707|, ~q_back~0=v_~q_back~0_1287, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_647|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_647|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_480|, ~N~0=v_~N~0_468, ~q~0.base=v_~q~0.base_603, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_647|, ~q~0.offset=v_~q~0.offset_603, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_647|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_676|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_484|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_480|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_677|, #memory_int=|v_#memory_int_882|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_676|, ~n~0=v_~n~0_594, ~s~0=v_~s~0_1059, ~q_front~0=v_~q_front~0_1131} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:58:40,341 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:40,341 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:40,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (* v_~q_back~0_1288 4)) (.cse0 (select |v_#memory_int_882| v_~q~0.base_603)) (.cse4 (* v_~q_front~0_1133 4))) (and (= v_~q_back~0_1287 (+ 3 v_~q_back~0_1288)) (< |v_thread1Thread1of1ForFork0_~i~0#1_677| (+ v_~N~0_468 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_603)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_603 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_677| 3) (not (= (ite (and (<= 0 v_~q_front~0_1133) (< v_~q_front~0_1133 v_~n~0_594) (< v_~q_front~0_1133 v_~q_back~0_1287)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_647| 0)) (not (= (+ v_~s~0_1061 |v_thread2Thread1of1ForFork1_~j~0#1_707|) v_~s~0_1059)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_676| 0)) (not (= 0 (ite (and (<= 0 v_~q_back~0_1288) (< v_~q_back~0_1288 v_~n~0_594)) 1 0))) (= v_~q_front~0_1131 (+ v_~q_front~0_1133 2)) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_603)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_676|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1288))) (and (<= 0 .cse2) (< .cse2 v_~n~0_594))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_647| (ite (let ((.cse3 (+ v_~q_front~0_1133 1))) (and (< .cse3 v_~q_back~0_1287) (< .cse3 v_~n~0_594) (<= 0 .cse3))) 1 0)) (= (select .cse0 (+ v_~q~0.offset_603 4 .cse4)) |v_thread2Thread1of1ForFork1_~j~0#1_707|) (= (+ (select .cse0 (+ v_~q~0.offset_603 .cse4)) v_~s~0_1061 |v_thread2Thread1of1ForFork1_~j~0#1_707|) v_~s~0_1059) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_707| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_647| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_647|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_676| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_676|))) InVars {~q_back~0=v_~q_back~0_1288, #memory_int=|v_#memory_int_882|, ~N~0=v_~N~0_468, ~q~0.base=v_~q~0.base_603, ~n~0=v_~n~0_594, ~q~0.offset=v_~q~0.offset_603, ~s~0=v_~s~0_1061, ~q_front~0=v_~q_front~0_1133} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_707|, ~q_back~0=v_~q_back~0_1287, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_647|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_647|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_480|, ~N~0=v_~N~0_468, ~q~0.base=v_~q~0.base_603, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_647|, ~q~0.offset=v_~q~0.offset_603, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_647|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_676|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_484|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_480|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_677|, #memory_int=|v_#memory_int_882|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_676|, ~n~0=v_~n~0_594, ~s~0=v_~s~0_1059, ~q_front~0=v_~q_front~0_1131} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:58:41,321 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:41,321 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:58:42,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [990] $Ultimate##0-->L65-2: Formula: (let ((.cse6 (* v_~q_front~0_1723 4)) (.cse0 (select |v_#memory_int_1186| v_~q~0.base_801)) (.cse5 (* v_~q_front~0_1725 4))) (let ((.cse2 (select .cse0 (+ .cse5 v_~q~0.offset_801))) (.cse4 (select .cse0 (+ .cse6 v_~q~0.offset_801 (- 8)))) (.cse3 (+ 3 v_~q_back~0_1790)) (.cse1 (* v_~q_back~0_1790 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_801)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_1003| (+ v_~N~0_630 1)) (not (= .cse2 0)) (= (ite (and (<= 1 v_~q_front~0_1723) (< v_~q_front~0_1723 (+ v_~n~0_784 1)) (< v_~q_front~0_1723 (+ v_~q_back~0_1788 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1040|) (not (= (ite (and (<= 0 v_~q_front~0_1725) (< v_~q_front~0_1725 v_~n~0_784) (< v_~q_front~0_1725 .cse3)) 1 0) 0)) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1133| .cse2 .cse4 v_~s~0_1675) v_~s~0_1673)) (not (= .cse4 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_988| 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1133| (select .cse0 (+ .cse5 v_~q~0.offset_801 4)) .cse2 .cse4 v_~s~0_1675) v_~s~0_1673) (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_801)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_988|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_801 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1040| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1040|) (not (= (ite (and (< v_~q_front~0_1723 (+ 5 v_~q_back~0_1790)) (< v_~q_front~0_1723 (+ 2 v_~n~0_784)) (<= 2 v_~q_front~0_1723)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_1003| 4) (= (select .cse0 (+ (- 4) .cse6 v_~q~0.offset_801)) |v_thread2Thread1of1ForFork1_~j~0#1_1133|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_988| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_988|) (not (= (ite (and (< .cse3 v_~n~0_784) (<= 0 .cse3)) 1 0) 0)) (= v_~q_back~0_1788 (+ v_~q_back~0_1790 4)) (= v_~q_front~0_1723 (+ v_~q_front~0_1725 4)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1133| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_801)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1790, #memory_int=|v_#memory_int_1186|, ~N~0=v_~N~0_630, ~q~0.base=v_~q~0.base_801, ~n~0=v_~n~0_784, ~q~0.offset=v_~q~0.offset_801, ~s~0=v_~s~0_1675, ~q_front~0=v_~q_front~0_1725} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1133|, ~q_back~0=v_~q_back~0_1788, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1040|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1040|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_735|, ~N~0=v_~N~0_630, ~q~0.base=v_~q~0.base_801, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1040|, ~q~0.offset=v_~q~0.offset_801, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1040|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_988|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_739|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_735|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1003|, #memory_int=|v_#memory_int_1186|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_988|, ~n~0=v_~n~0_784, ~s~0=v_~s~0_1673, ~q_front~0=v_~q_front~0_1723} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:58:42,776 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:58:42,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4090 [2022-12-06 07:58:42,777 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 1208 transitions, 45322 flow [2022-12-06 07:58:42,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:42,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:42,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:42,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:42,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:42,983 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1658898316, now seen corresponding path program 1 times [2022-12-06 07:58:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:42,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795993509] [2022-12-06 07:58:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:44,207 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 07:58:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:44,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795993509] [2022-12-06 07:58:44,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795993509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:58:44,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:58:44,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:58:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874401096] [2022-12-06 07:58:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:58:44,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:58:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:58:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:58:44,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 76 [2022-12-06 07:58:44,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 1208 transitions, 45322 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:58:44,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:44,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 76 [2022-12-06 07:58:44,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:49,116 INFO L130 PetriNetUnfolder]: 4961/9416 cut-off events. [2022-12-06 07:58:49,117 INFO L131 PetriNetUnfolder]: For 689634/689992 co-relation queries the response was YES. [2022-12-06 07:58:49,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132248 conditions, 9416 events. 4961/9416 cut-off events. For 689634/689992 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 77539 event pairs, 1759 based on Foata normal form. 42/9456 useless extension candidates. Maximal degree in co-relation 131477. Up to 9256 conditions per place. [2022-12-06 07:58:49,234 INFO L137 encePairwiseOnDemand]: 22/76 looper letters, 1125 selfloop transitions, 87 changer transitions 8/1221 dead transitions. [2022-12-06 07:58:49,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1221 transitions, 47937 flow [2022-12-06 07:58:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:58:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:58:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 07:58:49,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2789473684210526 [2022-12-06 07:58:49,235 INFO L175 Difference]: Start difference. First operand has 401 places, 1208 transitions, 45322 flow. Second operand 5 states and 106 transitions. [2022-12-06 07:58:49,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1221 transitions, 47937 flow [2022-12-06 07:58:54,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 1221 transitions, 47688 flow, removed 52 selfloop flow, removed 5 redundant places. [2022-12-06 07:58:54,187 INFO L231 Difference]: Finished difference. Result has 400 places, 1207 transitions, 45247 flow [2022-12-06 07:58:54,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=45068, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=45247, PETRI_PLACES=400, PETRI_TRANSITIONS=1207} [2022-12-06 07:58:54,187 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 379 predicate places. [2022-12-06 07:58:54,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:54,188 INFO L89 Accepts]: Start accepts. Operand has 400 places, 1207 transitions, 45247 flow [2022-12-06 07:58:54,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:54,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:54,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 400 places, 1207 transitions, 45247 flow [2022-12-06 07:58:54,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 1207 transitions, 45247 flow [2022-12-06 07:58:55,340 INFO L130 PetriNetUnfolder]: 1312/4019 cut-off events. [2022-12-06 07:58:55,340 INFO L131 PetriNetUnfolder]: For 303330/305852 co-relation queries the response was YES. [2022-12-06 07:58:55,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50491 conditions, 4019 events. 1312/4019 cut-off events. For 303330/305852 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 41925 event pairs, 57 based on Foata normal form. 398/4383 useless extension candidates. Maximal degree in co-relation 50032. Up to 1449 conditions per place. [2022-12-06 07:58:55,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 396 places, 1207 transitions, 45247 flow [2022-12-06 07:58:55,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 3916 [2022-12-06 07:58:55,421 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:58:55,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1233 [2022-12-06 07:58:55,421 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1207 transitions, 45247 flow [2022-12-06 07:58:55,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 07:58:55,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:55,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:55,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-06 07:58:55,422 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:55,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1946196464, now seen corresponding path program 1 times [2022-12-06 07:58:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:55,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038899201] [2022-12-06 07:58:55,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:56,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:56,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038899201] [2022-12-06 07:58:56,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038899201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:56,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630954246] [2022-12-06 07:58:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:56,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:56,440 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:56,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-12-06 07:58:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:56,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 07:58:56,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:56,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:56,800 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 07:58:56,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:56,855 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 46 treesize of output 12 [2022-12-06 07:58:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:56,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:56,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:56,965 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 152 treesize of output 153 [2022-12-06 07:58:56,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:56,975 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 97 treesize of output 90 [2022-12-06 07:58:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:57,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630954246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:57,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:57,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 07:58:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704561977] [2022-12-06 07:58:57,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:57,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:58:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:58:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:58:57,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 07:58:57,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1207 transitions, 45247 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 07:58:57,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:57,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 07:58:57,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:02,655 INFO L130 PetriNetUnfolder]: 4958/9401 cut-off events. [2022-12-06 07:59:02,655 INFO L131 PetriNetUnfolder]: For 675799/676137 co-relation queries the response was YES. [2022-12-06 07:59:02,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131904 conditions, 9401 events. 4958/9401 cut-off events. For 675799/676137 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 77435 event pairs, 1745 based on Foata normal form. 60/9461 useless extension candidates. Maximal degree in co-relation 131081. Up to 9227 conditions per place. [2022-12-06 07:59:02,770 INFO L137 encePairwiseOnDemand]: 21/74 looper letters, 1120 selfloop transitions, 96 changer transitions 6/1223 dead transitions. [2022-12-06 07:59:02,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1223 transitions, 47813 flow [2022-12-06 07:59:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:59:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:59:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-12-06 07:59:02,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17417417417417416 [2022-12-06 07:59:02,771 INFO L175 Difference]: Start difference. First operand has 396 places, 1207 transitions, 45247 flow. Second operand 9 states and 116 transitions. [2022-12-06 07:59:02,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1223 transitions, 47813 flow [2022-12-06 07:59:07,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 1223 transitions, 47681 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:59:07,302 INFO L231 Difference]: Finished difference. Result has 402 places, 1206 transitions, 45309 flow [2022-12-06 07:59:07,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=45108, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=45309, PETRI_PLACES=402, PETRI_TRANSITIONS=1206} [2022-12-06 07:59:07,303 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 381 predicate places. [2022-12-06 07:59:07,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:07,303 INFO L89 Accepts]: Start accepts. Operand has 402 places, 1206 transitions, 45309 flow [2022-12-06 07:59:07,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:07,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:07,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 1206 transitions, 45309 flow [2022-12-06 07:59:07,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 1206 transitions, 45309 flow [2022-12-06 07:59:08,493 INFO L130 PetriNetUnfolder]: 1311/4014 cut-off events. [2022-12-06 07:59:08,494 INFO L131 PetriNetUnfolder]: For 299698/302015 co-relation queries the response was YES. [2022-12-06 07:59:08,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50461 conditions, 4014 events. 1311/4014 cut-off events. For 299698/302015 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 41965 event pairs, 57 based on Foata normal form. 372/4350 useless extension candidates. Maximal degree in co-relation 50210. Up to 1447 conditions per place. [2022-12-06 07:59:08,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 401 places, 1206 transitions, 45309 flow [2022-12-06 07:59:08,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 3920 [2022-12-06 07:59:08,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:59:08,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:59:08,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1409 [2022-12-06 07:59:08,712 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 1205 transitions, 45295 flow [2022-12-06 07:59:08,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 07:59:08,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:08,712 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:08,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-12-06 07:59:08,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:59:08,919 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1354624098, now seen corresponding path program 1 times [2022-12-06 07:59:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:08,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129849589] [2022-12-06 07:59:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:09,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:09,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129849589] [2022-12-06 07:59:09,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129849589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:59:09,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42382930] [2022-12-06 07:59:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:09,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:59:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:59:09,710 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:59:09,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-12-06 07:59:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:59:10,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:59:10,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:59:10,070 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 07:59:10,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:59:10,147 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 46 treesize of output 12 [2022-12-06 07:59:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:10,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:10,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:59:10,253 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 152 treesize of output 153 [2022-12-06 07:59:10,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:59:10,263 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 97 treesize of output 90 [2022-12-06 07:59:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:10,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42382930] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:59:10,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:59:10,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:59:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444867716] [2022-12-06 07:59:10,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:59:10,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:59:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:10,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:59:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:59:10,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 07:59:10,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 1205 transitions, 45295 flow. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 07:59:10,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:10,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 07:59:10,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:15,697 INFO L130 PetriNetUnfolder]: 4983/9446 cut-off events. [2022-12-06 07:59:15,698 INFO L131 PetriNetUnfolder]: For 662218/662523 co-relation queries the response was YES. [2022-12-06 07:59:15,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133026 conditions, 9446 events. 4983/9446 cut-off events. For 662218/662523 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 78268 event pairs, 905 based on Foata normal form. 105/9551 useless extension candidates. Maximal degree in co-relation 132606. Up to 9218 conditions per place. [2022-12-06 07:59:15,831 INFO L137 encePairwiseOnDemand]: 20/74 looper letters, 1149 selfloop transitions, 70 changer transitions 30/1250 dead transitions. [2022-12-06 07:59:15,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1250 transitions, 48652 flow [2022-12-06 07:59:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:59:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:59:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2022-12-06 07:59:15,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1683046683046683 [2022-12-06 07:59:15,843 INFO L175 Difference]: Start difference. First operand has 400 places, 1205 transitions, 45295 flow. Second operand 11 states and 137 transitions. [2022-12-06 07:59:15,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1250 transitions, 48652 flow [2022-12-06 07:59:20,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1250 transitions, 48183 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-06 07:59:20,123 INFO L231 Difference]: Finished difference. Result has 409 places, 1204 transitions, 44918 flow [2022-12-06 07:59:20,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=44826, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=44918, PETRI_PLACES=409, PETRI_TRANSITIONS=1204} [2022-12-06 07:59:20,124 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 388 predicate places. [2022-12-06 07:59:20,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:20,124 INFO L89 Accepts]: Start accepts. Operand has 409 places, 1204 transitions, 44918 flow [2022-12-06 07:59:20,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:20,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:20,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 409 places, 1204 transitions, 44918 flow [2022-12-06 07:59:20,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 1204 transitions, 44918 flow [2022-12-06 07:59:21,291 INFO L130 PetriNetUnfolder]: 1315/4007 cut-off events. [2022-12-06 07:59:21,291 INFO L131 PetriNetUnfolder]: For 301729/304167 co-relation queries the response was YES. [2022-12-06 07:59:21,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50438 conditions, 4007 events. 1315/4007 cut-off events. For 301729/304167 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 41877 event pairs, 54 based on Foata normal form. 359/4333 useless extension candidates. Maximal degree in co-relation 50260. Up to 1450 conditions per place. [2022-12-06 07:59:21,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 405 places, 1204 transitions, 44918 flow [2022-12-06 07:59:21,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 3900 [2022-12-06 07:59:21,379 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:21,379 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:21,492 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:21,493 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:21,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [997] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1200| v_~q~0.base_811)) (.cse3 (* v_~q_front~0_1759 4))) (let ((.cse0 (select .cse1 (+ .cse3 v_~q~0.offset_811 4))) (.cse2 (select .cse1 (+ .cse3 v_~q~0.offset_811)))) (and (= v_~q_front~0_1757 (+ v_~q_front~0_1759 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1064| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1064|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1159| 0)) (not (= .cse0 0)) (= (select .cse1 (+ (- 4) v_~q~0.offset_811 (* v_~q_front~0_1757 4))) |v_thread2Thread1of1ForFork1_~j~0#1_1159|) (= (ite (and (< v_~q_front~0_1757 (+ v_~n~0_794 1)) (< v_~q_front~0_1757 (+ v_~q_back~0_1819 1)) (<= 1 v_~q_front~0_1757)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1064|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1159| .cse2 .cse0 v_~s~0_1713) v_~s~0_1711) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1064| 0)) (not (= .cse2 0)) (not (= (ite (and (< v_~q_front~0_1759 v_~q_back~0_1819) (< v_~q_front~0_1759 v_~n~0_794) (<= 0 v_~q_front~0_1759)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1819, #memory_int=|v_#memory_int_1200|, ~q~0.base=v_~q~0.base_811, ~n~0=v_~n~0_794, ~q~0.offset=v_~q~0.offset_811, ~s~0=v_~s~0_1713, ~q_front~0=v_~q_front~0_1759} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1064|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1159|, ~q_back~0=v_~q_back~0_1819, #memory_int=|v_#memory_int_1200|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1064|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1064|, ~q~0.base=v_~q~0.base_811, ~n~0=v_~n~0_794, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1064|, ~q~0.offset=v_~q~0.offset_811, ~s~0=v_~s~0_1711, ~q_front~0=v_~q_front~0_1757} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:59:21,870 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:59:21,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1747 [2022-12-06 07:59:21,871 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 1201 transitions, 44852 flow [2022-12-06 07:59:21,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 07:59:21,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:21,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:21,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-12-06 07:59:22,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2022-12-06 07:59:22,072 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash -961558047, now seen corresponding path program 1 times [2022-12-06 07:59:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:22,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632478970] [2022-12-06 07:59:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:22,818 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 07:59:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632478970] [2022-12-06 07:59:22,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632478970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:59:22,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:59:22,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:59:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170096459] [2022-12-06 07:59:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:59:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:59:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:59:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:59:22,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 07:59:22,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 1201 transitions, 44852 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:59:22,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:22,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 07:59:22,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:27,765 INFO L130 PetriNetUnfolder]: 4926/9318 cut-off events. [2022-12-06 07:59:27,765 INFO L131 PetriNetUnfolder]: For 676620/676912 co-relation queries the response was YES. [2022-12-06 07:59:27,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130703 conditions, 9318 events. 4926/9318 cut-off events. For 676620/676912 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 76276 event pairs, 1760 based on Foata normal form. 41/9359 useless extension candidates. Maximal degree in co-relation 130503. Up to 9226 conditions per place. [2022-12-06 07:59:27,871 INFO L137 encePairwiseOnDemand]: 31/74 looper letters, 1155 selfloop transitions, 49 changer transitions 7/1212 dead transitions. [2022-12-06 07:59:27,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1212 transitions, 47371 flow [2022-12-06 07:59:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:59:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:59:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-06 07:59:27,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2702702702702703 [2022-12-06 07:59:27,872 INFO L175 Difference]: Start difference. First operand has 402 places, 1201 transitions, 44852 flow. Second operand 5 states and 100 transitions. [2022-12-06 07:59:27,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 1212 transitions, 47371 flow [2022-12-06 07:59:31,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 1212 transitions, 47063 flow, removed 100 selfloop flow, removed 7 redundant places. [2022-12-06 07:59:32,015 INFO L231 Difference]: Finished difference. Result has 400 places, 1200 transitions, 44631 flow [2022-12-06 07:59:32,015 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=44544, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=44631, PETRI_PLACES=400, PETRI_TRANSITIONS=1200} [2022-12-06 07:59:32,015 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 379 predicate places. [2022-12-06 07:59:32,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:32,016 INFO L89 Accepts]: Start accepts. Operand has 400 places, 1200 transitions, 44631 flow [2022-12-06 07:59:32,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:32,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:32,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 400 places, 1200 transitions, 44631 flow [2022-12-06 07:59:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 399 places, 1200 transitions, 44631 flow [2022-12-06 07:59:33,131 INFO L130 PetriNetUnfolder]: 1307/3984 cut-off events. [2022-12-06 07:59:33,131 INFO L131 PetriNetUnfolder]: For 297561/300079 co-relation queries the response was YES. [2022-12-06 07:59:33,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49789 conditions, 3984 events. 1307/3984 cut-off events. For 297561/300079 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 41451 event pairs, 53 based on Foata normal form. 359/4312 useless extension candidates. Maximal degree in co-relation 49322. Up to 1433 conditions per place. [2022-12-06 07:59:33,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 1200 transitions, 44631 flow [2022-12-06 07:59:33,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 3880 [2022-12-06 07:59:33,214 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,214 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,214 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,214 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,214 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,214 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [992] $Ultimate##0-->L47-4: Formula: (let ((.cse8 (+ 5 v_~q_back~0_1802)) (.cse4 (* v_~q_front~0_1736 4)) (.cse0 (select |v_#memory_int_1190| v_~q~0.base_805)) (.cse7 (* v_~q_front~0_1735 4))) (let ((.cse2 (select .cse0 (+ .cse7 v_~q~0.offset_805 (- 8)))) (.cse3 (select .cse0 (+ .cse4 v_~q~0.offset_805))) (.cse6 (< v_~q_front~0_1735 .cse8)) (.cse1 (* v_~q_back~0_1802 4))) (and (not (= (ite (= (select .cse0 (+ v_~q~0.offset_805 4 .cse1)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1048| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1048|) (not (= (ite (and (<= 0 v_~q_front~0_1736) (< v_~q_front~0_1736 (+ 3 v_~q_back~0_1802)) (< v_~q_front~0_1736 v_~n~0_788)) 1 0) 0)) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1141| .cse2 v_~s~0_1686 .cse3) v_~s~0_1685)) (= (ite (= (select .cse0 (+ 16 v_~q~0.offset_805 .cse1)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_996|) (< 4 v_~N~0_634) (not (= .cse2 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_996| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_805 .cse1)) 1) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1141| .cse2 (select .cse0 (+ .cse4 v_~q~0.offset_805 4)) v_~s~0_1686 .cse3) v_~s~0_1685) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1141| 0)) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_805 .cse1)) 1) 1 0) 0)) (not (= .cse3 0)) (not (= (ite (let ((.cse5 (+ v_~q_back~0_1802 4))) (and (<= 0 .cse5) (< .cse5 v_~n~0_788))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1048| (ite (and (<= 1 v_~q_front~0_1735) (< v_~q_front~0_1735 (+ v_~n~0_788 1)) .cse6) 1 0)) (= v_~q_front~0_1735 (+ v_~q_front~0_1736 4)) (not (= (ite (and (<= 2 v_~q_front~0_1735) .cse6 (< v_~q_front~0_1735 (+ 2 v_~n~0_788))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1141| (select .cse0 (+ .cse7 (- 4) v_~q~0.offset_805))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_996| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_996|) (= |v_thread1Thread1of1ForFork0_~i~0#1_1011| 5) (= .cse8 v_~q_back~0_1800) (not (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_805 .cse1)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1802, #memory_int=|v_#memory_int_1190|, ~N~0=v_~N~0_634, ~q~0.base=v_~q~0.base_805, ~n~0=v_~n~0_788, ~q~0.offset=v_~q~0.offset_805, ~s~0=v_~s~0_1686, ~q_front~0=v_~q_front~0_1736} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1141|, ~q_back~0=v_~q_back~0_1800, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1048|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_743|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1048|, ~N~0=v_~N~0_634, ~q~0.base=v_~q~0.base_805, ~q~0.offset=v_~q~0.offset_805, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1048|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1048|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_996|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_747|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_743|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1011|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_996|, #memory_int=|v_#memory_int_1190|, ~n~0=v_~n~0_788, ~s~0=v_~s~0_1685, ~q_front~0=v_~q_front~0_1735} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 07:59:33,866 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,866 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,866 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,866 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,866 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:33,866 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:59:34,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:59:34,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2576 [2022-12-06 07:59:34,591 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 1200 transitions, 44693 flow [2022-12-06 07:59:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:59:34,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:34,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-06 07:59:34,591 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 732401342, now seen corresponding path program 1 times [2022-12-06 07:59:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:34,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590137316] [2022-12-06 07:59:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:34,670 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 07:59:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590137316] [2022-12-06 07:59:34,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590137316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:59:34,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:59:34,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:59:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224935214] [2022-12-06 07:59:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:59:34,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:59:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:59:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:59:34,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2022-12-06 07:59:34,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1200 transitions, 44693 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:59:34,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:34,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2022-12-06 07:59:34,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:39,681 INFO L130 PetriNetUnfolder]: 4951/9369 cut-off events. [2022-12-06 07:59:39,681 INFO L131 PetriNetUnfolder]: For 694175/694427 co-relation queries the response was YES. [2022-12-06 07:59:39,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130322 conditions, 9369 events. 4951/9369 cut-off events. For 694175/694427 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 77086 event pairs, 1668 based on Foata normal form. 50/9419 useless extension candidates. Maximal degree in co-relation 129501. Up to 8961 conditions per place. [2022-12-06 07:59:39,798 INFO L137 encePairwiseOnDemand]: 26/75 looper letters, 1080 selfloop transitions, 147 changer transitions 1/1229 dead transitions. [2022-12-06 07:59:39,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1229 transitions, 47792 flow [2022-12-06 07:59:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:59:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:59:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:59:39,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2022-12-06 07:59:39,799 INFO L175 Difference]: Start difference. First operand has 399 places, 1200 transitions, 44693 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:59:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 1229 transitions, 47792 flow [2022-12-06 07:59:44,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1229 transitions, 47644 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 07:59:44,514 INFO L231 Difference]: Finished difference. Result has 399 places, 1212 transitions, 45243 flow [2022-12-06 07:59:44,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=44517, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=45243, PETRI_PLACES=399, PETRI_TRANSITIONS=1212} [2022-12-06 07:59:44,515 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 378 predicate places. [2022-12-06 07:59:44,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:44,515 INFO L89 Accepts]: Start accepts. Operand has 399 places, 1212 transitions, 45243 flow [2022-12-06 07:59:44,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:44,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:44,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 1212 transitions, 45243 flow [2022-12-06 07:59:44,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 398 places, 1212 transitions, 45243 flow [2022-12-06 07:59:45,684 INFO L130 PetriNetUnfolder]: 1318/4006 cut-off events. [2022-12-06 07:59:45,684 INFO L131 PetriNetUnfolder]: For 298940/301390 co-relation queries the response was YES. [2022-12-06 07:59:45,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50008 conditions, 4006 events. 1318/4006 cut-off events. For 298940/301390 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 41671 event pairs, 54 based on Foata normal form. 374/4347 useless extension candidates. Maximal degree in co-relation 49541. Up to 1454 conditions per place. [2022-12-06 07:59:45,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 398 places, 1212 transitions, 45243 flow [2022-12-06 07:59:45,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 3904 [2022-12-06 07:59:45,766 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:59:45,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1251 [2022-12-06 07:59:45,767 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 1212 transitions, 45243 flow [2022-12-06 07:59:45,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 07:59:45,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:45,767 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:45,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-06 07:59:45,767 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:45,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1574419280, now seen corresponding path program 1 times [2022-12-06 07:59:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:45,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337739148] [2022-12-06 07:59:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:46,449 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 07:59:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337739148] [2022-12-06 07:59:46,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337739148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:59:46,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:59:46,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:59:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220757193] [2022-12-06 07:59:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:59:46,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:59:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:59:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:59:46,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-06 07:59:46,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1212 transitions, 45243 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:59:46,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:46,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-06 07:59:46,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:51,120 INFO L130 PetriNetUnfolder]: 4950/9346 cut-off events. [2022-12-06 07:59:51,120 INFO L131 PetriNetUnfolder]: For 648827/649089 co-relation queries the response was YES. [2022-12-06 07:59:51,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130535 conditions, 9346 events. 4950/9346 cut-off events. For 648827/649089 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 76935 event pairs, 1151 based on Foata normal form. 94/9440 useless extension candidates. Maximal degree in co-relation 129714. Up to 9256 conditions per place. [2022-12-06 07:59:51,233 INFO L137 encePairwiseOnDemand]: 29/73 looper letters, 1166 selfloop transitions, 49 changer transitions 9/1225 dead transitions. [2022-12-06 07:59:51,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1225 transitions, 47782 flow [2022-12-06 07:59:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:59:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:59:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-06 07:59:51,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2328767123287671 [2022-12-06 07:59:51,234 INFO L175 Difference]: Start difference. First operand has 398 places, 1212 transitions, 45243 flow. Second operand 6 states and 102 transitions. [2022-12-06 07:59:51,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1225 transitions, 47782 flow [2022-12-06 07:59:55,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 1225 transitions, 47778 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 07:59:55,383 INFO L231 Difference]: Finished difference. Result has 405 places, 1211 transitions, 45309 flow [2022-12-06 07:59:55,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=45239, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=45309, PETRI_PLACES=405, PETRI_TRANSITIONS=1211} [2022-12-06 07:59:55,384 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 384 predicate places. [2022-12-06 07:59:55,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:55,384 INFO L89 Accepts]: Start accepts. Operand has 405 places, 1211 transitions, 45309 flow [2022-12-06 07:59:55,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:55,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:55,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 405 places, 1211 transitions, 45309 flow [2022-12-06 07:59:55,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 1211 transitions, 45309 flow [2022-12-06 07:59:56,486 INFO L130 PetriNetUnfolder]: 1324/4008 cut-off events. [2022-12-06 07:59:56,486 INFO L131 PetriNetUnfolder]: For 300192/302686 co-relation queries the response was YES. [2022-12-06 07:59:56,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50305 conditions, 4008 events. 1324/4008 cut-off events. For 300192/302686 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 41702 event pairs, 50 based on Foata normal form. 364/4341 useless extension candidates. Maximal degree in co-relation 50124. Up to 1461 conditions per place. [2022-12-06 07:59:56,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 1211 transitions, 45309 flow [2022-12-06 07:59:56,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 3902 [2022-12-06 07:59:56,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1002] $Ultimate##0-->L65-2: Formula: (let ((.cse7 (* v_~q_front~0_1771 4)) (.cse0 (select |v_#memory_int_1206| v_~q~0.base_817)) (.cse8 (* v_~q_front~0_1773 4))) (let ((.cse2 (select .cse0 (+ .cse8 v_~q~0.offset_817 4))) (.cse4 (select .cse0 (+ v_~q~0.offset_817 (- 8) .cse7))) (.cse6 (select .cse0 (+ (- 12) v_~q~0.offset_817 .cse7))) (.cse3 (select .cse0 (+ .cse8 v_~q~0.offset_817))) (.cse1 (* v_~q_back~0_1832 4))) (and (= (+ 5 v_~q_back~0_1832) v_~q_back~0_1831) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1072| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1072|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1072| (ite (and (< v_~q_front~0_1771 (+ v_~n~0_800 1)) (< v_~q_front~0_1771 (+ v_~q_back~0_1831 1)) (<= 1 v_~q_front~0_1771)) 1 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_817 4 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1015| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1015|) (not (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_817 .cse1)) 1) 1 0) 0)) (not (= .cse2 0)) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_817 .cse1)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1167| 0)) (< 4 v_~N~0_642) (not (= (ite (and (< v_~q_front~0_1771 (+ 6 v_~q_back~0_1832)) (<= 3 v_~q_front~0_1771) (< v_~q_front~0_1771 (+ 3 v_~n~0_800))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1015| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_1029| 5) (not (= .cse3 0)) (not (= .cse4 0)) (= (+ v_~q_front~0_1773 5) v_~q_front~0_1771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1015| (ite (= (select .cse0 (+ 16 v_~q~0.offset_817 .cse1)) 1) 1 0)) (not (= (ite (and (< v_~q_front~0_1773 (+ 3 v_~q_back~0_1832)) (<= 0 v_~q_front~0_1773) (< v_~q_front~0_1773 v_~n~0_800)) 1 0) 0)) (not (= (ite (let ((.cse5 (+ v_~q_back~0_1832 4))) (and (< .cse5 v_~n~0_800) (<= 0 .cse5))) 1 0) 0)) (not (= .cse6 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1167| (select .cse0 (+ (- 4) v_~q~0.offset_817 .cse7))) (= (+ .cse2 |v_thread2Thread1of1ForFork1_~j~0#1_1167| .cse4 .cse6 v_~s~0_1727 .cse3) v_~s~0_1725) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_817 .cse1)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1832, #memory_int=|v_#memory_int_1206|, ~N~0=v_~N~0_642, ~q~0.base=v_~q~0.base_817, ~n~0=v_~n~0_800, ~q~0.offset=v_~q~0.offset_817, ~s~0=v_~s~0_1727, ~q_front~0=v_~q_front~0_1773} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1167|, ~q_back~0=v_~q_back~0_1831, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1072|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1072|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_756|, ~N~0=v_~N~0_642, ~q~0.base=v_~q~0.base_817, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1072|, ~q~0.offset=v_~q~0.offset_817, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1072|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1015|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_760|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_756|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1029|, #memory_int=|v_#memory_int_1206|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1015|, ~n~0=v_~n~0_800, ~s~0=v_~s~0_1725, ~q_front~0=v_~q_front~0_1771} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 07:59:57,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:59:57,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1907 [2022-12-06 07:59:57,291 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 1210 transitions, 45295 flow [2022-12-06 07:59:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 07:59:57,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:57,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:57,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-06 07:59:57,292 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2079641338, now seen corresponding path program 1 times [2022-12-06 07:59:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:57,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512255509] [2022-12-06 07:59:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:57,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:57,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512255509] [2022-12-06 07:59:57,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512255509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:59:57,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922831508] [2022-12-06 07:59:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:57,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:59:57,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:59:57,629 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:59:57,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-12-06 07:59:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:57,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 07:59:57,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:59:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:58,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:58,032 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 07:59:58,033 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 27 treesize of output 16 [2022-12-06 07:59:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:58,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922831508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:59:58,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:59:58,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 07:59:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136667021] [2022-12-06 07:59:58,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:59:58,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:59:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:58,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:59:58,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:59:58,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-06 07:59:58,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 1210 transitions, 45295 flow. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 07:59:58,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:58,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-06 07:59:58,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:03,212 INFO L130 PetriNetUnfolder]: 5071/9551 cut-off events. [2022-12-06 08:00:03,212 INFO L131 PetriNetUnfolder]: For 699344/699575 co-relation queries the response was YES. [2022-12-06 08:00:03,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133970 conditions, 9551 events. 5071/9551 cut-off events. For 699344/699575 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 78732 event pairs, 1000 based on Foata normal form. 163/9714 useless extension candidates. Maximal degree in co-relation 133716. Up to 7918 conditions per place. [2022-12-06 08:00:03,325 INFO L137 encePairwiseOnDemand]: 24/73 looper letters, 993 selfloop transitions, 337 changer transitions 0/1331 dead transitions. [2022-12-06 08:00:03,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1331 transitions, 50954 flow [2022-12-06 08:00:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 08:00:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 08:00:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-12-06 08:00:03,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.182648401826484 [2022-12-06 08:00:03,326 INFO L175 Difference]: Start difference. First operand has 402 places, 1210 transitions, 45295 flow. Second operand 9 states and 120 transitions. [2022-12-06 08:00:03,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1331 transitions, 50954 flow [2022-12-06 08:00:07,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 1331 transitions, 50777 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 08:00:07,540 INFO L231 Difference]: Finished difference. Result has 407 places, 1244 transitions, 47470 flow [2022-12-06 08:00:07,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=45120, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=47470, PETRI_PLACES=407, PETRI_TRANSITIONS=1244} [2022-12-06 08:00:07,541 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 386 predicate places. [2022-12-06 08:00:07,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:07,541 INFO L89 Accepts]: Start accepts. Operand has 407 places, 1244 transitions, 47470 flow [2022-12-06 08:00:07,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:07,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:07,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 407 places, 1244 transitions, 47470 flow [2022-12-06 08:00:07,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 407 places, 1244 transitions, 47470 flow [2022-12-06 08:00:08,699 INFO L130 PetriNetUnfolder]: 1354/4095 cut-off events. [2022-12-06 08:00:08,699 INFO L131 PetriNetUnfolder]: For 318072/320421 co-relation queries the response was YES. [2022-12-06 08:00:08,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51985 conditions, 4095 events. 1354/4095 cut-off events. For 318072/320421 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 42837 event pairs, 50 based on Foata normal form. 382/4445 useless extension candidates. Maximal degree in co-relation 51507. Up to 1494 conditions per place. [2022-12-06 08:00:08,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 407 places, 1244 transitions, 47470 flow [2022-12-06 08:00:08,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 4036 [2022-12-06 08:00:08,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1000] $Ultimate##0-->L47-4: Formula: (let ((.cse5 (* v_~q_front~0_1767 4)) (.cse0 (select |v_#memory_int_1204| v_~q~0.base_815)) (.cse4 (* v_~q_front~0_1768 4)) (.cse7 (+ 5 v_~q_back~0_1827))) (let ((.cse1 (* v_~q_back~0_1827 4)) (.cse6 (< v_~q_front~0_1767 .cse7)) (.cse3 (select .cse0 (+ v_~q~0.offset_815 .cse4))) (.cse2 (select .cse0 (+ .cse5 v_~q~0.offset_815 (- 8))))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_815)) 1) 1 0) 0)) (= (+ 6 v_~q_back~0_1827) v_~q_back~0_1825) (not (= .cse2 0)) (= (+ .cse3 |v_thread2Thread1of1ForFork1_~j~0#1_1165| .cse2 (select .cse0 (+ v_~q~0.offset_815 4 .cse4)) v_~s~0_1722) v_~s~0_1721) (= (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_815)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1011|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_815 4)) 1) 1 0) 0)) (not (= 0 (ite (= (select .cse0 (+ 16 .cse1 v_~q~0.offset_815)) 1) 1 0))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1165| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1070| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1070|) (= |v_thread1Thread1of1ForFork0_~i~0#1_1025| 6) (= |v_thread2Thread1of1ForFork1_~j~0#1_1165| (select .cse0 (+ .cse5 (- 4) v_~q~0.offset_815))) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_815)) 1) 1 0) 0)) (< 5 v_~N~0_640) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1011| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1011|) (not (= (ite (and (< v_~q_front~0_1768 (+ 3 v_~q_back~0_1827)) (<= 0 v_~q_front~0_1768) (< v_~q_front~0_1768 v_~n~0_798)) 1 0) 0)) (not (= (ite (and (<= 2 v_~q_front~0_1767) (< v_~q_front~0_1767 (+ 2 v_~n~0_798)) .cse6) 1 0) 0)) (= v_~q_front~0_1767 (+ v_~q_front~0_1768 4)) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_815)) 1) 1 0) 0)) (= (ite (and (<= 1 v_~q_front~0_1767) .cse6 (< v_~q_front~0_1767 (+ v_~n~0_798 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1070|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1011| 0)) (not (= .cse3 0)) (not (= (+ .cse3 |v_thread2Thread1of1ForFork1_~j~0#1_1165| .cse2 v_~s~0_1722) v_~s~0_1721)) (not (= (ite (and (< .cse7 v_~n~0_798) (<= 0 .cse7)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1827, #memory_int=|v_#memory_int_1204|, ~N~0=v_~N~0_640, ~q~0.base=v_~q~0.base_815, ~n~0=v_~n~0_798, ~q~0.offset=v_~q~0.offset_815, ~s~0=v_~s~0_1722, ~q_front~0=v_~q_front~0_1768} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1165|, ~q_back~0=v_~q_back~0_1825, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1070|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_752|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1070|, ~N~0=v_~N~0_640, ~q~0.base=v_~q~0.base_815, ~q~0.offset=v_~q~0.offset_815, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1070|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1070|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1011|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_756|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_752|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1025|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1011|, #memory_int=|v_#memory_int_1204|, ~n~0=v_~n~0_798, ~s~0=v_~s~0_1721, ~q_front~0=v_~q_front~0_1767} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 08:00:09,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:00:09,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2121 [2022-12-06 08:00:09,662 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 1244 transitions, 47496 flow [2022-12-06 08:00:09,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 08:00:09,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:09,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:09,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:09,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable150 [2022-12-06 08:00:09,869 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:09,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1420116841, now seen corresponding path program 1 times [2022-12-06 08:00:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:09,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670151721] [2022-12-06 08:00:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:10,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670151721] [2022-12-06 08:00:10,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670151721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:10,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606050517] [2022-12-06 08:00:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:10,527 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:10,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-12-06 08:00:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:10,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 08:00:10,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:10,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:10,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 136 treesize of output 28 [2022-12-06 08:00:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:10,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:11,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:11,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 205 treesize of output 538 [2022-12-06 08:00:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:11,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606050517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:11,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:11,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 08:00:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744735363] [2022-12-06 08:00:11,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:11,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 08:00:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 08:00:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 08:00:11,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 08:00:11,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 1244 transitions, 47496 flow. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 08:00:11,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:11,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 08:00:11,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:16,980 INFO L130 PetriNetUnfolder]: 5086/9598 cut-off events. [2022-12-06 08:00:16,980 INFO L131 PetriNetUnfolder]: For 715236/715522 co-relation queries the response was YES. [2022-12-06 08:00:17,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136094 conditions, 9598 events. 5086/9598 cut-off events. For 715236/715522 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 78842 event pairs, 1755 based on Foata normal form. 58/9656 useless extension candidates. Maximal degree in co-relation 135270. Up to 9398 conditions per place. [2022-12-06 08:00:17,103 INFO L137 encePairwiseOnDemand]: 23/74 looper letters, 1150 selfloop transitions, 100 changer transitions 24/1275 dead transitions. [2022-12-06 08:00:17,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1275 transitions, 50344 flow [2022-12-06 08:00:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 08:00:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 08:00:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2022-12-06 08:00:17,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16461916461916462 [2022-12-06 08:00:17,104 INFO L175 Difference]: Start difference. First operand has 407 places, 1244 transitions, 47496 flow. Second operand 11 states and 134 transitions. [2022-12-06 08:00:17,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1275 transitions, 50344 flow [2022-12-06 08:00:22,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1275 transitions, 49950 flow, removed 157 selfloop flow, removed 3 redundant places. [2022-12-06 08:00:22,162 INFO L231 Difference]: Finished difference. Result has 417 places, 1241 transitions, 47213 flow [2022-12-06 08:00:22,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=47102, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=47213, PETRI_PLACES=417, PETRI_TRANSITIONS=1241} [2022-12-06 08:00:22,163 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 396 predicate places. [2022-12-06 08:00:22,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:22,163 INFO L89 Accepts]: Start accepts. Operand has 417 places, 1241 transitions, 47213 flow [2022-12-06 08:00:22,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:22,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:22,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 417 places, 1241 transitions, 47213 flow [2022-12-06 08:00:22,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 1241 transitions, 47213 flow [2022-12-06 08:00:23,322 INFO L130 PetriNetUnfolder]: 1350/4086 cut-off events. [2022-12-06 08:00:23,322 INFO L131 PetriNetUnfolder]: For 320660/323231 co-relation queries the response was YES. [2022-12-06 08:00:23,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52114 conditions, 4086 events. 1350/4086 cut-off events. For 320660/323231 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 42522 event pairs, 48 based on Foata normal form. 379/4432 useless extension candidates. Maximal degree in co-relation 51634. Up to 1490 conditions per place. [2022-12-06 08:00:23,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 413 places, 1241 transitions, 47213 flow [2022-12-06 08:00:23,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 4022 [2022-12-06 08:00:23,403 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:00:23,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1240 [2022-12-06 08:00:23,403 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 1241 transitions, 47213 flow [2022-12-06 08:00:23,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 08:00:23,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:23,403 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:23,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:23,609 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 255249577, now seen corresponding path program 1 times [2022-12-06 08:00:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:23,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579854016] [2022-12-06 08:00:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579854016] [2022-12-06 08:00:24,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579854016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004488533] [2022-12-06 08:00:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:24,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:24,744 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:24,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-12-06 08:00:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:25,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 08:00:25,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:25,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:00:25,115 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 30 treesize of output 30 [2022-12-06 08:00:25,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:25,187 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 46 treesize of output 12 [2022-12-06 08:00:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:25,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:25,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:25,349 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 135 treesize of output 136 [2022-12-06 08:00:25,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:25,355 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 75 treesize of output 62 [2022-12-06 08:00:25,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:25,360 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 62 treesize of output 49 [2022-12-06 08:00:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:25,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004488533] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:25,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:25,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 08:00:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703106024] [2022-12-06 08:00:25,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:25,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 08:00:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:25,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 08:00:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-06 08:00:25,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 08:00:25,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1241 transitions, 47213 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:25,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:25,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 08:00:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:31,942 INFO L130 PetriNetUnfolder]: 5206/9949 cut-off events. [2022-12-06 08:00:31,942 INFO L131 PetriNetUnfolder]: For 726360/726597 co-relation queries the response was YES. [2022-12-06 08:00:32,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140399 conditions, 9949 events. 5206/9949 cut-off events. For 726360/726597 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 83920 event pairs, 1660 based on Foata normal form. 56/10005 useless extension candidates. Maximal degree in co-relation 139563. Up to 9086 conditions per place. [2022-12-06 08:00:32,067 INFO L137 encePairwiseOnDemand]: 11/74 looper letters, 1105 selfloop transitions, 222 changer transitions 32/1360 dead transitions. [2022-12-06 08:00:32,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1360 transitions, 52622 flow [2022-12-06 08:00:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 08:00:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 08:00:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2022-12-06 08:00:32,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12033462033462033 [2022-12-06 08:00:32,068 INFO L175 Difference]: Start difference. First operand has 413 places, 1241 transitions, 47213 flow. Second operand 21 states and 187 transitions. [2022-12-06 08:00:32,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1360 transitions, 52622 flow [2022-12-06 08:00:37,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1360 transitions, 52367 flow, removed 41 selfloop flow, removed 6 redundant places. [2022-12-06 08:00:37,080 INFO L231 Difference]: Finished difference. Result has 435 places, 1281 transitions, 49044 flow [2022-12-06 08:00:37,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=46970, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=49044, PETRI_PLACES=435, PETRI_TRANSITIONS=1281} [2022-12-06 08:00:37,081 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 414 predicate places. [2022-12-06 08:00:37,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:37,081 INFO L89 Accepts]: Start accepts. Operand has 435 places, 1281 transitions, 49044 flow [2022-12-06 08:00:37,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:37,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:37,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 1281 transitions, 49044 flow [2022-12-06 08:00:37,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 433 places, 1281 transitions, 49044 flow [2022-12-06 08:00:38,412 INFO L130 PetriNetUnfolder]: 1363/4203 cut-off events. [2022-12-06 08:00:38,412 INFO L131 PetriNetUnfolder]: For 334164/337205 co-relation queries the response was YES. [2022-12-06 08:00:38,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53762 conditions, 4203 events. 1363/4203 cut-off events. For 334164/337205 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 44548 event pairs, 58 based on Foata normal form. 410/4579 useless extension candidates. Maximal degree in co-relation 53303. Up to 1508 conditions per place. [2022-12-06 08:00:38,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 433 places, 1281 transitions, 49044 flow [2022-12-06 08:00:38,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 4146 [2022-12-06 08:00:38,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 08:00:38,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 08:00:38,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 08:00:39,046 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,046 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,046 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,046 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,046 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,046 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,369 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,369 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,369 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,369 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,369 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,370 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:00:39,799 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 08:00:39,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2718 [2022-12-06 08:00:39,800 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 1279 transitions, 49050 flow [2022-12-06 08:00:39,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:39,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:39,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:39,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-12-06 08:00:40,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:40,006 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash 930470829, now seen corresponding path program 1 times [2022-12-06 08:00:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:40,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800164183] [2022-12-06 08:00:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:41,140 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 08:00:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:41,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800164183] [2022-12-06 08:00:41,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800164183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:00:41,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:00:41,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 08:00:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081413984] [2022-12-06 08:00:41,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:00:41,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 08:00:41,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 08:00:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 08:00:41,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 08:00:41,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1279 transitions, 49050 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 08:00:41,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:41,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 08:00:41,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:46,487 INFO L130 PetriNetUnfolder]: 5138/9770 cut-off events. [2022-12-06 08:00:46,488 INFO L131 PetriNetUnfolder]: For 735581/735839 co-relation queries the response was YES. [2022-12-06 08:00:46,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139458 conditions, 9770 events. 5138/9770 cut-off events. For 735581/735839 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 81205 event pairs, 1888 based on Foata normal form. 63/9833 useless extension candidates. Maximal degree in co-relation 138679. Up to 9664 conditions per place. [2022-12-06 08:00:46,622 INFO L137 encePairwiseOnDemand]: 44/77 looper letters, 1236 selfloop transitions, 46 changer transitions 9/1292 dead transitions. [2022-12-06 08:00:46,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1292 transitions, 51902 flow [2022-12-06 08:00:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 08:00:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 08:00:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 08:00:46,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23160173160173161 [2022-12-06 08:00:46,623 INFO L175 Difference]: Start difference. First operand has 431 places, 1279 transitions, 49050 flow. Second operand 6 states and 107 transitions. [2022-12-06 08:00:46,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1292 transitions, 51902 flow [2022-12-06 08:00:51,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 1292 transitions, 51298 flow, removed 237 selfloop flow, removed 7 redundant places. [2022-12-06 08:00:51,830 INFO L231 Difference]: Finished difference. Result has 429 places, 1279 transitions, 48678 flow [2022-12-06 08:00:51,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=48444, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=48678, PETRI_PLACES=429, PETRI_TRANSITIONS=1279} [2022-12-06 08:00:51,830 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 408 predicate places. [2022-12-06 08:00:51,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:51,830 INFO L89 Accepts]: Start accepts. Operand has 429 places, 1279 transitions, 48678 flow [2022-12-06 08:00:51,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:51,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:51,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 429 places, 1279 transitions, 48678 flow [2022-12-06 08:00:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 426 places, 1279 transitions, 48678 flow [2022-12-06 08:00:53,230 INFO L130 PetriNetUnfolder]: 1356/4170 cut-off events. [2022-12-06 08:00:53,230 INFO L131 PetriNetUnfolder]: For 326095/328555 co-relation queries the response was YES. [2022-12-06 08:00:53,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53203 conditions, 4170 events. 1356/4170 cut-off events. For 326095/328555 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 43933 event pairs, 60 based on Foata normal form. 403/4538 useless extension candidates. Maximal degree in co-relation 52715. Up to 1498 conditions per place. [2022-12-06 08:00:53,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 426 places, 1279 transitions, 48678 flow [2022-12-06 08:00:53,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 4122 [2022-12-06 08:00:53,310 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:00:53,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1481 [2022-12-06 08:00:53,311 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 1279 transitions, 48678 flow [2022-12-06 08:00:53,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 08:00:53,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:53,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:53,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-06 08:00:53,311 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1548066048, now seen corresponding path program 1 times [2022-12-06 08:00:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:53,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115843055] [2022-12-06 08:00:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115843055] [2022-12-06 08:00:53,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115843055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409673268] [2022-12-06 08:00:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:53,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:53,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:53,679 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:53,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-12-06 08:00:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:54,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 08:00:54,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:54,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:00:54,054 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 19 treesize of output 21 [2022-12-06 08:00:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:54,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:54,097 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6675 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6675) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4))))) is different from false [2022-12-06 08:00:54,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:54,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 08:00:54,105 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 25 treesize of output 18 [2022-12-06 08:00:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:54,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409673268] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:54,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:54,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 08:00:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715698432] [2022-12-06 08:00:54,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:54,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 08:00:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 08:00:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2022-12-06 08:00:54,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2022-12-06 08:00:54,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1279 transitions, 48678 flow. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:54,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:54,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2022-12-06 08:00:54,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:59,809 INFO L130 PetriNetUnfolder]: 5256/9977 cut-off events. [2022-12-06 08:00:59,809 INFO L131 PetriNetUnfolder]: For 779737/780056 co-relation queries the response was YES. [2022-12-06 08:00:59,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141781 conditions, 9977 events. 5256/9977 cut-off events. For 779737/780056 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 82937 event pairs, 746 based on Foata normal form. 80/10057 useless extension candidates. Maximal degree in co-relation 140947. Up to 7865 conditions per place. [2022-12-06 08:00:59,926 INFO L137 encePairwiseOnDemand]: 15/75 looper letters, 986 selfloop transitions, 386 changer transitions 0/1373 dead transitions. [2022-12-06 08:00:59,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1373 transitions, 53870 flow [2022-12-06 08:00:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 08:00:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 08:00:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-06 08:00:59,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-06 08:00:59,928 INFO L175 Difference]: Start difference. First operand has 426 places, 1279 transitions, 48678 flow. Second operand 6 states and 115 transitions. [2022-12-06 08:00:59,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1373 transitions, 53870 flow [2022-12-06 08:01:05,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1373 transitions, 53748 flow, removed 34 selfloop flow, removed 2 redundant places. [2022-12-06 08:01:05,774 INFO L231 Difference]: Finished difference. Result has 432 places, 1307 transitions, 51015 flow [2022-12-06 08:01:05,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=48556, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=51015, PETRI_PLACES=432, PETRI_TRANSITIONS=1307} [2022-12-06 08:01:05,774 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 411 predicate places. [2022-12-06 08:01:05,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:05,774 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1307 transitions, 51015 flow [2022-12-06 08:01:05,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:05,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:05,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1307 transitions, 51015 flow [2022-12-06 08:01:05,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 1307 transitions, 51015 flow [2022-12-06 08:01:07,119 INFO L130 PetriNetUnfolder]: 1390/4274 cut-off events. [2022-12-06 08:01:07,119 INFO L131 PetriNetUnfolder]: For 355252/357836 co-relation queries the response was YES. [2022-12-06 08:01:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55483 conditions, 4274 events. 1390/4274 cut-off events. For 355252/357836 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 45199 event pairs, 59 based on Foata normal form. 409/4647 useless extension candidates. Maximal degree in co-relation 54986. Up to 1538 conditions per place. [2022-12-06 08:01:07,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 1307 transitions, 51015 flow [2022-12-06 08:01:07,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 4238 [2022-12-06 08:01:07,205 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:07,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1431 [2022-12-06 08:01:07,205 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 1307 transitions, 51015 flow [2022-12-06 08:01:07,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:07,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:07,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:07,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:07,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable154 [2022-12-06 08:01:07,412 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 345081136, now seen corresponding path program 1 times [2022-12-06 08:01:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:07,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544926946] [2022-12-06 08:01:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544926946] [2022-12-06 08:01:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544926946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515504014] [2022-12-06 08:01:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:08,614 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-12-06 08:01:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:09,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 08:01:09,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:09,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:01:09,122 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 90 treesize of output 20 [2022-12-06 08:01:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:09,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:09,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:01:09,339 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 153 treesize of output 255 [2022-12-06 08:01:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515504014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:09,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:09,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-12-06 08:01:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037809696] [2022-12-06 08:01:09,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:09,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 08:01:09,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:09,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 08:01:09,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-06 08:01:09,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2022-12-06 08:01:09,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1307 transitions, 51015 flow. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 08:01:09,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:09,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2022-12-06 08:01:09,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:15,815 INFO L130 PetriNetUnfolder]: 5295/10054 cut-off events. [2022-12-06 08:01:15,816 INFO L131 PetriNetUnfolder]: For 788730/789042 co-relation queries the response was YES. [2022-12-06 08:01:15,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145814 conditions, 10054 events. 5295/10054 cut-off events. For 788730/789042 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 83817 event pairs, 1859 based on Foata normal form. 65/10119 useless extension candidates. Maximal degree in co-relation 144937. Up to 9799 conditions per place. [2022-12-06 08:01:15,950 INFO L137 encePairwiseOnDemand]: 22/75 looper letters, 1203 selfloop transitions, 140 changer transitions 12/1356 dead transitions. [2022-12-06 08:01:15,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1356 transitions, 54911 flow [2022-12-06 08:01:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 08:01:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 08:01:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-12-06 08:01:15,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.128 [2022-12-06 08:01:15,951 INFO L175 Difference]: Start difference. First operand has 432 places, 1307 transitions, 51015 flow. Second operand 15 states and 144 transitions. [2022-12-06 08:01:15,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 1356 transitions, 54911 flow [2022-12-06 08:01:21,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1356 transitions, 54488 flow, removed 58 selfloop flow, removed 2 redundant places. [2022-12-06 08:01:21,700 INFO L231 Difference]: Finished difference. Result has 449 places, 1329 transitions, 51831 flow [2022-12-06 08:01:21,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=50594, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=51831, PETRI_PLACES=449, PETRI_TRANSITIONS=1329} [2022-12-06 08:01:21,701 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 428 predicate places. [2022-12-06 08:01:21,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:21,701 INFO L89 Accepts]: Start accepts. Operand has 449 places, 1329 transitions, 51831 flow [2022-12-06 08:01:21,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:21,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:21,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 1329 transitions, 51831 flow [2022-12-06 08:01:21,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 447 places, 1329 transitions, 51831 flow [2022-12-06 08:01:23,071 INFO L130 PetriNetUnfolder]: 1409/4316 cut-off events. [2022-12-06 08:01:23,071 INFO L131 PetriNetUnfolder]: For 354680/357236 co-relation queries the response was YES. [2022-12-06 08:01:23,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56243 conditions, 4316 events. 1409/4316 cut-off events. For 354680/357236 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 45686 event pairs, 55 based on Foata normal form. 414/4697 useless extension candidates. Maximal degree in co-relation 56020. Up to 1554 conditions per place. [2022-12-06 08:01:23,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 447 places, 1329 transitions, 51831 flow [2022-12-06 08:01:23,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 4274 [2022-12-06 08:01:35,892 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:35,892 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:35,892 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:35,892 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:35,893 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:35,893 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [987] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1182| v_~q~0.base_797)) (.cse5 (* v_~q_front~0_1715 4))) (let ((.cse1 (* v_~q_back~0_1778 4)) (.cse2 (select .cse0 (+ .cse5 v_~q~0.offset_797 4))) (.cse4 (+ v_~q_front~0_1715 3))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_980| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1127| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_797 .cse1)) 1) 1 0) 0)) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1127| .cse2 v_~s~0_1665) v_~s~0_1663)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1034| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1034|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1034| (ite (let ((.cse3 (+ v_~q_front~0_1715 2))) (and (< .cse3 v_~n~0_780) (<= 0 .cse3) (< .cse4 v_~q_back~0_1776))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1034| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_980| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_980|) (= (select .cse0 (+ .cse5 8 v_~q~0.offset_797)) |v_thread2Thread1of1ForFork1_~j~0#1_1127|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1127| .cse2 (select .cse0 (+ .cse5 v_~q~0.offset_797)) v_~s~0_1665) v_~s~0_1663) (= (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1776 4) v_~q~0.offset_797)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_980|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_797 4 .cse1)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_797 .cse1)) 1) 1 0) 0)) (not (= (ite (and (<= 1 v_~q_back~0_1776) (< v_~q_back~0_1776 (+ v_~n~0_780 1))) 1 0) 0)) (not (= .cse2 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_995| 4) (= v_~q_front~0_1713 .cse4) (not (= (ite (and (< (+ v_~q_front~0_1715 1) v_~q_back~0_1776) (< v_~q_front~0_1715 v_~n~0_780) (<= 0 v_~q_front~0_1715)) 1 0) 0)) (< 3 v_~N~0_626) (= v_~q_back~0_1776 (+ v_~q_back~0_1778 4))))) InVars {~q_back~0=v_~q_back~0_1778, #memory_int=|v_#memory_int_1182|, ~N~0=v_~N~0_626, ~q~0.base=v_~q~0.base_797, ~n~0=v_~n~0_780, ~q~0.offset=v_~q~0.offset_797, ~s~0=v_~s~0_1665, ~q_front~0=v_~q_front~0_1715} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1127|, ~q_back~0=v_~q_back~0_1776, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1034|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_727|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1034|, ~N~0=v_~N~0_626, ~q~0.base=v_~q~0.base_797, ~q~0.offset=v_~q~0.offset_797, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1034|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1034|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_980|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_731|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_727|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_995|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_980|, #memory_int=|v_#memory_int_1182|, ~n~0=v_~n~0_780, ~s~0=v_~s~0_1663, ~q_front~0=v_~q_front~0_1713} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 08:01:36,427 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,427 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,427 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,427 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,427 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,427 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 08:01:36,983 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1017] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1244| v_~q~0.base_842)) (.cse6 (* v_~q_front~0_1842 4))) (let ((.cse2 (* v_~q_back~0_1890 4)) (.cse5 (+ v_~n~0_822 1)) (.cse0 (select .cse1 (+ .cse6 8 v_~q~0.offset_842))) (.cse4 (select .cse1 (+ .cse6 v_~q~0.offset_842))) (.cse3 (select .cse1 (+ .cse6 v_~q~0.offset_842 4)))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_1061| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1052| 0)) (not (= .cse0 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_842 4)) 1) 1 0) 0)) (not (= (ite (= 1 (select .cse1 (+ .cse2 v_~q~0.offset_842))) 1 0) 0)) (= v_~q_front~0_1840 (+ v_~q_front~0_1842 4)) (= (+ v_~q_back~0_1890 4) v_~q_back~0_1889) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1052| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1052|) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_842)) 1) 1 0) 0)) (not (= .cse4 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1217| (select .cse1 (+ (- 4) v_~q~0.offset_842 (* v_~q_front~0_1840 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1052| (ite (= (select .cse1 (+ (* v_~q_back~0_1889 4) (- 4) v_~q~0.offset_842)) 1) 1 0)) (not (= (ite (and (<= 1 v_~q_back~0_1889) (< v_~q_back~0_1889 .cse5)) 1 0) 0)) (< 3 v_~N~0_664) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1217| 0)) (not (= (ite (and (< v_~q_front~0_1842 v_~n~0_822) (< (+ v_~q_front~0_1842 1) v_~q_back~0_1889) (<= 0 v_~q_front~0_1842)) 1 0) 0)) (= (ite (and (<= 1 v_~q_front~0_1840) (< v_~q_front~0_1840 (+ v_~q_back~0_1889 1)) (< v_~q_front~0_1840 .cse5)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1117|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1217| .cse0 .cse4 v_~s~0_1798 .cse3) v_~s~0_1796) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1117|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1117| 0))))) InVars {~q_back~0=v_~q_back~0_1890, #memory_int=|v_#memory_int_1244|, ~N~0=v_~N~0_664, ~q~0.base=v_~q~0.base_842, ~n~0=v_~n~0_822, ~q~0.offset=v_~q~0.offset_842, ~s~0=v_~s~0_1798, ~q_front~0=v_~q_front~0_1842} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1217|, ~q_back~0=v_~q_back~0_1889, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1117|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1117|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_778|, ~N~0=v_~N~0_664, ~q~0.base=v_~q~0.base_842, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1117|, ~q~0.offset=v_~q~0.offset_842, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1052|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_782|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_778|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1061|, #memory_int=|v_#memory_int_1244|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1052|, ~n~0=v_~n~0_822, ~s~0=v_~s~0_1796, ~q_front~0=v_~q_front~0_1840} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 08:01:37,405 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 08:01:37,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15705 [2022-12-06 08:01:37,406 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 1328 transitions, 51959 flow [2022-12-06 08:01:37,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 08:01:37,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:37,406 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:37,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:37,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2022-12-06 08:01:37,613 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 39600318, now seen corresponding path program 1 times [2022-12-06 08:01:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:37,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180669584] [2022-12-06 08:01:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:37,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180669584] [2022-12-06 08:01:37,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180669584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:37,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974824819] [2022-12-06 08:01:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:37,990 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:37,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-12-06 08:01:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:38,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 08:01:38,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:38,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:38,402 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 08:01:38,402 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 26 treesize of output 18 [2022-12-06 08:01:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974824819] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:38,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:38,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-06 08:01:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468149472] [2022-12-06 08:01:38,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:38,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 08:01:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 08:01:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-06 08:01:38,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 79 [2022-12-06 08:01:38,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 1328 transitions, 51959 flow. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:38,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:38,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 79 [2022-12-06 08:01:38,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:44,714 INFO L130 PetriNetUnfolder]: 5347/9823 cut-off events. [2022-12-06 08:01:44,714 INFO L131 PetriNetUnfolder]: For 924027/924300 co-relation queries the response was YES. [2022-12-06 08:01:44,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146132 conditions, 9823 events. 5347/9823 cut-off events. For 924027/924300 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 79980 event pairs, 516 based on Foata normal form. 418/10239 useless extension candidates. Maximal degree in co-relation 145487. Up to 3708 conditions per place. [2022-12-06 08:01:44,850 INFO L137 encePairwiseOnDemand]: 13/79 looper letters, 416 selfloop transitions, 1055 changer transitions 9/1481 dead transitions. [2022-12-06 08:01:44,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1481 transitions, 58478 flow [2022-12-06 08:01:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 08:01:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 08:01:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 190 transitions. [2022-12-06 08:01:44,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15031645569620253 [2022-12-06 08:01:44,851 INFO L175 Difference]: Start difference. First operand has 446 places, 1328 transitions, 51959 flow. Second operand 16 states and 190 transitions. [2022-12-06 08:01:44,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 1481 transitions, 58478 flow [2022-12-06 08:01:49,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1481 transitions, 58250 flow, removed 103 selfloop flow, removed 4 redundant places. [2022-12-06 08:01:49,992 INFO L231 Difference]: Finished difference. Result has 465 places, 1385 transitions, 57688 flow [2022-12-06 08:01:49,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=50384, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=966, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=57688, PETRI_PLACES=465, PETRI_TRANSITIONS=1385} [2022-12-06 08:01:49,994 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 444 predicate places. [2022-12-06 08:01:49,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:49,994 INFO L89 Accepts]: Start accepts. Operand has 465 places, 1385 transitions, 57688 flow [2022-12-06 08:01:50,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:50,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:50,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 465 places, 1385 transitions, 57688 flow [2022-12-06 08:01:50,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 463 places, 1385 transitions, 57688 flow [2022-12-06 08:01:51,351 INFO L130 PetriNetUnfolder]: 1426/4096 cut-off events. [2022-12-06 08:01:51,352 INFO L131 PetriNetUnfolder]: For 386529/388532 co-relation queries the response was YES. [2022-12-06 08:01:51,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58192 conditions, 4096 events. 1426/4096 cut-off events. For 386529/388532 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 42214 event pairs, 59 based on Foata normal form. 342/4403 useless extension candidates. Maximal degree in co-relation 57620. Up to 1505 conditions per place. [2022-12-06 08:01:51,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 463 places, 1385 transitions, 57688 flow [2022-12-06 08:01:51,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 4442 [2022-12-06 08:01:51,443 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:51,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1450 [2022-12-06 08:01:51,444 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 1385 transitions, 57688 flow [2022-12-06 08:01:51,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:51,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:51,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:51,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:51,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2022-12-06 08:01:51,651 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 272764403, now seen corresponding path program 1 times [2022-12-06 08:01:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:51,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059392023] [2022-12-06 08:01:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059392023] [2022-12-06 08:01:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059392023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589763605] [2022-12-06 08:01:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:52,387 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:52,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-12-06 08:01:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:52,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 08:01:52,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:52,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:01:52,765 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 19 treesize of output 21 [2022-12-06 08:01:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:52,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:52,823 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6850 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6850) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-12-06 08:01:52,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:01:52,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-06 08:01:52,831 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 25 treesize of output 18 [2022-12-06 08:01:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589763605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:52,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:52,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 08:01:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349102460] [2022-12-06 08:01:52,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:52,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 08:01:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 08:01:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2022-12-06 08:01:52,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 08:01:52,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 1385 transitions, 57688 flow. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 08:01:52,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:52,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 08:01:52,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:59,558 INFO L130 PetriNetUnfolder]: 5796/10580 cut-off events. [2022-12-06 08:01:59,558 INFO L131 PetriNetUnfolder]: For 969221/969547 co-relation queries the response was YES. [2022-12-06 08:01:59,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164936 conditions, 10580 events. 5796/10580 cut-off events. For 969221/969547 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 85806 event pairs, 603 based on Foata normal form. 69/10649 useless extension candidates. Maximal degree in co-relation 164099. Up to 7933 conditions per place. [2022-12-06 08:01:59,701 INFO L137 encePairwiseOnDemand]: 16/77 looper letters, 1088 selfloop transitions, 491 changer transitions 0/1580 dead transitions. [2022-12-06 08:01:59,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1580 transitions, 67344 flow [2022-12-06 08:01:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 08:01:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 08:01:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 08:01:59,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22448979591836735 [2022-12-06 08:01:59,702 INFO L175 Difference]: Start difference. First operand has 463 places, 1385 transitions, 57688 flow. Second operand 7 states and 121 transitions. [2022-12-06 08:01:59,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 1580 transitions, 67344 flow [2022-12-06 08:02:06,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 1580 transitions, 65635 flow, removed 777 selfloop flow, removed 5 redundant places. [2022-12-06 08:02:06,945 INFO L231 Difference]: Finished difference. Result has 467 places, 1488 transitions, 62266 flow [2022-12-06 08:02:06,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=56156, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=62266, PETRI_PLACES=467, PETRI_TRANSITIONS=1488} [2022-12-06 08:02:06,950 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 446 predicate places. [2022-12-06 08:02:06,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:06,950 INFO L89 Accepts]: Start accepts. Operand has 467 places, 1488 transitions, 62266 flow [2022-12-06 08:02:06,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:06,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:06,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 467 places, 1488 transitions, 62266 flow [2022-12-06 08:02:06,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 467 places, 1488 transitions, 62266 flow [2022-12-06 08:02:08,550 INFO L130 PetriNetUnfolder]: 1562/4468 cut-off events. [2022-12-06 08:02:08,551 INFO L131 PetriNetUnfolder]: For 423790/425678 co-relation queries the response was YES. [2022-12-06 08:02:08,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62736 conditions, 4468 events. 1562/4468 cut-off events. For 423790/425678 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 46342 event pairs, 58 based on Foata normal form. 381/4810 useless extension candidates. Maximal degree in co-relation 62216. Up to 1639 conditions per place. [2022-12-06 08:02:08,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 467 places, 1488 transitions, 62266 flow [2022-12-06 08:02:08,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 4856 [2022-12-06 08:02:08,643 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:02:08,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1693 [2022-12-06 08:02:08,643 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 1488 transitions, 62266 flow [2022-12-06 08:02:08,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 08:02:08,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:08,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:08,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:08,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:08,850 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash 872468875, now seen corresponding path program 1 times [2022-12-06 08:02:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827791691] [2022-12-06 08:02:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:09,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827791691] [2022-12-06 08:02:09,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827791691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:09,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857299488] [2022-12-06 08:02:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:09,944 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:09,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-12-06 08:02:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:10,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 08:02:10,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:10,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:02:10,344 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 08:02:10,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:02:10,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-12-06 08:02:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:10,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:10,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:02:10,598 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 183 treesize of output 175 [2022-12-06 08:02:10,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:02:10,630 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 111 treesize of output 97 [2022-12-06 08:02:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:10,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857299488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:10,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:10,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 08:02:10,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049664494] [2022-12-06 08:02:10,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:10,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 08:02:10,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:10,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 08:02:10,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-06 08:02:10,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 08:02:10,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 1488 transitions, 62266 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 08:02:10,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:10,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 08:02:10,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:17,856 INFO L130 PetriNetUnfolder]: 5806/10603 cut-off events. [2022-12-06 08:02:17,856 INFO L131 PetriNetUnfolder]: For 945073/945560 co-relation queries the response was YES. [2022-12-06 08:02:17,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164404 conditions, 10603 events. 5806/10603 cut-off events. For 945073/945560 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 86361 event pairs, 1230 based on Foata normal form. 185/10788 useless extension candidates. Maximal degree in co-relation 163455. Up to 10392 conditions per place. [2022-12-06 08:02:17,997 INFO L137 encePairwiseOnDemand]: 21/77 looper letters, 1377 selfloop transitions, 120 changer transitions 10/1508 dead transitions. [2022-12-06 08:02:17,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 1508 transitions, 65541 flow [2022-12-06 08:02:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 08:02:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 08:02:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-12-06 08:02:17,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17316017316017315 [2022-12-06 08:02:17,999 INFO L175 Difference]: Start difference. First operand has 467 places, 1488 transitions, 62266 flow. Second operand 9 states and 120 transitions. [2022-12-06 08:02:17,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 1508 transitions, 65541 flow Received shutdown request... [2022-12-06 08:02:19,931 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 08:02:19,939 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 08:02:19,939 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 08:02:19,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:20,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2022-12-06 08:02:20,132 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 08:02:20,134 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 08:02:20,134 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 08:02:20,134 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:20,137 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 08:02:20,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 08:02:20,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:02:20 BasicIcfg [2022-12-06 08:02:20,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 08:02:20,140 INFO L158 Benchmark]: Toolchain (without parser) took 834017.45ms. Allocated memory was 180.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 139.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.06ms. Allocated memory is still 180.4MB. Free memory was 139.5MB in the beginning and 127.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.94ms. Allocated memory is still 180.4MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 180.4MB. Free memory was 125.4MB in the beginning and 123.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 INFO L158 Benchmark]: RCFGBuilder took 458.20ms. Allocated memory is still 180.4MB. Free memory was 123.8MB in the beginning and 100.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 INFO L158 Benchmark]: TraceAbstraction took 833222.55ms. Allocated memory was 180.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 99.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 08:02:20,142 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.10ms. Allocated memory is still 180.4MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.06ms. Allocated memory is still 180.4MB. Free memory was 139.5MB in the beginning and 127.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.94ms. Allocated memory is still 180.4MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 180.4MB. Free memory was 125.4MB in the beginning and 123.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 458.20ms. Allocated memory is still 180.4MB. Free memory was 123.8MB in the beginning and 100.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 833222.55ms. Allocated memory was 180.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 99.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 110 PlacesBefore, 21 PlacesAfterwards, 114 TransitionsBefore, 17 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 19 ConcurrentYvCompositions, 7 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 317, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 292, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 292, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 292, unknown conditional: 0, unknown unconditional: 292] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 459, Positive conditional cache size: 0, Positive unconditional cache size: 459, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.7s, 21 PlacesBefore, 20 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 46 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.2s, 26 PlacesBefore, 26 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 15, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 1, Positive unconditional cache size: 4, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 82 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): 5, Positive cache size: 5, Positive conditional cache size: 1, Positive unconditional cache size: 4, 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.8s, 30 PlacesBefore, 29 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 82 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): 5, Positive cache size: 5, Positive conditional cache size: 1, Positive unconditional cache size: 4, 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.1s, 36 PlacesBefore, 36 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 2, Positive unconditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 37 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 5, Positive unconditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 13, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 38 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 18, Positive conditional cache size: 14, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 42 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 27, Positive conditional cache size: 23, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 156 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): 31, Positive cache size: 27, Positive conditional cache size: 23, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 36, Positive conditional cache size: 32, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 39, Positive conditional cache size: 35, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 45 PlacesBefore, 45 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 168 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): 43, Positive cache size: 39, Positive conditional cache size: 35, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 68 PlacesBefore, 62 PlacesAfterwards, 84 TransitionsBefore, 78 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 27, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 53, Positive conditional cache size: 49, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 292 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): 57, Positive cache size: 53, Positive conditional cache size: 49, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 67 PlacesBefore, 66 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 82, Positive conditional cache size: 78, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 302 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): 86, Positive cache size: 82, Positive conditional cache size: 78, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 68 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 85, Positive conditional cache size: 81, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 71 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 104, Positive conditional cache size: 100, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 83 PlacesBefore, 83 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 18, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 219, Positive conditional cache size: 215, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 346 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): 223, Positive cache size: 219, Positive conditional cache size: 215, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 89 PlacesBefore, 88 PlacesAfterwards, 120 TransitionsBefore, 119 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 275, Positive conditional cache size: 271, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 486 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): 282, Positive cache size: 275, Positive conditional cache size: 271, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 108 PlacesBefore, 108 PlacesAfterwards, 144 TransitionsBefore, 144 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 282, Positive conditional cache size: 278, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 454 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): 289, Positive cache size: 282, Positive conditional cache size: 278, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 113 PlacesBefore, 113 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 283, Positive conditional cache size: 279, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 496 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): 290, Positive cache size: 283, Positive conditional cache size: 279, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 93 PlacesBefore, 92 PlacesAfterwards, 108 TransitionsBefore, 107 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 16, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 372 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 90 PlacesBefore, 90 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 382 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 92 PlacesBefore, 92 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 390 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 107 PlacesBefore, 106 PlacesAfterwards, 129 TransitionsBefore, 128 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 291, Positive conditional cache size: 287, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 114 PlacesBefore, 111 PlacesAfterwards, 132 TransitionsBefore, 129 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 325, Positive conditional cache size: 321, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 123 PlacesBefore, 122 PlacesAfterwards, 153 TransitionsBefore, 152 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 486 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): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 128 PlacesBefore, 128 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 504 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): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 132 PlacesBefore, 132 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 522 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): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 122 PlacesBefore, 118 PlacesAfterwards, 113 TransitionsBefore, 109 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 12, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 422, Positive conditional cache size: 418, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 340 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): 429, Positive cache size: 422, Positive conditional cache size: 418, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 111 PlacesBefore, 111 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 428, Positive conditional cache size: 424, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 117 PlacesBefore, 116 PlacesAfterwards, 114 TransitionsBefore, 113 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 471, Positive conditional cache size: 467, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 111 PlacesBefore, 111 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 472, Positive conditional cache size: 468, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 290 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): 479, Positive cache size: 472, Positive conditional cache size: 468, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 109 PlacesBefore, 108 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 473, Positive conditional cache size: 469, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 112 PlacesBefore, 113 PlacesAfterwards, 95 TransitionsBefore, 96 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 476, Positive conditional cache size: 472, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 110 PlacesBefore, 110 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 518, Positive conditional cache size: 514, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 123 PlacesBefore, 122 PlacesAfterwards, 102 TransitionsBefore, 101 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 564, Positive conditional cache size: 560, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 298 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): 571, Positive cache size: 564, Positive conditional cache size: 560, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 114 PlacesBefore, 114 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 296 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): 571, Positive cache size: 564, Positive conditional cache size: 560, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 128 PlacesBefore, 121 PlacesAfterwards, 109 TransitionsBefore, 103 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 41, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 757, Positive conditional cache size: 753, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 117 PlacesBefore, 116 PlacesAfterwards, 101 TransitionsBefore, 100 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 837, Positive cache size: 830, Positive conditional cache size: 826, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 113 PlacesBefore, 113 PlacesAfterwards, 99 TransitionsBefore, 100 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 833, Positive conditional cache size: 829, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 109 PlacesBefore, 109 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, 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): 840, Positive cache size: 833, Positive conditional cache size: 829, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 106 PlacesBefore, 106 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 843, Positive cache size: 836, Positive conditional cache size: 832, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 280 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): 843, Positive cache size: 836, Positive conditional cache size: 832, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 84 PlacesBefore, 84 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 260 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): 843, Positive cache size: 836, Positive conditional cache size: 832, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 86 PlacesBefore, 84 PlacesAfterwards, 100 TransitionsBefore, 98 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 360 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): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 5.2s, 93 PlacesBefore, 93 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 372 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): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 91 PlacesBefore, 91 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 982, Positive conditional cache size: 978, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 103 PlacesBefore, 102 PlacesAfterwards, 146 TransitionsBefore, 145 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 994, Positive cache size: 987, Positive conditional cache size: 983, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 468 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): 994, Positive cache size: 987, Positive conditional cache size: 983, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 121 PlacesBefore, 121 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 578 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): 994, Positive cache size: 987, Positive conditional cache size: 983, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 141 PlacesBefore, 140 PlacesAfterwards, 203 TransitionsBefore, 202 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 991, Positive conditional cache size: 987, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 137 PlacesBefore, 137 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 586 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): 998, Positive cache size: 991, Positive conditional cache size: 987, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 132 PlacesBefore, 132 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 556 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): 998, Positive cache size: 991, Positive conditional cache size: 987, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 130 PlacesBefore, 130 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 995, Positive conditional cache size: 991, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 143 PlacesBefore, 141 PlacesAfterwards, 200 TransitionsBefore, 198 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1008, Positive cache size: 996, Positive conditional cache size: 992, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 150 PlacesBefore, 145 PlacesAfterwards, 211 TransitionsBefore, 206 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 30, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1336, Positive conditional cache size: 1332, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 142 PlacesBefore, 142 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 678 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): 1348, Positive cache size: 1336, Positive conditional cache size: 1332, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 143 PlacesBefore, 143 PlacesAfterwards, 231 TransitionsBefore, 231 TransitionsAfterwards, 708 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): 1348, Positive cache size: 1336, Positive conditional cache size: 1332, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 5.3s, 148 PlacesBefore, 146 PlacesAfterwards, 235 TransitionsBefore, 233 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1676, Positive conditional cache size: 1672, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 166 PlacesBefore, 165 PlacesAfterwards, 267 TransitionsBefore, 266 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 163 PlacesBefore, 163 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 822 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 163 PlacesBefore, 163 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 820 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 166 PlacesBefore, 166 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 874 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 170 PlacesBefore, 170 PlacesAfterwards, 321 TransitionsBefore, 321 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1698, Positive cache size: 1686, Positive conditional cache size: 1682, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 178 PlacesBefore, 178 PlacesAfterwards, 325 TransitionsBefore, 325 TransitionsAfterwards, 1056 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1699, Positive cache size: 1687, Positive conditional cache size: 1683, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 189 PlacesBefore, 188 PlacesAfterwards, 335 TransitionsBefore, 333 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1798, Positive cache size: 1786, Positive conditional cache size: 1782, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 181 PlacesBefore, 181 PlacesAfterwards, 330 TransitionsBefore, 330 TransitionsAfterwards, 1066 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): 1798, Positive cache size: 1786, Positive conditional cache size: 1782, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.4s, 186 PlacesBefore, 186 PlacesAfterwards, 340 TransitionsBefore, 340 TransitionsAfterwards, 1094 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 186 PlacesBefore, 186 PlacesAfterwards, 337 TransitionsBefore, 337 TransitionsAfterwards, 1088 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 185 PlacesBefore, 185 PlacesAfterwards, 337 TransitionsBefore, 337 TransitionsAfterwards, 1088 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 190 PlacesBefore, 190 PlacesAfterwards, 339 TransitionsBefore, 339 TransitionsAfterwards, 1096 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 194 PlacesBefore, 194 PlacesAfterwards, 344 TransitionsBefore, 344 TransitionsAfterwards, 1110 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.8s, 208 PlacesBefore, 206 PlacesAfterwards, 351 TransitionsBefore, 349 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1902, Positive cache size: 1890, Positive conditional cache size: 1886, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 208 PlacesBefore, 208 PlacesAfterwards, 356 TransitionsBefore, 356 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1905, Positive cache size: 1893, Positive conditional cache size: 1889, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 212 PlacesBefore, 210 PlacesAfterwards, 357 TransitionsBefore, 355 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1913, Positive cache size: 1901, Positive conditional cache size: 1897, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 201 PlacesBefore, 201 PlacesAfterwards, 363 TransitionsBefore, 363 TransitionsAfterwards, 1174 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): 1913, Positive cache size: 1901, Positive conditional cache size: 1897, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.7s, 204 PlacesBefore, 202 PlacesAfterwards, 365 TransitionsBefore, 363 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2025, Positive cache size: 2013, Positive conditional cache size: 2009, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 202 PlacesBefore, 202 PlacesAfterwards, 379 TransitionsBefore, 379 TransitionsAfterwards, 1210 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): 2025, Positive cache size: 2013, Positive conditional cache size: 2009, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 209 PlacesBefore, 208 PlacesAfterwards, 380 TransitionsBefore, 379 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, 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): 2026, Positive cache size: 2014, Positive conditional cache size: 2010, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 213 PlacesBefore, 211 PlacesAfterwards, 381 TransitionsBefore, 379 TransitionsAfterwards, 1218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2036, Positive cache size: 2024, Positive conditional cache size: 2020, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 217 PlacesBefore, 213 PlacesAfterwards, 387 TransitionsBefore, 383 TransitionsAfterwards, 1230 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 34, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2043, Positive cache size: 2031, Positive conditional cache size: 2027, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 208 PlacesBefore, 208 PlacesAfterwards, 391 TransitionsBefore, 391 TransitionsAfterwards, 1224 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): 2043, Positive cache size: 2031, Positive conditional cache size: 2027, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 211 PlacesBefore, 209 PlacesAfterwards, 392 TransitionsBefore, 390 TransitionsAfterwards, 1230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2149, Positive conditional cache size: 2145, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 208 PlacesBefore, 208 PlacesAfterwards, 481 TransitionsBefore, 481 TransitionsAfterwards, 1544 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): 2161, Positive cache size: 2149, Positive conditional cache size: 2145, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 214 PlacesBefore, 214 PlacesAfterwards, 496 TransitionsBefore, 496 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 219 PlacesBefore, 219 PlacesAfterwards, 498 TransitionsBefore, 498 TransitionsAfterwards, 1604 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): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 234 PlacesBefore, 234 PlacesAfterwards, 537 TransitionsBefore, 537 TransitionsAfterwards, 1762 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): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 234 PlacesBefore, 234 PlacesAfterwards, 535 TransitionsBefore, 535 TransitionsAfterwards, 1756 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): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.6s, 242 PlacesBefore, 242 PlacesAfterwards, 541 TransitionsBefore, 541 TransitionsAfterwards, 1766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2169, Positive cache size: 2157, Positive conditional cache size: 2153, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 241 PlacesBefore, 241 PlacesAfterwards, 538 TransitionsBefore, 538 TransitionsAfterwards, 1752 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): 2169, Positive cache size: 2157, Positive conditional cache size: 2153, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 252 PlacesBefore, 252 PlacesAfterwards, 564 TransitionsBefore, 564 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2170, Positive cache size: 2158, Positive conditional cache size: 2154, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 253 PlacesBefore, 252 PlacesAfterwards, 560 TransitionsBefore, 559 TransitionsAfterwards, 1830 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, 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): 2171, Positive cache size: 2159, Positive conditional cache size: 2155, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 255 PlacesBefore, 255 PlacesAfterwards, 583 TransitionsBefore, 583 TransitionsAfterwards, 1936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 260 PlacesBefore, 260 PlacesAfterwards, 586 TransitionsBefore, 586 TransitionsAfterwards, 1928 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): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 260 PlacesBefore, 260 PlacesAfterwards, 584 TransitionsBefore, 584 TransitionsAfterwards, 1922 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): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 261 PlacesBefore, 261 PlacesAfterwards, 608 TransitionsBefore, 608 TransitionsAfterwards, 2030 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): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.4s, 276 PlacesBefore, 275 PlacesAfterwards, 705 TransitionsBefore, 704 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2179, Positive cache size: 2167, Positive conditional cache size: 2163, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 289 PlacesBefore, 289 PlacesAfterwards, 792 TransitionsBefore, 792 TransitionsAfterwards, 2710 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): 2179, Positive cache size: 2167, Positive conditional cache size: 2163, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 299 PlacesBefore, 298 PlacesAfterwards, 791 TransitionsBefore, 790 TransitionsAfterwards, 2708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2184, Positive cache size: 2172, Positive conditional cache size: 2168, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 296 PlacesBefore, 296 PlacesAfterwards, 788 TransitionsBefore, 788 TransitionsAfterwards, 2700 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): 2184, Positive cache size: 2172, Positive conditional cache size: 2168, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 311 PlacesBefore, 307 PlacesAfterwards, 811 TransitionsBefore, 807 TransitionsAfterwards, 2810 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 33, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3321, Positive cache size: 3309, Positive conditional cache size: 3305, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 328 PlacesBefore, 327 PlacesAfterwards, 812 TransitionsBefore, 811 TransitionsAfterwards, 2746 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 15, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3584, Positive cache size: 3572, Positive conditional cache size: 3568, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 318 PlacesBefore, 318 PlacesAfterwards, 913 TransitionsBefore, 913 TransitionsAfterwards, 3084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3585, Positive cache size: 3573, Positive conditional cache size: 3569, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 328 PlacesBefore, 328 PlacesAfterwards, 1063 TransitionsBefore, 1063 TransitionsAfterwards, 3546 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): 3585, Positive cache size: 3573, Positive conditional cache size: 3569, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.7s, 329 PlacesBefore, 329 PlacesAfterwards, 1059 TransitionsBefore, 1059 TransitionsAfterwards, 3526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3588, Positive cache size: 3576, Positive conditional cache size: 3572, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 323 PlacesBefore, 323 PlacesAfterwards, 1055 TransitionsBefore, 1055 TransitionsAfterwards, 3510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3589, Positive cache size: 3577, Positive conditional cache size: 3573, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 331 PlacesBefore, 331 PlacesAfterwards, 1055 TransitionsBefore, 1055 TransitionsAfterwards, 3502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3592, Positive cache size: 3580, Positive conditional cache size: 3576, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 335 PlacesBefore, 334 PlacesAfterwards, 1057 TransitionsBefore, 1056 TransitionsAfterwards, 3504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3595, Positive cache size: 3583, Positive conditional cache size: 3579, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 340 PlacesBefore, 340 PlacesAfterwards, 1075 TransitionsBefore, 1075 TransitionsAfterwards, 3556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3599, Positive cache size: 3587, Positive conditional cache size: 3583, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 345 PlacesBefore, 345 PlacesAfterwards, 1088 TransitionsBefore, 1088 TransitionsAfterwards, 3622 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): 3599, Positive cache size: 3587, Positive conditional cache size: 3583, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 351 PlacesBefore, 351 PlacesAfterwards, 1091 TransitionsBefore, 1091 TransitionsAfterwards, 3626 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): 3599, Positive cache size: 3587, Positive conditional cache size: 3583, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 347 PlacesBefore, 346 PlacesAfterwards, 1083 TransitionsBefore, 1082 TransitionsAfterwards, 3600 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3602, Positive cache size: 3590, Positive conditional cache size: 3586, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 348 PlacesBefore, 348 PlacesAfterwards, 1076 TransitionsBefore, 1076 TransitionsAfterwards, 3562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3603, Positive cache size: 3591, Positive conditional cache size: 3587, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 365 PlacesBefore, 365 PlacesAfterwards, 1134 TransitionsBefore, 1134 TransitionsAfterwards, 3758 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3609, Positive cache size: 3597, Positive conditional cache size: 3593, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 358 PlacesBefore, 357 PlacesAfterwards, 1126 TransitionsBefore, 1125 TransitionsAfterwards, 3736 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3611, Positive cache size: 3599, Positive conditional cache size: 3595, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 1123 TransitionsBefore, 1123 TransitionsAfterwards, 3722 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): 3611, Positive cache size: 3599, Positive conditional cache size: 3595, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 347 PlacesBefore, 347 PlacesAfterwards, 1116 TransitionsBefore, 1115 TransitionsAfterwards, 3700 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 12, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3616, Positive cache size: 3604, Positive conditional cache size: 3600, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 358 PlacesBefore, 358 PlacesAfterwards, 1120 TransitionsBefore, 1120 TransitionsAfterwards, 3702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3617, Positive cache size: 3605, Positive conditional cache size: 3601, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 358 PlacesBefore, 358 PlacesAfterwards, 1118 TransitionsBefore, 1118 TransitionsAfterwards, 3692 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): 3617, Positive cache size: 3605, Positive conditional cache size: 3601, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 376 PlacesBefore, 373 PlacesAfterwards, 1208 TransitionsBefore, 1205 TransitionsAfterwards, 3980 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3762, Positive cache size: 3750, Positive conditional cache size: 3746, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 412 PlacesBefore, 412 PlacesAfterwards, 1326 TransitionsBefore, 1326 TransitionsAfterwards, 4276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3767, Positive cache size: 3755, Positive conditional cache size: 3751, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 411 PlacesBefore, 408 PlacesAfterwards, 1339 TransitionsBefore, 1337 TransitionsAfterwards, 4298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3775, Positive cache size: 3763, Positive conditional cache size: 3759, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 399 PlacesBefore, 398 PlacesAfterwards, 1333 TransitionsBefore, 1332 TransitionsAfterwards, 4272 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3779, Positive cache size: 3767, Positive conditional cache size: 3763, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 380 PlacesBefore, 380 PlacesAfterwards, 1222 TransitionsBefore, 1222 TransitionsAfterwards, 3982 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3931, Positive cache size: 3919, Positive conditional cache size: 3915, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 374 PlacesBefore, 374 PlacesAfterwards, 1161 TransitionsBefore, 1161 TransitionsAfterwards, 3772 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3933, Positive cache size: 3921, Positive conditional cache size: 3917, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.7s, 379 PlacesBefore, 378 PlacesAfterwards, 1150 TransitionsBefore, 1149 TransitionsAfterwards, 3726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3933, Positive cache size: 3921, Positive conditional cache size: 3917, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.7s, 374 PlacesBefore, 373 PlacesAfterwards, 1148 TransitionsBefore, 1147 TransitionsAfterwards, 3726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3934, Positive cache size: 3922, Positive conditional cache size: 3918, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 391 PlacesBefore, 388 PlacesAfterwards, 1184 TransitionsBefore, 1181 TransitionsAfterwards, 3828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 12, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3949, Positive cache size: 3937, Positive conditional cache size: 3933, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 397 PlacesBefore, 397 PlacesAfterwards, 1209 TransitionsBefore, 1209 TransitionsAfterwards, 3922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3953, Positive cache size: 3941, Positive conditional cache size: 3937, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 402 PlacesBefore, 401 PlacesAfterwards, 1209 TransitionsBefore, 1208 TransitionsAfterwards, 3918 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3955, Positive cache size: 3943, Positive conditional cache size: 3939, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 396 PlacesBefore, 396 PlacesAfterwards, 1207 TransitionsBefore, 1207 TransitionsAfterwards, 3916 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): 3955, Positive cache size: 3943, Positive conditional cache size: 3939, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 401 PlacesBefore, 400 PlacesAfterwards, 1206 TransitionsBefore, 1205 TransitionsAfterwards, 3920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3957, Positive cache size: 3945, Positive conditional cache size: 3941, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 405 PlacesBefore, 402 PlacesAfterwards, 1204 TransitionsBefore, 1201 TransitionsAfterwards, 3900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4283, Positive cache size: 4271, Positive conditional cache size: 4267, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 399 PlacesBefore, 399 PlacesAfterwards, 1200 TransitionsBefore, 1200 TransitionsAfterwards, 3880 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4284, Positive cache size: 4272, Positive conditional cache size: 4268, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 398 PlacesBefore, 398 PlacesAfterwards, 1212 TransitionsBefore, 1212 TransitionsAfterwards, 3904 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): 4284, Positive cache size: 4272, Positive conditional cache size: 4268, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.7s, 403 PlacesBefore, 402 PlacesAfterwards, 1211 TransitionsBefore, 1210 TransitionsAfterwards, 3902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4285, Positive cache size: 4273, Positive conditional cache size: 4269, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 407 PlacesBefore, 407 PlacesAfterwards, 1244 TransitionsBefore, 1244 TransitionsAfterwards, 4036 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4286, Positive cache size: 4274, Positive conditional cache size: 4270, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 413 PlacesBefore, 413 PlacesAfterwards, 1241 TransitionsBefore, 1241 TransitionsAfterwards, 4022 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): 4286, Positive cache size: 4274, Positive conditional cache size: 4270, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 433 PlacesBefore, 431 PlacesAfterwards, 1281 TransitionsBefore, 1279 TransitionsAfterwards, 4146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4294, Positive cache size: 4282, Positive conditional cache size: 4278, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 426 PlacesBefore, 426 PlacesAfterwards, 1279 TransitionsBefore, 1279 TransitionsAfterwards, 4122 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): 4294, Positive cache size: 4282, Positive conditional cache size: 4278, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 432 PlacesBefore, 432 PlacesAfterwards, 1307 TransitionsBefore, 1307 TransitionsAfterwards, 4238 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): 4294, Positive cache size: 4282, Positive conditional cache size: 4278, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 14.2s, 447 PlacesBefore, 446 PlacesAfterwards, 1329 TransitionsBefore, 1328 TransitionsAfterwards, 4274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4296, Positive cache size: 4284, Positive conditional cache size: 4280, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 463 PlacesBefore, 463 PlacesAfterwards, 1385 TransitionsBefore, 1385 TransitionsAfterwards, 4442 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): 4296, Positive cache size: 4284, Positive conditional cache size: 4280, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 467 PlacesBefore, 467 PlacesAfterwards, 1488 TransitionsBefore, 1488 TransitionsAfterwards, 4856 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): 4296, Positive cache size: 4284, Positive conditional cache size: 4280, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 134 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: 833.1s, OverallIterations: 159, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 479.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 5935 SdHoareTripleChecker+Valid, 50.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5935 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 44.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 484 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 6159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72883 IncrementalHoareTripleChecker+Invalid, 79558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6159 mSolverCounterUnsat, 1 mSDtfsCounter, 72883 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4057 GetRequests, 1884 SyntacticMatches, 121 SemanticMatches, 2052 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 4598 ImplicationChecksByTransitivity, 41.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62266occurred in iteration=158, InterpolantAutomatonStates: 1399, 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: 1.1s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 115.3s InterpolantComputationTime, 3634 NumberOfCodeBlocks, 3632 NumberOfCodeBlocksAsserted, 281 NumberOfCheckSat, 4580 ConstructedInterpolants, 36 QuantifiedInterpolants, 113981 SizeOfPredicates, 1685 NumberOfNonLiveVariables, 25343 ConjunctsInSsa, 3843 ConjunctsInUnsatCore, 363 InterpolantComputations, 64 PerfectInterpolantSequences, 57/642 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