/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-a802222-m [2022-12-13 13:32:49,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:32:49,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:32:49,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:32:49,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:32:49,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:32:49,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:32:49,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:32:49,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:32:49,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:32:49,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:32:49,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:32:49,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:32:49,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:32:49,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:32:49,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:32:49,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:32:49,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:32:49,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:32:49,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:32:49,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:32:49,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:32:49,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:32:49,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:32:49,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:32:49,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:32:49,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:32:49,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:32:49,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:32:49,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:32:49,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:32:49,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:32:49,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:32:49,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:32:49,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:32:49,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:32:49,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:32:49,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:32:49,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:32:49,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:32:49,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:32:49,937 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-13 13:32:49,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:32:49,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:32:49,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:32:49,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:32:49,967 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:32:49,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:32:49,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:32:49,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:32:49,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:32:49,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:32:49,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:32:49,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:32:49,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:32:49,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:32:49,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:32:49,970 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-13 13:32:50,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:32:50,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:32:50,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:32:50,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:32:50,223 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:32:50,224 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-13 13:32:51,097 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:32:51,288 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:32:51,289 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-13 13:32:51,293 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8406c717/a4e7b8186c7b48f2a1c0188dcbe433f7/FLAG8ccebb371 [2022-12-13 13:32:51,305 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8406c717/a4e7b8186c7b48f2a1c0188dcbe433f7 [2022-12-13 13:32:51,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:32:51,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:32:51,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:32:51,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:32:51,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:32:51,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4bb4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51, skipping insertion in model container [2022-12-13 13:32:51,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:32:51,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:32:51,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:51,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:51,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:51,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:51,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:51,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:51,438 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-13 13:32:51,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:32:51,459 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:32:51,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:51,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:51,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:51,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:51,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:32:51,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:32:51,489 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-13 13:32:51,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:32:51,507 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:32:51,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51 WrapperNode [2022-12-13 13:32:51,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:32:51,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:32:51,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:32:51,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:32:51,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,550 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2022-12-13 13:32:51,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:32:51,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:32:51,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:32:51,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:32:51,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:32:51,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:32:51,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:32:51,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:32:51,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (1/1) ... [2022-12-13 13:32:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:32:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:32:51,625 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-13 13:32:51,642 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-13 13:32:51,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:32:51,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:32:51,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:32:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:32:51,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:32:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:32:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:32:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:32:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:32:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:32:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:32:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:32:51,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:32:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:32:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:32:51,657 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:32:51,745 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:32:51,746 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:32:51,994 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:32:52,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:32:52,051 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:32:52,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:32:52 BoogieIcfgContainer [2022-12-13 13:32:52,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:32:52,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:32:52,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:32:52,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:32:52,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:32:51" (1/3) ... [2022-12-13 13:32:52,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65469a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:32:52, skipping insertion in model container [2022-12-13 13:32:52,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:51" (2/3) ... [2022-12-13 13:32:52,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65469a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:32:52, skipping insertion in model container [2022-12-13 13:32:52,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:32:52" (3/3) ... [2022-12-13 13:32:52,058 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-12-13 13:32:52,071 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:32:52,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:32:52,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:32:52,114 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 13:32:52,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 264 flow [2022-12-13 13:32:52,217 INFO L130 PetriNetUnfolder]: 11/122 cut-off events. [2022-12-13 13:32:52,217 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:32:52,222 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-13 13:32:52,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 264 flow [2022-12-13 13:32:52,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 114 transitions, 240 flow [2022-12-13 13:32:52,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:52,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-13 13:32:52,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 114 transitions, 240 flow [2022-12-13 13:32:52,284 INFO L130 PetriNetUnfolder]: 11/114 cut-off events. [2022-12-13 13:32:52,284 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:32:52,285 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-13 13:32:52,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-13 13:32:52,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 13:32:56,015 INFO L241 LiptonReduction]: Total number of compositions: 96 [2022-12-13 13:32:56,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:32:56,029 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;@104194f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:32:56,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 13:32:56,033 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 13:32:56,033 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:32:56,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:56,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:56,034 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-13 13:32:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 82611840, now seen corresponding path program 1 times [2022-12-13 13:32:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:56,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465863695] [2022-12-13 13:32:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:56,391 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-13 13:32:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465863695] [2022-12-13 13:32:56,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465863695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:56,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:56,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876123534] [2022-12-13 13:32:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:56,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:56,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:32:56,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 13:32:56,417 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-13 13:32:56,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:56,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 13:32:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:56,493 INFO L130 PetriNetUnfolder]: 45/87 cut-off events. [2022-12-13 13:32:56,493 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 13:32:56,494 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-13 13:32:56,496 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 14 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2022-12-13 13:32:56,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 106 flow [2022-12-13 13:32:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 13:32:56,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 13:32:56,505 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 4 states and 33 transitions. [2022-12-13 13:32:56,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 106 flow [2022-12-13 13:32:56,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:32:56,509 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 58 flow [2022-12-13 13:32:56,510 INFO L277 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-13 13:32:56,512 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2022-12-13 13:32:56,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:56,513 INFO L89 Accepts]: Start accepts. Operand has 22 places, 18 transitions, 58 flow [2022-12-13 13:32:56,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:56,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:56,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 58 flow [2022-12-13 13:32:56,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 58 flow [2022-12-13 13:32:56,522 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-13 13:32:56,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:32:56,523 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-13 13:32:56,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 18 transitions, 58 flow [2022-12-13 13:32:56,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-13 13:32:57,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:32:57,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-13 13:32:57,224 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 54 flow [2022-12-13 13:32:57,225 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-13 13:32:57,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:57,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:57,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:32:57,225 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-13 13:32:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1818505939, now seen corresponding path program 1 times [2022-12-13 13:32:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:57,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968823398] [2022-12-13 13:32:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:57,528 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-13 13:32:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968823398] [2022-12-13 13:32:57,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968823398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:57,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:57,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:32:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723761276] [2022-12-13 13:32:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:57,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:32:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:32:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:57,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 13:32:57,532 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-13 13:32:57,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:57,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 13:32:57,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:57,606 INFO L130 PetriNetUnfolder]: 72/135 cut-off events. [2022-12-13 13:32:57,607 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-13 13:32:57,607 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-13 13:32:57,608 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 31 selfloop transitions, 8 changer transitions 2/42 dead transitions. [2022-12-13 13:32:57,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 42 transitions, 212 flow [2022-12-13 13:32:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:32:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:32:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-13 13:32:57,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 13:32:57,609 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 54 flow. Second operand 6 states and 48 transitions. [2022-12-13 13:32:57,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 42 transitions, 212 flow [2022-12-13 13:32:57,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 204 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 13:32:57,610 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 104 flow [2022-12-13 13:32:57,610 INFO L277 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-13 13:32:57,611 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 13:32:57,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:57,611 INFO L89 Accepts]: Start accepts. Operand has 26 places, 23 transitions, 104 flow [2022-12-13 13:32:57,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:57,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:57,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 23 transitions, 104 flow [2022-12-13 13:32:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 104 flow [2022-12-13 13:32:57,616 INFO L130 PetriNetUnfolder]: 16/50 cut-off events. [2022-12-13 13:32:57,617 INFO L131 PetriNetUnfolder]: For 14/26 co-relation queries the response was YES. [2022-12-13 13:32:57,617 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 122 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-13 13:32:57,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 104 flow [2022-12-13 13:32:57,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 13:32:57,797 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-13 13:32:57,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:32:57,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 13:32:57,845 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 110 flow [2022-12-13 13:32:57,845 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-13 13:32:57,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:57,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:57,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:32:57,846 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-13 13:32:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2133734352, now seen corresponding path program 1 times [2022-12-13 13:32:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:57,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394962641] [2022-12-13 13:32:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:57,914 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-13 13:32:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:57,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394962641] [2022-12-13 13:32:57,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394962641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:57,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:57,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512874193] [2022-12-13 13:32:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:57,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:32:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:32:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:32:57,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-13 13:32:57,916 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-13 13:32:57,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:57,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-13 13:32:57,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:57,979 INFO L130 PetriNetUnfolder]: 87/180 cut-off events. [2022-12-13 13:32:57,979 INFO L131 PetriNetUnfolder]: For 168/206 co-relation queries the response was YES. [2022-12-13 13:32:57,979 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 660 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-13 13:32:57,980 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 29 selfloop transitions, 9 changer transitions 3/42 dead transitions. [2022-12-13 13:32:57,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 254 flow [2022-12-13 13:32:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:32:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:32:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 13:32:57,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 13:32:57,982 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 110 flow. Second operand 4 states and 48 transitions. [2022-12-13 13:32:57,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 254 flow [2022-12-13 13:32:57,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 237 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 13:32:57,983 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 151 flow [2022-12-13 13:32:57,984 INFO L277 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-13 13:32:57,984 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 8 predicate places. [2022-12-13 13:32:57,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:57,984 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 151 flow [2022-12-13 13:32:57,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:57,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:57,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 151 flow [2022-12-13 13:32:57,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 151 flow [2022-12-13 13:32:57,990 INFO L130 PetriNetUnfolder]: 18/63 cut-off events. [2022-12-13 13:32:57,990 INFO L131 PetriNetUnfolder]: For 57/71 co-relation queries the response was YES. [2022-12-13 13:32:57,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 63 events. 18/63 cut-off events. For 57/71 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 170 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-13 13:32:57,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 151 flow [2022-12-13 13:32:57,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 13:32:57,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:32:57,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 13:32:57,992 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 151 flow [2022-12-13 13:32:57,993 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-13 13:32:57,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:57,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:57,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:32:57,993 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-13 13:32:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash -890155735, now seen corresponding path program 1 times [2022-12-13 13:32:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:57,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836194358] [2022-12-13 13:32:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:58,077 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-13 13:32:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:58,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836194358] [2022-12-13 13:32:58,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836194358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:58,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:58,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:32:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083582173] [2022-12-13 13:32:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:58,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:32:58,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 13:32:58,079 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-13 13:32:58,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:58,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 13:32:58,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:58,144 INFO L130 PetriNetUnfolder]: 82/179 cut-off events. [2022-12-13 13:32:58,145 INFO L131 PetriNetUnfolder]: For 293/299 co-relation queries the response was YES. [2022-12-13 13:32:58,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 179 events. 82/179 cut-off events. For 293/299 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 589 event pairs, 36 based on Foata normal form. 14/165 useless extension candidates. Maximal degree in co-relation 714. Up to 158 conditions per place. [2022-12-13 13:32:58,146 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 23 selfloop transitions, 2 changer transitions 11/37 dead transitions. [2022-12-13 13:32:58,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 269 flow [2022-12-13 13:32:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:32:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:32:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 13:32:58,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-13 13:32:58,147 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 151 flow. Second operand 5 states and 35 transitions. [2022-12-13 13:32:58,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 269 flow [2022-12-13 13:32:58,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 237 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 13:32:58,149 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 145 flow [2022-12-13 13:32:58,150 INFO L277 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-13 13:32:58,150 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2022-12-13 13:32:58,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:58,150 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 145 flow [2022-12-13 13:32:58,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:58,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:58,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 145 flow [2022-12-13 13:32:58,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 145 flow [2022-12-13 13:32:58,156 INFO L130 PetriNetUnfolder]: 18/64 cut-off events. [2022-12-13 13:32:58,157 INFO L131 PetriNetUnfolder]: For 33/35 co-relation queries the response was YES. [2022-12-13 13:32:58,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 64 events. 18/64 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 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-13 13:32:58,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 145 flow [2022-12-13 13:32:58,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 13:32:59,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:32:59,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 880 [2022-12-13 13:32:59,030 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 141 flow [2022-12-13 13:32:59,031 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-13 13:32:59,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:32:59,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:59,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:32:59,031 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-13 13:32:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1901789373, now seen corresponding path program 1 times [2022-12-13 13:32:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:59,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399271713] [2022-12-13 13:32:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:59,287 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-13 13:32:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:59,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399271713] [2022-12-13 13:32:59,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399271713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:59,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:59,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:32:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344147683] [2022-12-13 13:32:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:59,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:32:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:32:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:32:59,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 13:32:59,289 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-13 13:32:59,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:32:59,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 13:32:59,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:32:59,414 INFO L130 PetriNetUnfolder]: 111/232 cut-off events. [2022-12-13 13:32:59,414 INFO L131 PetriNetUnfolder]: For 284/290 co-relation queries the response was YES. [2022-12-13 13:32:59,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 232 events. 111/232 cut-off events. For 284/290 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 859 event pairs, 15 based on Foata normal form. 12/202 useless extension candidates. Maximal degree in co-relation 865. Up to 169 conditions per place. [2022-12-13 13:32:59,415 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 40 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2022-12-13 13:32:59,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 376 flow [2022-12-13 13:32:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:32:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:32:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-13 13:32:59,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-13 13:32:59,417 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 141 flow. Second operand 6 states and 47 transitions. [2022-12-13 13:32:59,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 376 flow [2022-12-13 13:32:59,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 53 transitions, 340 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 13:32:59,419 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 244 flow [2022-12-13 13:32:59,419 INFO L277 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=6, PETRI_FLOW=244, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-13 13:32:59,419 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-13 13:32:59,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:32:59,419 INFO L89 Accepts]: Start accepts. Operand has 34 places, 36 transitions, 244 flow [2022-12-13 13:32:59,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:32:59,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:32:59,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 244 flow [2022-12-13 13:32:59,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 244 flow [2022-12-13 13:32:59,428 INFO L130 PetriNetUnfolder]: 37/116 cut-off events. [2022-12-13 13:32:59,429 INFO L131 PetriNetUnfolder]: For 127/144 co-relation queries the response was YES. [2022-12-13 13:32:59,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 116 events. 37/116 cut-off events. For 127/144 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 426 event pairs, 0 based on Foata normal form. 5/94 useless extension candidates. Maximal degree in co-relation 283. Up to 39 conditions per place. [2022-12-13 13:32:59,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 244 flow [2022-12-13 13:32:59,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-13 13:32:59,430 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-13 13:32:59,526 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-13 13:32:59,720 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:32:59,720 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:32:59,720 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:32:59,720 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:02,147 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:33:02,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2729 [2022-12-13 13:33:02,148 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 274 flow [2022-12-13 13:33:02,149 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-13 13:33:02,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:02,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:02,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:33:02,149 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-13 13:33:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2019229262, now seen corresponding path program 1 times [2022-12-13 13:33:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251229049] [2022-12-13 13:33:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:02,440 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-13 13:33:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:02,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251229049] [2022-12-13 13:33:02,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251229049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:02,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:02,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:02,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091350143] [2022-12-13 13:33:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:02,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:02,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:02,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:02,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 13:33:02,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 274 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-13 13:33:02,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:02,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 13:33:02,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:02,578 INFO L130 PetriNetUnfolder]: 103/210 cut-off events. [2022-12-13 13:33:02,578 INFO L131 PetriNetUnfolder]: For 572/630 co-relation queries the response was YES. [2022-12-13 13:33:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 210 events. 103/210 cut-off events. For 572/630 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 766 event pairs, 31 based on Foata normal form. 11/184 useless extension candidates. Maximal degree in co-relation 798. Up to 170 conditions per place. [2022-12-13 13:33:02,579 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 34 selfloop transitions, 7 changer transitions 4/46 dead transitions. [2022-12-13 13:33:02,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 388 flow [2022-12-13 13:33:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 13:33:02,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2022-12-13 13:33:02,581 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 274 flow. Second operand 5 states and 44 transitions. [2022-12-13 13:33:02,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 388 flow [2022-12-13 13:33:02,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 364 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 13:33:02,585 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 232 flow [2022-12-13 13:33:02,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-13 13:33:02,586 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 13:33:02,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:02,587 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 232 flow [2022-12-13 13:33:02,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:02,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:02,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 232 flow [2022-12-13 13:33:02,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 232 flow [2022-12-13 13:33:02,598 INFO L130 PetriNetUnfolder]: 35/98 cut-off events. [2022-12-13 13:33:02,598 INFO L131 PetriNetUnfolder]: For 131/143 co-relation queries the response was YES. [2022-12-13 13:33:02,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 98 events. 35/98 cut-off events. For 131/143 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 312 event pairs, 0 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 260. Up to 31 conditions per place. [2022-12-13 13:33:02,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 32 transitions, 232 flow [2022-12-13 13:33:02,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 13:33:02,601 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:02,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 13:33:02,601 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 232 flow [2022-12-13 13:33:02,602 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-13 13:33:02,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:02,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:02,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:33:02,602 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-13 13:33:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1474138047, now seen corresponding path program 1 times [2022-12-13 13:33:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:02,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121918374] [2022-12-13 13:33:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:02,937 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-13 13:33:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:02,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121918374] [2022-12-13 13:33:02,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121918374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:02,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:02,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526738632] [2022-12-13 13:33:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:02,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 13:33:02,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 232 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-13 13:33:02,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:02,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 13:33:02,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:03,058 INFO L130 PetriNetUnfolder]: 127/251 cut-off events. [2022-12-13 13:33:03,059 INFO L131 PetriNetUnfolder]: For 626/662 co-relation queries the response was YES. [2022-12-13 13:33:03,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 251 events. 127/251 cut-off events. For 626/662 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 950 event pairs, 14 based on Foata normal form. 15/217 useless extension candidates. Maximal degree in co-relation 876. Up to 178 conditions per place. [2022-12-13 13:33:03,060 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 38 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2022-12-13 13:33:03,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 442 flow [2022-12-13 13:33:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-13 13:33:03,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2022-12-13 13:33:03,063 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 232 flow. Second operand 5 states and 49 transitions. [2022-12-13 13:33:03,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 442 flow [2022-12-13 13:33:03,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 416 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:03,065 INFO L231 Difference]: Finished difference. Result has 37 places, 39 transitions, 331 flow [2022-12-13 13:33:03,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=37, PETRI_TRANSITIONS=39} [2022-12-13 13:33:03,065 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 13:33:03,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:03,066 INFO L89 Accepts]: Start accepts. Operand has 37 places, 39 transitions, 331 flow [2022-12-13 13:33:03,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:03,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:03,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 39 transitions, 331 flow [2022-12-13 13:33:03,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 39 transitions, 331 flow [2022-12-13 13:33:03,078 INFO L130 PetriNetUnfolder]: 37/118 cut-off events. [2022-12-13 13:33:03,078 INFO L131 PetriNetUnfolder]: For 233/261 co-relation queries the response was YES. [2022-12-13 13:33:03,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 118 events. 37/118 cut-off events. For 233/261 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 452 event pairs, 0 based on Foata normal form. 9/103 useless extension candidates. Maximal degree in co-relation 281. Up to 35 conditions per place. [2022-12-13 13:33:03,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 39 transitions, 331 flow [2022-12-13 13:33:03,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 13:33:03,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:03,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 13:33:03,080 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 331 flow [2022-12-13 13:33:03,080 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-13 13:33:03,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:03,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:03,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:33:03,080 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-13 13:33:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 310522777, now seen corresponding path program 2 times [2022-12-13 13:33:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:03,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716759846] [2022-12-13 13:33:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:03,421 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-13 13:33:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716759846] [2022-12-13 13:33:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716759846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:03,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:03,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763882709] [2022-12-13 13:33:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:03,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:03,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:03,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:03,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 13:33:03,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 331 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-13 13:33:03,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:03,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 13:33:03,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:03,516 INFO L130 PetriNetUnfolder]: 118/236 cut-off events. [2022-12-13 13:33:03,516 INFO L131 PetriNetUnfolder]: For 760/760 co-relation queries the response was YES. [2022-12-13 13:33:03,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 236 events. 118/236 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 843 event pairs, 18 based on Foata normal form. 4/199 useless extension candidates. Maximal degree in co-relation 641. Up to 176 conditions per place. [2022-12-13 13:33:03,518 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 36 selfloop transitions, 9 changer transitions 2/48 dead transitions. [2022-12-13 13:33:03,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 440 flow [2022-12-13 13:33:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 13:33:03,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2022-12-13 13:33:03,520 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 331 flow. Second operand 5 states and 42 transitions. [2022-12-13 13:33:03,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 440 flow [2022-12-13 13:33:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 416 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 13:33:03,522 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 293 flow [2022-12-13 13:33:03,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2022-12-13 13:33:03,524 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-13 13:33:03,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:03,524 INFO L89 Accepts]: Start accepts. Operand has 39 places, 36 transitions, 293 flow [2022-12-13 13:33:03,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:03,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:03,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 36 transitions, 293 flow [2022-12-13 13:33:03,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 293 flow [2022-12-13 13:33:03,535 INFO L130 PetriNetUnfolder]: 34/107 cut-off events. [2022-12-13 13:33:03,535 INFO L131 PetriNetUnfolder]: For 224/246 co-relation queries the response was YES. [2022-12-13 13:33:03,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 107 events. 34/107 cut-off events. For 224/246 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 370 event pairs, 0 based on Foata normal form. 9/95 useless extension candidates. Maximal degree in co-relation 249. Up to 31 conditions per place. [2022-12-13 13:33:03,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 36 transitions, 293 flow [2022-12-13 13:33:03,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 13:33:03,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [557] $Ultimate##0-->L93-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_43| |v_#pthreadsForks_38|) (= (ite (= (select (select |v_#memory_int_177| v_~q~0.base_130) (+ (* v_~q_back~0_220 4) v_~q~0.offset_130)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (not (= (ite (and (<= 0 v_~q_back~0_220) (< v_~q_back~0_220 v_~n~0_145)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_61| 1) (= v_~q_back~0_219 (+ v_~q_back~0_220 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| 0)) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_41| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) |v_ULTIMATE.start_main_~#t2~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre14#1_43|)) |v_#memory_int_176|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_61| (+ 1 v_~N~0_91))) InVars {#pthreadsForks=|v_#pthreadsForks_38|, ~q_back~0=v_~q_back~0_220, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, #memory_int=|v_#memory_int_177|, ~N~0=v_~N~0_91, ~q~0.base=v_~q~0.base_130, ~n~0=v_~n~0_145, ~q~0.offset=v_~q~0.offset_130, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} OutVars{~q_back~0=v_~q_back~0_219, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_29|, ~N~0=v_~N~0_91, ~q~0.base=v_~q~0.base_130, ~q~0.offset=v_~q~0.offset_130, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, #pthreadsForks=|v_#pthreadsForks_37|, 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_61|, #memory_int=|v_#memory_int_176|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57|, ~n~0=v_~n~0_145, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:03,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [557] $Ultimate##0-->L93-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_43| |v_#pthreadsForks_38|) (= (ite (= (select (select |v_#memory_int_177| v_~q~0.base_130) (+ (* v_~q_back~0_220 4) v_~q~0.offset_130)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (not (= (ite (and (<= 0 v_~q_back~0_220) (< v_~q_back~0_220 v_~n~0_145)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_61| 1) (= v_~q_back~0_219 (+ v_~q_back~0_220 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| 0)) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_41| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) |v_ULTIMATE.start_main_~#t2~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre14#1_43|)) |v_#memory_int_176|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_61| (+ 1 v_~N~0_91))) InVars {#pthreadsForks=|v_#pthreadsForks_38|, ~q_back~0=v_~q_back~0_220, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, #memory_int=|v_#memory_int_177|, ~N~0=v_~N~0_91, ~q~0.base=v_~q~0.base_130, ~n~0=v_~n~0_145, ~q~0.offset=v_~q~0.offset_130, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} OutVars{~q_back~0=v_~q_back~0_219, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_29|, ~N~0=v_~N~0_91, ~q~0.base=v_~q~0.base_130, ~q~0.offset=v_~q~0.offset_130, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_43|, #pthreadsForks=|v_#pthreadsForks_37|, 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_61|, #memory_int=|v_#memory_int_176|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57|, ~n~0=v_~n~0_145, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} 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-13 13:33:03,714 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:03,714 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:03,715 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:03,715 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:03,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:03,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-13 13:33:03,882 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 317 flow [2022-12-13 13:33:03,882 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-13 13:33:03,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:03,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:03,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:33:03,883 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-13 13:33:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1675329585, now seen corresponding path program 1 times [2022-12-13 13:33:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:03,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887284619] [2022-12-13 13:33:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:04,222 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-13 13:33:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:04,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887284619] [2022-12-13 13:33:04,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887284619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:04,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:04,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291331166] [2022-12-13 13:33:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:04,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:04,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:04,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 13:33:04,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 317 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-13 13:33:04,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:04,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 13:33:04,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:04,305 INFO L130 PetriNetUnfolder]: 123/247 cut-off events. [2022-12-13 13:33:04,305 INFO L131 PetriNetUnfolder]: For 1018/1018 co-relation queries the response was YES. [2022-12-13 13:33:04,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 247 events. 123/247 cut-off events. For 1018/1018 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 903 event pairs, 32 based on Foata normal form. 6/211 useless extension candidates. Maximal degree in co-relation 630. Up to 183 conditions per place. [2022-12-13 13:33:04,307 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 36 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-13 13:33:04,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 459 flow [2022-12-13 13:33:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 13:33:04,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 13:33:04,309 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 317 flow. Second operand 4 states and 40 transitions. [2022-12-13 13:33:04,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 459 flow [2022-12-13 13:33:04,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 418 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 13:33:04,313 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 321 flow [2022-12-13 13:33:04,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2022-12-13 13:33:04,314 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 13:33:04,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:04,314 INFO L89 Accepts]: Start accepts. Operand has 38 places, 37 transitions, 321 flow [2022-12-13 13:33:04,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:04,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:04,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 37 transitions, 321 flow [2022-12-13 13:33:04,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 321 flow [2022-12-13 13:33:04,326 INFO L130 PetriNetUnfolder]: 34/123 cut-off events. [2022-12-13 13:33:04,326 INFO L131 PetriNetUnfolder]: For 304/320 co-relation queries the response was YES. [2022-12-13 13:33:04,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 123 events. 34/123 cut-off events. For 304/320 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 503 event pairs, 2 based on Foata normal form. 6/108 useless extension candidates. Maximal degree in co-relation 259. Up to 31 conditions per place. [2022-12-13 13:33:04,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 37 transitions, 321 flow [2022-12-13 13:33:04,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 13:33:04,328 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:04,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 13:33:04,330 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 321 flow [2022-12-13 13:33:04,330 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-13 13:33:04,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:04,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:33:04,331 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-13 13:33:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -477633099, now seen corresponding path program 1 times [2022-12-13 13:33:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:04,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239862819] [2022-12-13 13:33:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:04,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:04,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-13 13:33:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239862819] [2022-12-13 13:33:04,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239862819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66778629] [2022-12-13 13:33:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:04,655 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-13 13:33:04,675 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-13 13:33:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:04,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:33:04,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:04,831 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-13 13:33:04,879 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-13 13:33:04,909 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-13 13:33:04,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:04,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:04,971 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-13 13:33:04,979 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-13 13:33:04,988 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-13 13:33:05,043 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-13 13:33:05,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66778629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:05,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:05,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-13 13:33:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41052004] [2022-12-13 13:33:05,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:05,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:33:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:33:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:33:05,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 13:33:05,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 321 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-13 13:33:05,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:05,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 13:33:05,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:05,244 INFO L130 PetriNetUnfolder]: 180/355 cut-off events. [2022-12-13 13:33:05,244 INFO L131 PetriNetUnfolder]: For 1376/1394 co-relation queries the response was YES. [2022-12-13 13:33:05,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 355 events. 180/355 cut-off events. For 1376/1394 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1482 event pairs, 24 based on Foata normal form. 1/295 useless extension candidates. Maximal degree in co-relation 1094. Up to 246 conditions per place. [2022-12-13 13:33:05,246 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 48 selfloop transitions, 23 changer transitions 2/74 dead transitions. [2022-12-13 13:33:05,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 704 flow [2022-12-13 13:33:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:33:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:33:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-13 13:33:05,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-13 13:33:05,247 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 321 flow. Second operand 7 states and 62 transitions. [2022-12-13 13:33:05,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 704 flow [2022-12-13 13:33:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 74 transitions, 665 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 13:33:05,250 INFO L231 Difference]: Finished difference. Result has 44 places, 50 transitions, 502 flow [2022-12-13 13:33:05,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=44, PETRI_TRANSITIONS=50} [2022-12-13 13:33:05,251 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 13:33:05,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:05,251 INFO L89 Accepts]: Start accepts. Operand has 44 places, 50 transitions, 502 flow [2022-12-13 13:33:05,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:05,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:05,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 50 transitions, 502 flow [2022-12-13 13:33:05,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 50 transitions, 502 flow [2022-12-13 13:33:05,273 INFO L130 PetriNetUnfolder]: 45/158 cut-off events. [2022-12-13 13:33:05,273 INFO L131 PetriNetUnfolder]: For 545/601 co-relation queries the response was YES. [2022-12-13 13:33:05,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 158 events. 45/158 cut-off events. For 545/601 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 740 event pairs, 4 based on Foata normal form. 10/139 useless extension candidates. Maximal degree in co-relation 501. Up to 51 conditions per place. [2022-12-13 13:33:05,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 50 transitions, 502 flow [2022-12-13 13:33:05,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-13 13:33:05,285 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:05,285 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:05,370 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:05,370 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:05,453 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:05,453 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:05,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:05,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-13 13:33:05,550 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 49 transitions, 506 flow [2022-12-13 13:33:05,550 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-13 13:33:05,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:05,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:05,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 13:33:05,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 13:33:05,752 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-13 13:33:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash 449568032, now seen corresponding path program 1 times [2022-12-13 13:33:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:05,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41830230] [2022-12-13 13:33:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:05,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:05,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-13 13:33:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:05,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41830230] [2022-12-13 13:33:05,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41830230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:05,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897382834] [2022-12-13 13:33:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:05,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:05,838 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-13 13:33:05,840 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-13 13:33:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:05,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:33:05,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:05,944 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-13 13:33:05,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:33:05,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897382834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:05,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:33:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:33:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638993283] [2022-12-13 13:33:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:33:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:33:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:05,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 13:33:05,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 506 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-13 13:33:05,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:05,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 13:33:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:06,042 INFO L130 PetriNetUnfolder]: 203/409 cut-off events. [2022-12-13 13:33:06,042 INFO L131 PetriNetUnfolder]: For 2204/2228 co-relation queries the response was YES. [2022-12-13 13:33:06,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 409 events. 203/409 cut-off events. For 2204/2228 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1788 event pairs, 77 based on Foata normal form. 8/346 useless extension candidates. Maximal degree in co-relation 1712. Up to 223 conditions per place. [2022-12-13 13:33:06,045 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 60 selfloop transitions, 1 changer transitions 8/70 dead transitions. [2022-12-13 13:33:06,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 771 flow [2022-12-13 13:33:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 13:33:06,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2022-12-13 13:33:06,046 INFO L175 Difference]: Start difference. First operand has 43 places, 49 transitions, 506 flow. Second operand 4 states and 47 transitions. [2022-12-13 13:33:06,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 771 flow [2022-12-13 13:33:06,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 716 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 13:33:06,050 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 390 flow [2022-12-13 13:33:06,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2022-12-13 13:33:06,051 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-13 13:33:06,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:06,051 INFO L89 Accepts]: Start accepts. Operand has 45 places, 44 transitions, 390 flow [2022-12-13 13:33:06,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:06,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:06,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 390 flow [2022-12-13 13:33:06,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 44 transitions, 390 flow [2022-12-13 13:33:06,064 INFO L130 PetriNetUnfolder]: 50/160 cut-off events. [2022-12-13 13:33:06,065 INFO L131 PetriNetUnfolder]: For 358/367 co-relation queries the response was YES. [2022-12-13 13:33:06,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 160 events. 50/160 cut-off events. For 358/367 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 691 event pairs, 2 based on Foata normal form. 8/139 useless extension candidates. Maximal degree in co-relation 458. Up to 46 conditions per place. [2022-12-13 13:33:06,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 44 transitions, 390 flow [2022-12-13 13:33:06,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 13:33:06,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_182| v_~q~0.base_134))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_229 4) (- 4) v_~q~0.offset_134)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_231 4) v_~q~0.offset_134)) 1) 1 0) 0)) (not (= (ite (and (<= 1 v_~q_back~0_229) (< v_~q_back~0_229 (+ v_~n~0_149 1))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ 1 v_~N~0_95)) (not (= (ite (and (< v_~q_back~0_231 v_~n~0_149) (<= 0 v_~q_back~0_231)) 1 0) 0)) (= v_~q_back~0_229 (+ 2 v_~q_back~0_231)))) InVars {~q_back~0=v_~q_back~0_231, #memory_int=|v_#memory_int_182|, ~N~0=v_~N~0_95, ~q~0.base=v_~q~0.base_134, ~n~0=v_~n~0_149, ~q~0.offset=v_~q~0.offset_134} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_37|, ~q_back~0=v_~q_back~0_229, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_33|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_33|, ~N~0=v_~N~0_95, ~q~0.base=v_~q~0.base_134, ~n~0=v_~n~0_149, ~q~0.offset=v_~q~0.offset_134} 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-13 13:33:06,258 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:06,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-13 13:33:06,258 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 398 flow [2022-12-13 13:33:06,258 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-13 13:33:06,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:06,259 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:06,266 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-13 13:33:06,459 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-13 13:33:06,460 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-13 13:33:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash 241524873, now seen corresponding path program 1 times [2022-12-13 13:33:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:06,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880909588] [2022-12-13 13:33:06,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:06,837 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-13 13:33:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:06,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880909588] [2022-12-13 13:33:06,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880909588] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:06,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134546074] [2022-12-13 13:33:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:06,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:06,839 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-13 13:33:06,842 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-13 13:33:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:06,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 13:33:06,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:06,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:06,955 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-13 13:33:07,014 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-13 13:33:07,065 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-13 13:33:07,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:07,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:07,168 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-13 13:33:07,172 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-13 13:33:07,175 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-13 13:33:07,228 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-13 13:33:07,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134546074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:07,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:07,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 13:33:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724377967] [2022-12-13 13:33:07,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:07,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:33:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:33:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:33:07,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 13:33:07,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 398 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-13 13:33:07,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:07,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 13:33:07,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:07,999 INFO L130 PetriNetUnfolder]: 258/540 cut-off events. [2022-12-13 13:33:07,999 INFO L131 PetriNetUnfolder]: For 2193/2209 co-relation queries the response was YES. [2022-12-13 13:33:08,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 540 events. 258/540 cut-off events. For 2193/2209 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2689 event pairs, 48 based on Foata normal form. 12/488 useless extension candidates. Maximal degree in co-relation 1795. Up to 316 conditions per place. [2022-12-13 13:33:08,003 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 64 selfloop transitions, 37 changer transitions 25/127 dead transitions. [2022-12-13 13:33:08,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 1131 flow [2022-12-13 13:33:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:33:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:33:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-12-13 13:33:08,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3069053708439898 [2022-12-13 13:33:08,004 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 398 flow. Second operand 17 states and 120 transitions. [2022-12-13 13:33:08,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 1131 flow [2022-12-13 13:33:08,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 1102 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 13:33:08,011 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 757 flow [2022-12-13 13:33:08,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=757, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2022-12-13 13:33:08,011 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-13 13:33:08,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:08,011 INFO L89 Accepts]: Start accepts. Operand has 67 places, 64 transitions, 757 flow [2022-12-13 13:33:08,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:08,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:08,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 64 transitions, 757 flow [2022-12-13 13:33:08,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 757 flow [2022-12-13 13:33:08,032 INFO L130 PetriNetUnfolder]: 55/202 cut-off events. [2022-12-13 13:33:08,032 INFO L131 PetriNetUnfolder]: For 1101/1128 co-relation queries the response was YES. [2022-12-13 13:33:08,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 202 events. 55/202 cut-off events. For 1101/1128 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1029 event pairs, 4 based on Foata normal form. 10/190 useless extension candidates. Maximal degree in co-relation 871. Up to 57 conditions per place. [2022-12-13 13:33:08,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 757 flow [2022-12-13 13:33:08,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 13:33:08,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:33:08,205 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-13 13:33:08,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_174| v_~q~0.base_128))) (and (= (select .cse0 (+ v_~q~0.offset_128 (* 4 v_~q_front~0_159))) |v_thread2Thread1of1ForFork1_~j~0#1_51|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_55| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|) (= (+ 1 v_~q_front~0_159) v_~q_front~0_158) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_51| v_~s~0_102) v_~s~0_101) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_216 4) v_~q~0.offset_128)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|) (= (ite (and (< v_~q_front~0_159 v_~n~0_143) (<= 0 v_~q_front~0_159) (< v_~q_front~0_159 v_~q_back~0_215)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_51| 0)) (not (= (ite (and (< v_~q_back~0_216 v_~n~0_143) (<= 0 v_~q_back~0_216)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_59| (+ 1 v_~N~0_89)) (= |v_thread1Thread1of1ForFork0_~i~0#1_59| 1) (= (+ v_~q_back~0_216 1) v_~q_back~0_215) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_55| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)))) InVars {~q_back~0=v_~q_back~0_216, #memory_int=|v_#memory_int_174|, ~N~0=v_~N~0_89, ~q~0.base=v_~q~0.base_128, ~n~0=v_~n~0_143, ~q~0.offset=v_~q~0.offset_128, ~s~0=v_~s~0_102, ~q_front~0=v_~q_front~0_159} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_51|, ~q_back~0=v_~q_back~0_215, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_43|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_27|, ~N~0=v_~N~0_89, ~q~0.base=v_~q~0.base_128, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_43|, ~q~0.offset=v_~q~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_31|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_27|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_59|, #memory_int=|v_#memory_int_174|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_55|, ~n~0=v_~n~0_143, ~s~0=v_~s~0_101, ~q_front~0=v_~q_front~0_158} 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-13 13:33:08,304 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:08,304 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:08,304 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:08,304 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:08,304 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:08,304 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:08,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:08,678 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:33:08,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 667 [2022-12-13 13:33:08,678 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 761 flow [2022-12-13 13:33:08,679 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-13 13:33:08,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:08,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:08,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:33:08,883 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-13 13:33:08,883 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-13 13:33:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 168589163, now seen corresponding path program 1 times [2022-12-13 13:33:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223007008] [2022-12-13 13:33:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:08,940 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-13 13:33:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:08,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223007008] [2022-12-13 13:33:08,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223007008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:08,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:08,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:33:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686605844] [2022-12-13 13:33:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:08,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:33:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:33:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:33:08,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 13:33:08,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 761 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-13 13:33:08,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:08,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 13:33:08,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:09,015 INFO L130 PetriNetUnfolder]: 94/215 cut-off events. [2022-12-13 13:33:09,015 INFO L131 PetriNetUnfolder]: For 2207/2207 co-relation queries the response was YES. [2022-12-13 13:33:09,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 215 events. 94/215 cut-off events. For 2207/2207 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 785 event pairs, 41 based on Foata normal form. 40/235 useless extension candidates. Maximal degree in co-relation 1168. Up to 158 conditions per place. [2022-12-13 13:33:09,017 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 24 selfloop transitions, 0 changer transitions 22/47 dead transitions. [2022-12-13 13:33:09,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 47 transitions, 579 flow [2022-12-13 13:33:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 13:33:09,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 13:33:09,018 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 761 flow. Second operand 4 states and 40 transitions. [2022-12-13 13:33:09,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 47 transitions, 579 flow [2022-12-13 13:33:09,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 487 flow, removed 33 selfloop flow, removed 13 redundant places. [2022-12-13 13:33:09,022 INFO L231 Difference]: Finished difference. Result has 50 places, 25 transitions, 189 flow [2022-12-13 13:33:09,022 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=25} [2022-12-13 13:33:09,022 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 13:33:09,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:09,023 INFO L89 Accepts]: Start accepts. Operand has 50 places, 25 transitions, 189 flow [2022-12-13 13:33:09,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:09,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:09,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 25 transitions, 189 flow [2022-12-13 13:33:09,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 189 flow [2022-12-13 13:33:09,029 INFO L130 PetriNetUnfolder]: 20/73 cut-off events. [2022-12-13 13:33:09,030 INFO L131 PetriNetUnfolder]: For 190/192 co-relation queries the response was YES. [2022-12-13 13:33:09,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 73 events. 20/73 cut-off events. For 190/192 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 225 event pairs, 2 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 259. Up to 25 conditions per place. [2022-12-13 13:33:09,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 189 flow [2022-12-13 13:33:09,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 13:33:09,031 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:09,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 13:33:09,031 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 189 flow [2022-12-13 13:33:09,031 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-13 13:33:09,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:09,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:09,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:33:09,032 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-13 13:33:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1139822892, now seen corresponding path program 1 times [2022-12-13 13:33:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589977702] [2022-12-13 13:33:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:09,472 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-13 13:33:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589977702] [2022-12-13 13:33:09,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589977702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:09,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:09,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:33:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460357929] [2022-12-13 13:33:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:33:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:09,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:33:09,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:33:09,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 13:33:09,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 189 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-13 13:33:09,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:09,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 13:33:09,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:09,638 INFO L130 PetriNetUnfolder]: 111/234 cut-off events. [2022-12-13 13:33:09,638 INFO L131 PetriNetUnfolder]: For 992/998 co-relation queries the response was YES. [2022-12-13 13:33:09,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 234 events. 111/234 cut-off events. For 992/998 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 883 event pairs, 20 based on Foata normal form. 12/212 useless extension candidates. Maximal degree in co-relation 972. Up to 164 conditions per place. [2022-12-13 13:33:09,640 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 42 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-12-13 13:33:09,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 477 flow [2022-12-13 13:33:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-13 13:33:09,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-13 13:33:09,641 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 189 flow. Second operand 6 states and 47 transitions. [2022-12-13 13:33:09,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 477 flow [2022-12-13 13:33:09,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 53 transitions, 372 flow, removed 48 selfloop flow, removed 10 redundant places. [2022-12-13 13:33:09,644 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 252 flow [2022-12-13 13:33:09,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-13 13:33:09,645 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-13 13:33:09,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:09,645 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 252 flow [2022-12-13 13:33:09,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:09,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:09,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 252 flow [2022-12-13 13:33:09,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 252 flow [2022-12-13 13:33:09,654 INFO L130 PetriNetUnfolder]: 29/115 cut-off events. [2022-12-13 13:33:09,655 INFO L131 PetriNetUnfolder]: For 132/141 co-relation queries the response was YES. [2022-12-13 13:33:09,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 115 events. 29/115 cut-off events. For 132/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 456 event pairs, 4 based on Foata normal form. 9/106 useless extension candidates. Maximal degree in co-relation 247. Up to 35 conditions per place. [2022-12-13 13:33:09,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 252 flow [2022-12-13 13:33:09,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 13:33:09,661 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-13 13:33:09,910 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:09,910 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:09,911 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:09,911 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:11,102 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:33:11,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1457 [2022-12-13 13:33:11,103 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 269 flow [2022-12-13 13:33:11,103 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-13 13:33:11,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:11,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:11,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:33:11,103 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-13 13:33:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1322331232, now seen corresponding path program 2 times [2022-12-13 13:33:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:11,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614209997] [2022-12-13 13:33:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:11,382 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-13 13:33:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:11,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614209997] [2022-12-13 13:33:11,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614209997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:11,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:11,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:33:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960276985] [2022-12-13 13:33:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:11,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:33:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:33:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:33:11,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 13:33:11,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 269 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-13 13:33:11,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:11,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 13:33:11,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:11,556 INFO L130 PetriNetUnfolder]: 142/299 cut-off events. [2022-12-13 13:33:11,557 INFO L131 PetriNetUnfolder]: For 816/916 co-relation queries the response was YES. [2022-12-13 13:33:11,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 299 events. 142/299 cut-off events. For 816/916 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1215 event pairs, 30 based on Foata normal form. 15/262 useless extension candidates. Maximal degree in co-relation 804. Up to 222 conditions per place. [2022-12-13 13:33:11,558 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 44 selfloop transitions, 14 changer transitions 1/60 dead transitions. [2022-12-13 13:33:11,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 524 flow [2022-12-13 13:33:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 13:33:11,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-13 13:33:11,559 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 269 flow. Second operand 6 states and 51 transitions. [2022-12-13 13:33:11,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 524 flow [2022-12-13 13:33:11,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 492 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 13:33:11,563 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 373 flow [2022-12-13 13:33:11,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-13 13:33:11,564 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-13 13:33:11,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:11,564 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 373 flow [2022-12-13 13:33:11,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:11,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:11,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 373 flow [2022-12-13 13:33:11,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 373 flow [2022-12-13 13:33:11,576 INFO L130 PetriNetUnfolder]: 36/141 cut-off events. [2022-12-13 13:33:11,576 INFO L131 PetriNetUnfolder]: For 327/352 co-relation queries the response was YES. [2022-12-13 13:33:11,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 141 events. 36/141 cut-off events. For 327/352 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 622 event pairs, 2 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 329. Up to 38 conditions per place. [2022-12-13 13:33:11,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 373 flow [2022-12-13 13:33:11,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-13 13:33:11,578 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:11,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 13:33:11,578 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 373 flow [2022-12-13 13:33:11,578 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-13 13:33:11,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:11,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:11,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:33:11,579 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-13 13:33:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash 892245546, now seen corresponding path program 1 times [2022-12-13 13:33:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:11,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079560204] [2022-12-13 13:33:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:12,098 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-13 13:33:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079560204] [2022-12-13 13:33:12,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079560204] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968606751] [2022-12-13 13:33:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:12,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:12,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:12,100 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-13 13:33:12,101 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-13 13:33:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:12,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:33:12,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:12,271 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-13 13:33:12,291 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-13 13:33:12,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:12,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:12,329 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-13 13:33:12,356 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-13 13:33:12,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968606751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:12,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:12,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-12-13 13:33:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374742660] [2022-12-13 13:33:12,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:12,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:33:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:12,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:33:12,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:33:12,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 13:33:12,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 373 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-13 13:33:12,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:12,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 13:33:12,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:12,667 INFO L130 PetriNetUnfolder]: 149/316 cut-off events. [2022-12-13 13:33:12,667 INFO L131 PetriNetUnfolder]: For 1115/1182 co-relation queries the response was YES. [2022-12-13 13:33:12,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 316 events. 149/316 cut-off events. For 1115/1182 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1361 event pairs, 19 based on Foata normal form. 28/299 useless extension candidates. Maximal degree in co-relation 965. Up to 276 conditions per place. [2022-12-13 13:33:12,669 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 46 selfloop transitions, 11 changer transitions 2/60 dead transitions. [2022-12-13 13:33:12,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 578 flow [2022-12-13 13:33:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:33:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:33:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-12-13 13:33:12,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 13:33:12,670 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 373 flow. Second operand 7 states and 49 transitions. [2022-12-13 13:33:12,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 578 flow [2022-12-13 13:33:12,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 543 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 13:33:12,677 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 403 flow [2022-12-13 13:33:12,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-13 13:33:12,678 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 13:33:12,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:12,678 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 403 flow [2022-12-13 13:33:12,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:12,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:12,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 403 flow [2022-12-13 13:33:12,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 403 flow [2022-12-13 13:33:12,690 INFO L130 PetriNetUnfolder]: 37/149 cut-off events. [2022-12-13 13:33:12,690 INFO L131 PetriNetUnfolder]: For 374/407 co-relation queries the response was YES. [2022-12-13 13:33:12,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 149 events. 37/149 cut-off events. For 374/407 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 695 event pairs, 2 based on Foata normal form. 8/135 useless extension candidates. Maximal degree in co-relation 475. Up to 37 conditions per place. [2022-12-13 13:33:12,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 403 flow [2022-12-13 13:33:12,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 13:33:12,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_232| v_~q~0.base_168)) (.cse1 (* v_~q_back~0_296 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (< |v_thread1Thread1of1ForFork0_~i~0#1_100| (+ v_~N~0_120 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_100| 1) (= (ite (= (select .cse0 (+ v_~q~0.offset_168 4 .cse1)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (= v_~q_back~0_294 (+ 2 v_~q_back~0_296)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_168 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_23| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_100| v_~N~0_120)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_296 1))) (and (< .cse2 v_~n~0_181) (<= 0 .cse2))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_296) (< v_~q_back~0_296 v_~n~0_181)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_23| 0))) InVars {~q_back~0=v_~q_back~0_296, #memory_int=|v_#memory_int_232|, ~N~0=v_~N~0_120, ~q~0.base=v_~q~0.base_168, ~n~0=v_~n~0_181, ~q~0.offset=v_~q~0.offset_168} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_23|, ~q_back~0=v_~q_back~0_294, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_62|, ~N~0=v_~N~0_120, ~q~0.base=v_~q~0.base_168, ~q~0.offset=v_~q~0.offset_168, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, 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_100|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, #memory_int=|v_#memory_int_232|, ~n~0=v_~n~0_181, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_23|} 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-13 13:33:14,047 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:14,047 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:14,156 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:33:14,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1479 [2022-12-13 13:33:14,157 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 399 flow [2022-12-13 13:33:14,157 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-13 13:33:14,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:14,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:14,175 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-13 13:33:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:33:14,362 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-13 13:33:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1943472383, now seen corresponding path program 1 times [2022-12-13 13:33:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:14,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886513176] [2022-12-13 13:33:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:14,651 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-13 13:33:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:14,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886513176] [2022-12-13 13:33:14,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886513176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:14,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:14,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:33:14,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685487667] [2022-12-13 13:33:14,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:14,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:33:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:33:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:33:14,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 13:33:14,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 399 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-13 13:33:14,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:14,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 13:33:14,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:14,773 INFO L130 PetriNetUnfolder]: 135/282 cut-off events. [2022-12-13 13:33:14,773 INFO L131 PetriNetUnfolder]: For 1226/1228 co-relation queries the response was YES. [2022-12-13 13:33:14,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 282 events. 135/282 cut-off events. For 1226/1228 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1092 event pairs, 24 based on Foata normal form. 4/248 useless extension candidates. Maximal degree in co-relation 1238. Up to 214 conditions per place. [2022-12-13 13:33:14,775 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 40 selfloop transitions, 8 changer transitions 3/52 dead transitions. [2022-12-13 13:33:14,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 529 flow [2022-12-13 13:33:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 13:33:14,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2022-12-13 13:33:14,776 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 399 flow. Second operand 5 states and 44 transitions. [2022-12-13 13:33:14,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 529 flow [2022-12-13 13:33:14,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 493 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:14,779 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 353 flow [2022-12-13 13:33:14,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 13:33:14,779 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-13 13:33:14,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:14,780 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 353 flow [2022-12-13 13:33:14,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:14,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:14,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 353 flow [2022-12-13 13:33:14,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 353 flow [2022-12-13 13:33:14,792 INFO L130 PetriNetUnfolder]: 35/124 cut-off events. [2022-12-13 13:33:14,793 INFO L131 PetriNetUnfolder]: For 352/373 co-relation queries the response was YES. [2022-12-13 13:33:14,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 124 events. 35/124 cut-off events. For 352/373 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 481 event pairs, 2 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 363. Up to 32 conditions per place. [2022-12-13 13:33:14,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 353 flow [2022-12-13 13:33:14,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 13:33:14,794 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:14,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 13:33:14,795 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 353 flow [2022-12-13 13:33:14,795 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-13 13:33:14,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:14,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:14,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:33:14,795 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-13 13:33:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2144827590, now seen corresponding path program 1 times [2022-12-13 13:33:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:14,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068543233] [2022-12-13 13:33:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33: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-13 13:33:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068543233] [2022-12-13 13:33:15,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068543233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130461025] [2022-12-13 13:33:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:15,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:15,030 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-13 13:33:15,032 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-13 13:33:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:15,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 13:33:15,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:15,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:15,127 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-13 13:33:15,168 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-13 13:33:15,182 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-13 13:33:15,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:15,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:15,244 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-13 13:33:15,248 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-13 13:33:15,251 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-13 13:33:15,282 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-13 13:33:15,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130461025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:15,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:15,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-13 13:33:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30775250] [2022-12-13 13:33:15,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:15,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:33:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:33:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:33:15,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 13:33:15,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 353 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-13 13:33:15,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:15,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 13:33:15,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:15,440 INFO L130 PetriNetUnfolder]: 141/289 cut-off events. [2022-12-13 13:33:15,440 INFO L131 PetriNetUnfolder]: For 1202/1213 co-relation queries the response was YES. [2022-12-13 13:33:15,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 289 events. 141/289 cut-off events. For 1202/1213 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1126 event pairs, 25 based on Foata normal form. 11/263 useless extension candidates. Maximal degree in co-relation 1063. Up to 248 conditions per place. [2022-12-13 13:33:15,442 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 41 selfloop transitions, 10 changer transitions 2/54 dead transitions. [2022-12-13 13:33:15,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 530 flow [2022-12-13 13:33:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 13:33:15,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3739130434782609 [2022-12-13 13:33:15,443 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 353 flow. Second operand 5 states and 43 transitions. [2022-12-13 13:33:15,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 530 flow [2022-12-13 13:33:15,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 486 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:15,445 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 366 flow [2022-12-13 13:33:15,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-13 13:33:15,446 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 13:33:15,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:15,446 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 366 flow [2022-12-13 13:33:15,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:15,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:15,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 366 flow [2022-12-13 13:33:15,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 366 flow [2022-12-13 13:33:15,457 INFO L130 PetriNetUnfolder]: 34/128 cut-off events. [2022-12-13 13:33:15,457 INFO L131 PetriNetUnfolder]: For 318/338 co-relation queries the response was YES. [2022-12-13 13:33:15,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 128 events. 34/128 cut-off events. For 318/338 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 528 event pairs, 2 based on Foata normal form. 7/115 useless extension candidates. Maximal degree in co-relation 394. Up to 34 conditions per place. [2022-12-13 13:33:15,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 366 flow [2022-12-13 13:33:15,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 13:33:15,463 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:15,463 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:15,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:15,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 13:33:15,541 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 356 flow [2022-12-13 13:33:15,541 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-13 13:33:15,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:15,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:15,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:15,743 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,SelfDestructingSolverStorable17 [2022-12-13 13:33:15,743 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-13 13:33:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 780532841, now seen corresponding path program 1 times [2022-12-13 13:33:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:15,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042688154] [2022-12-13 13:33:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:15,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:15,805 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-13 13:33:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:15,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042688154] [2022-12-13 13:33:15,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042688154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:15,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:15,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191770342] [2022-12-13 13:33:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:15,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:15,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 13:33:15,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 356 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-13 13:33:15,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:15,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 13:33:15,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:15,872 INFO L130 PetriNetUnfolder]: 168/338 cut-off events. [2022-12-13 13:33:15,872 INFO L131 PetriNetUnfolder]: For 1426/1456 co-relation queries the response was YES. [2022-12-13 13:33:15,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 338 events. 168/338 cut-off events. For 1426/1456 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1393 event pairs, 23 based on Foata normal form. 12/296 useless extension candidates. Maximal degree in co-relation 1427. Up to 235 conditions per place. [2022-12-13 13:33:15,874 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 45 selfloop transitions, 12 changer transitions 7/65 dead transitions. [2022-12-13 13:33:15,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 649 flow [2022-12-13 13:33:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 13:33:15,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-12-13 13:33:15,875 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 356 flow. Second operand 4 states and 47 transitions. [2022-12-13 13:33:15,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 649 flow [2022-12-13 13:33:15,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 619 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:15,878 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 382 flow [2022-12-13 13:33:15,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2022-12-13 13:33:15,878 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-13 13:33:15,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:15,878 INFO L89 Accepts]: Start accepts. Operand has 45 places, 42 transitions, 382 flow [2022-12-13 13:33:15,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:15,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:15,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 42 transitions, 382 flow [2022-12-13 13:33:15,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 382 flow [2022-12-13 13:33:15,889 INFO L130 PetriNetUnfolder]: 40/135 cut-off events. [2022-12-13 13:33:15,889 INFO L131 PetriNetUnfolder]: For 345/354 co-relation queries the response was YES. [2022-12-13 13:33:15,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 135 events. 40/135 cut-off events. For 345/354 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 555 event pairs, 6 based on Foata normal form. 6/115 useless extension candidates. Maximal degree in co-relation 510. Up to 43 conditions per place. [2022-12-13 13:33:15,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 42 transitions, 382 flow [2022-12-13 13:33:15,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 13:33:15,890 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:15,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 13:33:15,891 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 382 flow [2022-12-13 13:33:15,891 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-13 13:33:15,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:15,891 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:15,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:33:15,891 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-13 13:33:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -897434626, now seen corresponding path program 1 times [2022-12-13 13:33:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:15,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621454124] [2022-12-13 13:33:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:16,180 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-13 13:33:16,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:16,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621454124] [2022-12-13 13:33:16,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621454124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:16,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:16,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928156580] [2022-12-13 13:33:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:16,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:33:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:33:16,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:33:16,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 13:33:16,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 382 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-13 13:33:16,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:16,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 13:33:16,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:16,279 INFO L130 PetriNetUnfolder]: 159/312 cut-off events. [2022-12-13 13:33:16,279 INFO L131 PetriNetUnfolder]: For 1220/1231 co-relation queries the response was YES. [2022-12-13 13:33:16,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 312 events. 159/312 cut-off events. For 1220/1231 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1204 event pairs, 42 based on Foata normal form. 11/273 useless extension candidates. Maximal degree in co-relation 1524. Up to 284 conditions per place. [2022-12-13 13:33:16,281 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 39 selfloop transitions, 6 changer transitions 7/53 dead transitions. [2022-12-13 13:33:16,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 530 flow [2022-12-13 13:33:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 13:33:16,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-13 13:33:16,282 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 382 flow. Second operand 5 states and 38 transitions. [2022-12-13 13:33:16,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 530 flow [2022-12-13 13:33:16,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 492 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:16,285 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 350 flow [2022-12-13 13:33:16,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-13 13:33:16,285 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-13 13:33:16,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:16,285 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 350 flow [2022-12-13 13:33:16,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:16,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:16,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 350 flow [2022-12-13 13:33:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 350 flow [2022-12-13 13:33:16,303 INFO L130 PetriNetUnfolder]: 40/128 cut-off events. [2022-12-13 13:33:16,303 INFO L131 PetriNetUnfolder]: For 280/287 co-relation queries the response was YES. [2022-12-13 13:33:16,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 128 events. 40/128 cut-off events. For 280/287 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 507 event pairs, 6 based on Foata normal form. 6/108 useless extension candidates. Maximal degree in co-relation 437. Up to 43 conditions per place. [2022-12-13 13:33:16,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 41 transitions, 350 flow [2022-12-13 13:33:16,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 13:33:16,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_230| v_~q~0.base_166))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_83| 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_83| v_~s~0_158) v_~s~0_157) (= |v_thread1Thread1of1ForFork0_~i~0#1_98| 1) (= (ite (= (select .cse0 (+ (* v_~q_back~0_291 4) v_~q~0.offset_166)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (ite (and (<= 0 v_~q_front~0_214) (< v_~q_front~0_214 v_~n~0_179) (< v_~q_front~0_214 v_~q_back~0_290)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (+ 1 v_~q_front~0_214) v_~q_front~0_213) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= (+ v_~q_back~0_291 1) v_~q_back~0_290) (< |v_thread1Thread1of1ForFork0_~i~0#1_98| (+ v_~N~0_118 1)) (not (= (ite (and (<= 0 v_~q_back~0_291) (< v_~q_back~0_291 v_~n~0_179)) 1 0) 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_214) v_~q~0.offset_166)) |v_thread2Thread1of1ForFork1_~j~0#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|))) InVars {~q_back~0=v_~q_back~0_291, #memory_int=|v_#memory_int_230|, ~N~0=v_~N~0_118, ~q~0.base=v_~q~0.base_166, ~n~0=v_~n~0_179, ~q~0.offset=v_~q~0.offset_166, ~s~0=v_~s~0_158, ~q_front~0=v_~q_front~0_214} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_83|, ~q_back~0=v_~q_back~0_290, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_73|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_60|, ~N~0=v_~N~0_118, ~q~0.base=v_~q~0.base_166, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_73|, ~q~0.offset=v_~q~0.offset_166, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, 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_98|, #memory_int=|v_#memory_int_230|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_95|, ~n~0=v_~n~0_179, ~s~0=v_~s~0_157, ~q_front~0=v_~q_front~0_213} 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-13 13:33:16,309 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:16,309 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:16,309 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:16,309 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:16,309 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:16,309 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:16,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:16,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-13 13:33:16,535 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 344 flow [2022-12-13 13:33:16,535 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-13 13:33:16,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:16,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:16,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:33:16,535 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-13 13:33:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1033562687, now seen corresponding path program 1 times [2022-12-13 13:33:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:16,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712296269] [2022-12-13 13:33:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:16,747 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-13 13:33:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:16,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712296269] [2022-12-13 13:33:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712296269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022894198] [2022-12-13 13:33:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:16,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:16,749 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-13 13:33:16,751 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-13 13:33:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:16,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 13:33:16,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:16,848 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-13 13:33:16,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:16,870 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 13:33:16,871 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-13 13:33:16,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-13 13:33:16,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022894198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:16,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:16,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-12-13 13:33:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373229533] [2022-12-13 13:33:16,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:16,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:33:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:33:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:33:16,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 13:33:16,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 344 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-13 13:33:16,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:16,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 13:33:16,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:17,035 INFO L130 PetriNetUnfolder]: 177/328 cut-off events. [2022-12-13 13:33:17,035 INFO L131 PetriNetUnfolder]: For 1371/1388 co-relation queries the response was YES. [2022-12-13 13:33:17,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 328 events. 177/328 cut-off events. For 1371/1388 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1262 event pairs, 21 based on Foata normal form. 38/306 useless extension candidates. Maximal degree in co-relation 1499. Up to 217 conditions per place. [2022-12-13 13:33:17,037 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 60 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2022-12-13 13:33:17,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 692 flow [2022-12-13 13:33:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:33:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:33:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-13 13:33:17,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 13:33:17,038 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 344 flow. Second operand 7 states and 56 transitions. [2022-12-13 13:33:17,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 692 flow [2022-12-13 13:33:17,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 74 transitions, 638 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:17,041 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 387 flow [2022-12-13 13:33:17,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=387, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2022-12-13 13:33:17,041 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 13:33:17,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:17,041 INFO L89 Accepts]: Start accepts. Operand has 42 places, 43 transitions, 387 flow [2022-12-13 13:33:17,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:17,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:17,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 43 transitions, 387 flow [2022-12-13 13:33:17,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 387 flow [2022-12-13 13:33:17,052 INFO L130 PetriNetUnfolder]: 51/142 cut-off events. [2022-12-13 13:33:17,052 INFO L131 PetriNetUnfolder]: For 501/518 co-relation queries the response was YES. [2022-12-13 13:33:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 142 events. 51/142 cut-off events. For 501/518 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 560 event pairs, 8 based on Foata normal form. 7/125 useless extension candidates. Maximal degree in co-relation 283. Up to 54 conditions per place. [2022-12-13 13:33:17,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 387 flow [2022-12-13 13:33:17,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 13:33:17,053 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-13 13:33:17,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:17,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 13:33:17,151 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 393 flow [2022-12-13 13:33:17,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-13 13:33:17,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:17,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:17,163 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-13 13:33:17,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:17,352 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-13 13:33:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 28217090, now seen corresponding path program 1 times [2022-12-13 13:33:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:17,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950670061] [2022-12-13 13:33:17,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:17,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:17,669 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-13 13:33:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:17,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950670061] [2022-12-13 13:33:17,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950670061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:17,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:33:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503015403] [2022-12-13 13:33:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:17,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:33:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:33:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:33:17,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 13:33:17,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 393 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-13 13:33:17,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:17,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 13:33:17,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:17,861 INFO L130 PetriNetUnfolder]: 253/484 cut-off events. [2022-12-13 13:33:17,862 INFO L131 PetriNetUnfolder]: For 2420/2440 co-relation queries the response was YES. [2022-12-13 13:33:17,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 484 events. 253/484 cut-off events. For 2420/2440 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2128 event pairs, 32 based on Foata normal form. 31/457 useless extension candidates. Maximal degree in co-relation 1555. Up to 272 conditions per place. [2022-12-13 13:33:17,865 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 63 selfloop transitions, 27 changer transitions 0/91 dead transitions. [2022-12-13 13:33:17,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 91 transitions, 906 flow [2022-12-13 13:33:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:33:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:33:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-12-13 13:33:17,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 13:33:17,866 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 393 flow. Second operand 8 states and 64 transitions. [2022-12-13 13:33:17,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 91 transitions, 906 flow [2022-12-13 13:33:17,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 91 transitions, 847 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:17,871 INFO L231 Difference]: Finished difference. Result has 51 places, 62 transitions, 657 flow [2022-12-13 13:33:17,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=657, PETRI_PLACES=51, PETRI_TRANSITIONS=62} [2022-12-13 13:33:17,871 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-13 13:33:17,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:17,871 INFO L89 Accepts]: Start accepts. Operand has 51 places, 62 transitions, 657 flow [2022-12-13 13:33:17,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:17,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:17,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 62 transitions, 657 flow [2022-12-13 13:33:17,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 62 transitions, 657 flow [2022-12-13 13:33:17,888 INFO L130 PetriNetUnfolder]: 74/218 cut-off events. [2022-12-13 13:33:17,888 INFO L131 PetriNetUnfolder]: For 909/984 co-relation queries the response was YES. [2022-12-13 13:33:17,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 218 events. 74/218 cut-off events. For 909/984 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1026 event pairs, 6 based on Foata normal form. 20/204 useless extension candidates. Maximal degree in co-relation 759. Up to 83 conditions per place. [2022-12-13 13:33:17,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 62 transitions, 657 flow [2022-12-13 13:33:17,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-13 13:33:17,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:33:18,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:18,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:33:18,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:18,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:18,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 677 [2022-12-13 13:33:18,548 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 62 transitions, 689 flow [2022-12-13 13:33:18,548 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-13 13:33:18,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:18,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:18,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:33:18,549 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-13 13:33:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1531694904, now seen corresponding path program 1 times [2022-12-13 13:33:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:18,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270587269] [2022-12-13 13:33:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:18,842 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-13 13:33:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270587269] [2022-12-13 13:33:18,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270587269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:18,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:18,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:33:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84047856] [2022-12-13 13:33:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:18,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:33:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:33:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:33:18,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 13:33:18,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 62 transitions, 689 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-13 13:33:18,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:18,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 13:33:18,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:19,018 INFO L130 PetriNetUnfolder]: 259/499 cut-off events. [2022-12-13 13:33:19,018 INFO L131 PetriNetUnfolder]: For 2983/3017 co-relation queries the response was YES. [2022-12-13 13:33:19,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 499 events. 259/499 cut-off events. For 2983/3017 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2257 event pairs, 52 based on Foata normal form. 34/479 useless extension candidates. Maximal degree in co-relation 2257. Up to 460 conditions per place. [2022-12-13 13:33:19,021 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 56 selfloop transitions, 9 changer transitions 8/74 dead transitions. [2022-12-13 13:33:19,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 900 flow [2022-12-13 13:33:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-13 13:33:19,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-13 13:33:19,022 INFO L175 Difference]: Start difference. First operand has 51 places, 62 transitions, 689 flow. Second operand 6 states and 48 transitions. [2022-12-13 13:33:19,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 900 flow [2022-12-13 13:33:19,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 852 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-13 13:33:19,026 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 660 flow [2022-12-13 13:33:19,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2022-12-13 13:33:19,027 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-13 13:33:19,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:19,027 INFO L89 Accepts]: Start accepts. Operand has 58 places, 61 transitions, 660 flow [2022-12-13 13:33:19,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:19,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:19,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 61 transitions, 660 flow [2022-12-13 13:33:19,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 660 flow [2022-12-13 13:33:19,045 INFO L130 PetriNetUnfolder]: 71/219 cut-off events. [2022-12-13 13:33:19,045 INFO L131 PetriNetUnfolder]: For 838/901 co-relation queries the response was YES. [2022-12-13 13:33:19,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 219 events. 71/219 cut-off events. For 838/901 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1071 event pairs, 6 based on Foata normal form. 21/210 useless extension candidates. Maximal degree in co-relation 859. Up to 80 conditions per place. [2022-12-13 13:33:19,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 61 transitions, 660 flow [2022-12-13 13:33:19,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 13:33:19,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_263| v_~q~0.base_187))) (and (= (+ 1 v_~q_front~0_246) v_~q_front~0_245) (= (+ v_~q_back~0_330 1) v_~q_back~0_329) (= (ite (and (< v_~q_front~0_246 v_~q_back~0_329) (<= 0 v_~q_front~0_246) (< v_~q_front~0_246 v_~n~0_197)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_246) v_~q~0.offset_187)) |v_thread2Thread1of1ForFork1_~j~0#1_107|) (not (= (ite (and (<= 0 v_~q_back~0_330) (< v_~q_back~0_330 v_~n~0_197)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_107| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 1) (= (+ v_~s~0_192 |v_thread2Thread1of1ForFork1_~j~0#1_107|) v_~s~0_191) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_132 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (= (select .cse0 (+ v_~q~0.offset_187 (* v_~q_back~0_330 4))) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0)))) InVars {~q_back~0=v_~q_back~0_330, #memory_int=|v_#memory_int_263|, ~N~0=v_~N~0_132, ~q~0.base=v_~q~0.base_187, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_187, ~s~0=v_~s~0_192, ~q_front~0=v_~q_front~0_246} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_107|, ~q_back~0=v_~q_back~0_329, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_94|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_80|, ~N~0=v_~N~0_132, ~q~0.base=v_~q~0.base_187, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_94|, ~q~0.offset=v_~q~0.offset_187, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_84|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_80|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, #memory_int=|v_#memory_int_263|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, ~n~0=v_~n~0_197, ~s~0=v_~s~0_191, ~q_front~0=v_~q_front~0_245} 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-13 13:33:19,053 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:19,054 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:19,054 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:19,054 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:19,054 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:19,054 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:19,285 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:19,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-13 13:33:19,285 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 654 flow [2022-12-13 13:33:19,286 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-13 13:33:19,286 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:19,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:19,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:33:19,286 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-13 13:33:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash 72947312, now seen corresponding path program 1 times [2022-12-13 13:33:19,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:19,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717079372] [2022-12-13 13:33:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:19,668 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-13 13:33:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:19,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717079372] [2022-12-13 13:33:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717079372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:19,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:19,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:33:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869506603] [2022-12-13 13:33:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:33:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:33:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:33:19,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 13:33:19,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 654 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-13 13:33:19,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:19,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 13:33:19,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:19,847 INFO L130 PetriNetUnfolder]: 232/426 cut-off events. [2022-12-13 13:33:19,847 INFO L131 PetriNetUnfolder]: For 2532/2566 co-relation queries the response was YES. [2022-12-13 13:33:19,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 426 events. 232/426 cut-off events. For 2532/2566 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1729 event pairs, 35 based on Foata normal form. 41/423 useless extension candidates. Maximal degree in co-relation 2197. Up to 272 conditions per place. [2022-12-13 13:33:19,850 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 54 selfloop transitions, 16 changer transitions 0/71 dead transitions. [2022-12-13 13:33:19,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 826 flow [2022-12-13 13:33:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 13:33:19,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-13 13:33:19,851 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 654 flow. Second operand 4 states and 44 transitions. [2022-12-13 13:33:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 826 flow [2022-12-13 13:33:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 800 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:19,855 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 610 flow [2022-12-13 13:33:19,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=610, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2022-12-13 13:33:19,856 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-13 13:33:19,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:19,856 INFO L89 Accepts]: Start accepts. Operand has 52 places, 56 transitions, 610 flow [2022-12-13 13:33:19,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:19,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:19,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 56 transitions, 610 flow [2022-12-13 13:33:19,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 56 transitions, 610 flow [2022-12-13 13:33:19,871 INFO L130 PetriNetUnfolder]: 67/192 cut-off events. [2022-12-13 13:33:19,871 INFO L131 PetriNetUnfolder]: For 920/970 co-relation queries the response was YES. [2022-12-13 13:33:19,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 192 events. 67/192 cut-off events. For 920/970 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 872 event pairs, 10 based on Foata normal form. 17/183 useless extension candidates. Maximal degree in co-relation 564. Up to 67 conditions per place. [2022-12-13 13:33:19,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 56 transitions, 610 flow [2022-12-13 13:33:19,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 13:33:19,873 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:19,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 13:33:19,873 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 610 flow [2022-12-13 13:33:19,873 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-13 13:33:19,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:19,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:19,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:33:19,874 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-13 13:33:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1437398975, now seen corresponding path program 2 times [2022-12-13 13:33:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:19,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136329423] [2022-12-13 13:33:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:20,174 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-13 13:33:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136329423] [2022-12-13 13:33:20,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136329423] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640640842] [2022-12-13 13:33:20,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:33:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:20,177 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-13 13:33:20,179 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-13 13:33:20,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:33:20,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:33:20,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:33:20,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:20,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:20,323 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-13 13:33:20,459 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-13 13:33:20,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:20,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:20,548 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 44 [2022-12-13 13:33:20,551 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-13 13:33:20,604 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-13 13:33:20,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640640842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:20,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:20,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 13:33:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426848820] [2022-12-13 13:33:20,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:20,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:33:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:33:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:33:20,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 13:33:20,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 610 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-13 13:33:20,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:20,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 13:33:20,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:21,021 INFO L130 PetriNetUnfolder]: 300/558 cut-off events. [2022-12-13 13:33:21,022 INFO L131 PetriNetUnfolder]: For 3452/3469 co-relation queries the response was YES. [2022-12-13 13:33:21,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 558 events. 300/558 cut-off events. For 3452/3469 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2513 event pairs, 59 based on Foata normal form. 24/520 useless extension candidates. Maximal degree in co-relation 2105. Up to 285 conditions per place. [2022-12-13 13:33:21,025 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 93 selfloop transitions, 18 changer transitions 0/112 dead transitions. [2022-12-13 13:33:21,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 1242 flow [2022-12-13 13:33:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:33:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:33:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-12-13 13:33:21,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2022-12-13 13:33:21,027 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 610 flow. Second operand 9 states and 75 transitions. [2022-12-13 13:33:21,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 1242 flow [2022-12-13 13:33:21,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 112 transitions, 1202 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:21,032 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 770 flow [2022-12-13 13:33:21,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=770, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2022-12-13 13:33:21,033 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 40 predicate places. [2022-12-13 13:33:21,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:21,033 INFO L89 Accepts]: Start accepts. Operand has 61 places, 66 transitions, 770 flow [2022-12-13 13:33:21,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:21,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:21,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 66 transitions, 770 flow [2022-12-13 13:33:21,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 770 flow [2022-12-13 13:33:21,052 INFO L130 PetriNetUnfolder]: 84/239 cut-off events. [2022-12-13 13:33:21,052 INFO L131 PetriNetUnfolder]: For 1279/1346 co-relation queries the response was YES. [2022-12-13 13:33:21,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 239 events. 84/239 cut-off events. For 1279/1346 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1160 event pairs, 4 based on Foata normal form. 19/246 useless extension candidates. Maximal degree in co-relation 945. Up to 89 conditions per place. [2022-12-13 13:33:21,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 66 transitions, 770 flow [2022-12-13 13:33:21,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 13:33:21,071 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:21,072 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:21,072 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:21,072 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:21,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_234| v_~q~0.base_170))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (< |v_thread1Thread1of1ForFork0_~i~0#1_102| (+ v_~N~0_122 1)) (= (+ 2 v_~q_back~0_302) v_~q_back~0_300) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_170 (* v_~q_back~0_300 4))) 1) 1 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_170 (* v_~q_back~0_302 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|) (not (= (ite (and (<= 1 v_~q_back~0_300) (< v_~q_back~0_300 (+ v_~n~0_183 1))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_302) (< v_~q_back~0_302 v_~n~0_183)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)))) InVars {~q_back~0=v_~q_back~0_302, #memory_int=|v_#memory_int_234|, ~N~0=v_~N~0_122, ~q~0.base=v_~q~0.base_170, ~n~0=v_~n~0_183, ~q~0.offset=v_~q~0.offset_170} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_68|, ~q_back~0=v_~q_back~0_300, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, #memory_int=|v_#memory_int_234|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ~N~0=v_~N~0_122, ~q~0.base=v_~q~0.base_170, ~n~0=v_~n~0_183, ~q~0.offset=v_~q~0.offset_170} 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-13 13:33:21,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:21,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 550 [2022-12-13 13:33:21,583 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 815 flow [2022-12-13 13:33:21,583 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-13 13:33:21,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:21,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:21,590 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-13 13:33:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:21,788 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-13 13:33:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash -246544338, now seen corresponding path program 1 times [2022-12-13 13:33:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:21,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890458248] [2022-12-13 13:33:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:22,087 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-13 13:33:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890458248] [2022-12-13 13:33:22,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890458248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596447002] [2022-12-13 13:33:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:22,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:22,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:22,089 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-13 13:33:22,091 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-13 13:33:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:22,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 13:33:22,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:22,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-13 13:33:22,191 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-13 13:33:22,213 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-13 13:33:22,364 INFO L321 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2022-12-13 13:33:22,364 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-13 13:33:22,384 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-13 13:33:22,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:22,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-13 13:33:22,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596447002] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:22,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 13:33:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129886008] [2022-12-13 13:33:22,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:22,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:33:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:33:22,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2022-12-13 13:33:22,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 13:33:22,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 815 flow. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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-13 13:33:22,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:22,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 13:33:22,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:23,564 INFO L130 PetriNetUnfolder]: 385/732 cut-off events. [2022-12-13 13:33:23,565 INFO L131 PetriNetUnfolder]: For 5739/5869 co-relation queries the response was YES. [2022-12-13 13:33:23,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 732 events. 385/732 cut-off events. For 5739/5869 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3647 event pairs, 62 based on Foata normal form. 30/744 useless extension candidates. Maximal degree in co-relation 2902. Up to 508 conditions per place. [2022-12-13 13:33:23,570 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 89 selfloop transitions, 51 changer transitions 7/148 dead transitions. [2022-12-13 13:33:23,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 148 transitions, 1757 flow [2022-12-13 13:33:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:33:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:33:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 111 transitions. [2022-12-13 13:33:23,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296 [2022-12-13 13:33:23,571 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 815 flow. Second operand 15 states and 111 transitions. [2022-12-13 13:33:23,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 148 transitions, 1757 flow [2022-12-13 13:33:23,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 1642 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:23,581 INFO L231 Difference]: Finished difference. Result has 78 places, 103 transitions, 1382 flow [2022-12-13 13:33:23,581 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1382, PETRI_PLACES=78, PETRI_TRANSITIONS=103} [2022-12-13 13:33:23,581 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 57 predicate places. [2022-12-13 13:33:23,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:23,581 INFO L89 Accepts]: Start accepts. Operand has 78 places, 103 transitions, 1382 flow [2022-12-13 13:33:23,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:23,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:23,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 103 transitions, 1382 flow [2022-12-13 13:33:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 103 transitions, 1382 flow [2022-12-13 13:33:23,607 INFO L130 PetriNetUnfolder]: 99/305 cut-off events. [2022-12-13 13:33:23,607 INFO L131 PetriNetUnfolder]: For 2285/2405 co-relation queries the response was YES. [2022-12-13 13:33:23,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 305 events. 99/305 cut-off events. For 2285/2405 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1692 event pairs, 4 based on Foata normal form. 23/315 useless extension candidates. Maximal degree in co-relation 1523. Up to 114 conditions per place. [2022-12-13 13:33:23,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 103 transitions, 1382 flow [2022-12-13 13:33:23,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 13:33:23,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:23,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:23,927 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:23,927 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:23,927 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:23,927 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:23,927 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:23,928 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,196 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,196 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,196 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,197 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,197 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,197 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_331| v_~q~0.base_229)) (.cse1 (* v_~q_back~0_416 4))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_174| 3) (not (= (ite (and (< v_~q_back~0_416 v_~n~0_239) (<= 0 v_~q_back~0_416)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159| 0)) (= (+ 3 v_~q_back~0_416) v_~q_back~0_414) (= (ite (= 1 (select .cse0 (+ .cse1 8 v_~q~0.offset_229))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|) (< |v_thread1Thread1of1ForFork0_~i~0#1_174| (+ v_~N~0_168 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_229)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_416))) (and (<= 0 .cse2) (< .cse2 v_~n~0_239))) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_229 4)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_416, #memory_int=|v_#memory_int_331|, ~N~0=v_~N~0_168, ~q~0.base=v_~q~0.base_229, ~n~0=v_~n~0_239, ~q~0.offset=v_~q~0.offset_229} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_108|, ~q_back~0=v_~q_back~0_414, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_104|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_174|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, #memory_int=|v_#memory_int_331|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_104|, ~N~0=v_~N~0_168, ~q~0.base=v_~q~0.base_229, ~n~0=v_~n~0_239, ~q~0.offset=v_~q~0.offset_229} 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-13 13:33:24,885 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,885 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,957 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:24,957 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:25,050 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:33:25,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1470 [2022-12-13 13:33:25,051 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 1406 flow [2022-12-13 13:33:25,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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-13 13:33:25,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:25,051 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:25,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:33:25,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 13:33:25,258 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-13 13:33:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1984136577, now seen corresponding path program 1 times [2022-12-13 13:33:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867881712] [2022-12-13 13:33:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:25,630 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-13 13:33:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:25,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867881712] [2022-12-13 13:33:25,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867881712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:25,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185366523] [2022-12-13 13:33:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:25,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:25,632 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-13 13:33:25,635 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-13 13:33:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:25,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 13:33:25,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:25,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:25,862 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-13 13:33:25,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-13 13:33:25,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:25,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:25,952 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-13 13:33:26,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-13 13:33:26,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185366523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:26,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:26,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:33:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472221153] [2022-12-13 13:33:26,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:26,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:33:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:33:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:33:26,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 13:33:26,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 1406 flow. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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-13 13:33:26,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:26,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 13:33:26,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:26,408 INFO L130 PetriNetUnfolder]: 386/721 cut-off events. [2022-12-13 13:33:26,408 INFO L131 PetriNetUnfolder]: For 7302/7413 co-relation queries the response was YES. [2022-12-13 13:33:26,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 721 events. 386/721 cut-off events. For 7302/7413 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3514 event pairs, 48 based on Foata normal form. 60/763 useless extension candidates. Maximal degree in co-relation 4589. Up to 567 conditions per place. [2022-12-13 13:33:26,414 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 95 selfloop transitions, 31 changer transitions 5/132 dead transitions. [2022-12-13 13:33:26,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 132 transitions, 1836 flow [2022-12-13 13:33:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:33:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:33:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-12-13 13:33:26,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29435483870967744 [2022-12-13 13:33:26,415 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 1406 flow. Second operand 8 states and 73 transitions. [2022-12-13 13:33:26,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 132 transitions, 1836 flow [2022-12-13 13:33:26,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 1616 flow, removed 102 selfloop flow, removed 7 redundant places. [2022-12-13 13:33:26,429 INFO L231 Difference]: Finished difference. Result has 77 places, 102 transitions, 1316 flow [2022-12-13 13:33:26,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1316, PETRI_PLACES=77, PETRI_TRANSITIONS=102} [2022-12-13 13:33:26,429 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2022-12-13 13:33:26,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:26,429 INFO L89 Accepts]: Start accepts. Operand has 77 places, 102 transitions, 1316 flow [2022-12-13 13:33:26,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:26,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:26,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 102 transitions, 1316 flow [2022-12-13 13:33:26,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 1316 flow [2022-12-13 13:33:26,470 INFO L130 PetriNetUnfolder]: 105/306 cut-off events. [2022-12-13 13:33:26,470 INFO L131 PetriNetUnfolder]: For 2341/2415 co-relation queries the response was YES. [2022-12-13 13:33:26,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 306 events. 105/306 cut-off events. For 2341/2415 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1650 event pairs, 4 based on Foata normal form. 22/295 useless extension candidates. Maximal degree in co-relation 1577. Up to 99 conditions per place. [2022-12-13 13:33:26,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 1316 flow [2022-12-13 13:33:26,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-13 13:33:26,477 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:26,477 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:26,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [601] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_335| v_~q~0.base_233)) (.cse1 (* v_~q_back~0_426 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_165|) (= (+ 3 v_~q_back~0_426) v_~q_back~0_424) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_233 .cse1)) 1) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_180| v_~N~0_172)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_51| 0) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_426))) (and (<= 0 .cse2) (< .cse2 v_~n~0_243))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_180| 2) (< |v_thread1Thread1of1ForFork0_~i~0#1_180| (+ v_~N~0_172 1)) (not (= (ite (and (<= 0 v_~q_back~0_426) (< v_~q_back~0_426 v_~n~0_243)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_233 4 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_51| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_165| 0)) (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_233 .cse1)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|))) InVars {~q_back~0=v_~q_back~0_426, #memory_int=|v_#memory_int_335|, ~N~0=v_~N~0_172, ~q~0.base=v_~q~0.base_233, ~n~0=v_~n~0_243, ~q~0.offset=v_~q~0.offset_233} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_51|, ~q_back~0=v_~q_back~0_424, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_69|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_110|, ~N~0=v_~N~0_172, ~q~0.base=v_~q~0.base_233, ~q~0.offset=v_~q~0.offset_233, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_114|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_110|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_180|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_69|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_165|, #memory_int=|v_#memory_int_335|, ~n~0=v_~n~0_243, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_51|} 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-13 13:33:26,698 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:26,698 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:26,858 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:33:26,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-13 13:33:26,859 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 1309 flow [2022-12-13 13:33:26,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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-13 13:33:26,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:26,859 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:26,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 13:33:27,064 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-13 13:33:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 278800703, now seen corresponding path program 1 times [2022-12-13 13:33:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020717812] [2022-12-13 13:33:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:27,336 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-13 13:33:27,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020717812] [2022-12-13 13:33:27,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020717812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371020205] [2022-12-13 13:33:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:27,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:27,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:27,338 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-13 13:33:27,341 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-13 13:33:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:27,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 13:33:27,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:27,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:27,463 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-13 13:33:27,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:27,566 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-13 13:33:27,585 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-13 13:33:27,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:27,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:27,680 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-13 13:33:27,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:27,689 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-13 13:33:27,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:27,695 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-13 13:33:27,779 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-13 13:33:27,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371020205] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:27,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:33:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655295652] [2022-12-13 13:33:27,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:27,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:33:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:33:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:33:27,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 13:33:27,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 1309 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-13 13:33:27,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:27,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 13:33:27,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:28,237 INFO L130 PetriNetUnfolder]: 445/825 cut-off events. [2022-12-13 13:33:28,237 INFO L131 PetriNetUnfolder]: For 8232/8328 co-relation queries the response was YES. [2022-12-13 13:33:28,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5329 conditions, 825 events. 445/825 cut-off events. For 8232/8328 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4082 event pairs, 75 based on Foata normal form. 41/784 useless extension candidates. Maximal degree in co-relation 5266. Up to 557 conditions per place. [2022-12-13 13:33:28,244 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 101 selfloop transitions, 45 changer transitions 2/149 dead transitions. [2022-12-13 13:33:28,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 149 transitions, 2039 flow [2022-12-13 13:33:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:33:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:33:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 13:33:28,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29296875 [2022-12-13 13:33:28,246 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 1309 flow. Second operand 8 states and 75 transitions. [2022-12-13 13:33:28,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 149 transitions, 2039 flow [2022-12-13 13:33:28,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 149 transitions, 1966 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-13 13:33:28,261 INFO L231 Difference]: Finished difference. Result has 80 places, 116 transitions, 1593 flow [2022-12-13 13:33:28,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1593, PETRI_PLACES=80, PETRI_TRANSITIONS=116} [2022-12-13 13:33:28,262 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2022-12-13 13:33:28,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:28,262 INFO L89 Accepts]: Start accepts. Operand has 80 places, 116 transitions, 1593 flow [2022-12-13 13:33:28,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:28,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:28,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 116 transitions, 1593 flow [2022-12-13 13:33:28,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 116 transitions, 1593 flow [2022-12-13 13:33:28,292 INFO L130 PetriNetUnfolder]: 123/355 cut-off events. [2022-12-13 13:33:28,293 INFO L131 PetriNetUnfolder]: For 3026/3101 co-relation queries the response was YES. [2022-12-13 13:33:28,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 355 events. 123/355 cut-off events. For 3026/3101 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2000 event pairs, 7 based on Foata normal form. 21/335 useless extension candidates. Maximal degree in co-relation 1853. Up to 119 conditions per place. [2022-12-13 13:33:28,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 116 transitions, 1593 flow [2022-12-13 13:33:28,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 13:33:28,300 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:28,300 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:28,378 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:28,379 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:28,524 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:33:28,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-13 13:33:28,524 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 114 transitions, 1571 flow [2022-12-13 13:33:28,525 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-13 13:33:28,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:28,525 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:28,531 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-13 13:33:28,729 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,SelfDestructingSolverStorable27 [2022-12-13 13:33:28,729 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-13 13:33:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1656259359, now seen corresponding path program 1 times [2022-12-13 13:33:28,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:28,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623198350] [2022-12-13 13:33:28,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:28,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:28,781 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-13 13:33:28,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:28,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623198350] [2022-12-13 13:33:28,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623198350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:28,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512144334] [2022-12-13 13:33:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:28,783 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-13 13:33:28,785 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-13 13:33:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:28,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:33:28,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:28,889 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-13 13:33:28,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:33:28,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512144334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:28,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:33:28,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:33:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465444261] [2022-12-13 13:33:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:28,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:33:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:33:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:28,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-13 13:33:28,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 114 transitions, 1571 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-13 13:33:28,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:28,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-13 13:33:28,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:29,028 INFO L130 PetriNetUnfolder]: 429/794 cut-off events. [2022-12-13 13:33:29,028 INFO L131 PetriNetUnfolder]: For 8435/8457 co-relation queries the response was YES. [2022-12-13 13:33:29,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5253 conditions, 794 events. 429/794 cut-off events. For 8435/8457 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3858 event pairs, 148 based on Foata normal form. 14/725 useless extension candidates. Maximal degree in co-relation 4955. Up to 484 conditions per place. [2022-12-13 13:33:29,040 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 126 selfloop transitions, 1 changer transitions 7/135 dead transitions. [2022-12-13 13:33:29,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 135 transitions, 2022 flow [2022-12-13 13:33:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 13:33:29,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2022-12-13 13:33:29,041 INFO L175 Difference]: Start difference. First operand has 78 places, 114 transitions, 1571 flow. Second operand 4 states and 53 transitions. [2022-12-13 13:33:29,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 135 transitions, 2022 flow [2022-12-13 13:33:29,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 135 transitions, 1954 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 13:33:29,054 INFO L231 Difference]: Finished difference. Result has 78 places, 110 transitions, 1423 flow [2022-12-13 13:33:29,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1423, PETRI_PLACES=78, PETRI_TRANSITIONS=110} [2022-12-13 13:33:29,056 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 57 predicate places. [2022-12-13 13:33:29,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:29,056 INFO L89 Accepts]: Start accepts. Operand has 78 places, 110 transitions, 1423 flow [2022-12-13 13:33:29,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:29,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:29,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 110 transitions, 1423 flow [2022-12-13 13:33:29,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 110 transitions, 1423 flow [2022-12-13 13:33:29,084 INFO L130 PetriNetUnfolder]: 121/331 cut-off events. [2022-12-13 13:33:29,084 INFO L131 PetriNetUnfolder]: For 2673/2744 co-relation queries the response was YES. [2022-12-13 13:33:29,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 331 events. 121/331 cut-off events. For 2673/2744 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1768 event pairs, 5 based on Foata normal form. 19/311 useless extension candidates. Maximal degree in co-relation 1528. Up to 119 conditions per place. [2022-12-13 13:33:29,087 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 110 transitions, 1423 flow [2022-12-13 13:33:29,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 13:33:29,092 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:29,092 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:29,092 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:29,092 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:29,278 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:29,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-13 13:33:29,279 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 110 transitions, 1440 flow [2022-12-13 13:33:29,279 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-13 13:33:29,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:29,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:29,286 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-13 13:33:29,480 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,SelfDestructingSolverStorable28 [2022-12-13 13:33:29,480 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-13 13:33:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1352487961, now seen corresponding path program 1 times [2022-12-13 13:33:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:29,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079222503] [2022-12-13 13:33:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:29,538 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-13 13:33:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:29,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079222503] [2022-12-13 13:33:29,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079222503] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:29,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079520873] [2022-12-13 13:33:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:29,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:29,541 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-13 13:33:29,542 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-13 13:33:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:29,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:33:29,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:29,646 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-13 13:33:29,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:33:29,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079520873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:29,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:33:29,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 13:33:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811600365] [2022-12-13 13:33:29,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:29,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:33:29,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-13 13:33:29,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 110 transitions, 1440 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-13 13:33:29,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:29,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-13 13:33:29,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:29,842 INFO L130 PetriNetUnfolder]: 575/1101 cut-off events. [2022-12-13 13:33:29,843 INFO L131 PetriNetUnfolder]: For 12960/13061 co-relation queries the response was YES. [2022-12-13 13:33:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7265 conditions, 1101 events. 575/1101 cut-off events. For 12960/13061 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6091 event pairs, 58 based on Foata normal form. 89/1054 useless extension candidates. Maximal degree in co-relation 6201. Up to 469 conditions per place. [2022-12-13 13:33:29,850 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 67 selfloop transitions, 80 changer transitions 4/152 dead transitions. [2022-12-13 13:33:29,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 152 transitions, 2134 flow [2022-12-13 13:33:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 13:33:29,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2022-12-13 13:33:29,851 INFO L175 Difference]: Start difference. First operand has 75 places, 110 transitions, 1440 flow. Second operand 5 states and 67 transitions. [2022-12-13 13:33:29,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 152 transitions, 2134 flow [2022-12-13 13:33:29,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 152 transitions, 2100 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 13:33:29,868 INFO L231 Difference]: Finished difference. Result has 76 places, 127 transitions, 1913 flow [2022-12-13 13:33:29,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1913, PETRI_PLACES=76, PETRI_TRANSITIONS=127} [2022-12-13 13:33:29,869 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2022-12-13 13:33:29,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:29,869 INFO L89 Accepts]: Start accepts. Operand has 76 places, 127 transitions, 1913 flow [2022-12-13 13:33:29,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:29,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:29,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 127 transitions, 1913 flow [2022-12-13 13:33:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 127 transitions, 1913 flow [2022-12-13 13:33:29,914 INFO L130 PetriNetUnfolder]: 149/455 cut-off events. [2022-12-13 13:33:29,914 INFO L131 PetriNetUnfolder]: For 3978/4068 co-relation queries the response was YES. [2022-12-13 13:33:29,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 455 events. 149/455 cut-off events. For 3978/4068 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2864 event pairs, 4 based on Foata normal form. 24/414 useless extension candidates. Maximal degree in co-relation 2570. Up to 185 conditions per place. [2022-12-13 13:33:29,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 127 transitions, 1913 flow [2022-12-13 13:33:29,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-13 13:33:29,918 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:29,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 13:33:29,919 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 127 transitions, 1913 flow [2022-12-13 13:33:29,919 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-13 13:33:29,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:29,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:29,926 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-13 13:33:30,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:30,124 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-13 13:33:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash -61262903, now seen corresponding path program 1 times [2022-12-13 13:33:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717374690] [2022-12-13 13:33:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:30,184 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-13 13:33:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:30,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717374690] [2022-12-13 13:33:30,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717374690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:30,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:30,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:33:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486516412] [2022-12-13 13:33:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:30,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:33:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:33:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:33:30,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 13:33:30,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 127 transitions, 1913 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-13 13:33:30,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:30,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 13:33:30,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:30,326 INFO L130 PetriNetUnfolder]: 444/897 cut-off events. [2022-12-13 13:33:30,326 INFO L131 PetriNetUnfolder]: For 11217/11279 co-relation queries the response was YES. [2022-12-13 13:33:30,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6479 conditions, 897 events. 444/897 cut-off events. For 11217/11279 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4920 event pairs, 182 based on Foata normal form. 52/840 useless extension candidates. Maximal degree in co-relation 6287. Up to 483 conditions per place. [2022-12-13 13:33:30,331 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 126 selfloop transitions, 3 changer transitions 10/140 dead transitions. [2022-12-13 13:33:30,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 2314 flow [2022-12-13 13:33:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 13:33:30,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-13 13:33:30,332 INFO L175 Difference]: Start difference. First operand has 75 places, 127 transitions, 1913 flow. Second operand 4 states and 54 transitions. [2022-12-13 13:33:30,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 2314 flow [2022-12-13 13:33:30,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 140 transitions, 2166 flow, removed 71 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:30,354 INFO L231 Difference]: Finished difference. Result has 74 places, 96 transitions, 1358 flow [2022-12-13 13:33:30,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1358, PETRI_PLACES=74, PETRI_TRANSITIONS=96} [2022-12-13 13:33:30,354 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2022-12-13 13:33:30,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:30,354 INFO L89 Accepts]: Start accepts. Operand has 74 places, 96 transitions, 1358 flow [2022-12-13 13:33:30,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:30,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:30,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 96 transitions, 1358 flow [2022-12-13 13:33:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 96 transitions, 1358 flow [2022-12-13 13:33:30,384 INFO L130 PetriNetUnfolder]: 109/366 cut-off events. [2022-12-13 13:33:30,384 INFO L131 PetriNetUnfolder]: For 2526/2592 co-relation queries the response was YES. [2022-12-13 13:33:30,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 366 events. 109/366 cut-off events. For 2526/2592 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2271 event pairs, 4 based on Foata normal form. 33/345 useless extension candidates. Maximal degree in co-relation 1708. Up to 113 conditions per place. [2022-12-13 13:33:30,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 96 transitions, 1358 flow [2022-12-13 13:33:30,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 13:33:30,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_234| v_~q~0.base_170))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (< |v_thread1Thread1of1ForFork0_~i~0#1_102| (+ v_~N~0_122 1)) (= (+ 2 v_~q_back~0_302) v_~q_back~0_300) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_170 (* v_~q_back~0_300 4))) 1) 1 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_170 (* v_~q_back~0_302 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|) (not (= (ite (and (<= 1 v_~q_back~0_300) (< v_~q_back~0_300 (+ v_~n~0_183 1))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_302) (< v_~q_back~0_302 v_~n~0_183)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)))) InVars {~q_back~0=v_~q_back~0_302, #memory_int=|v_#memory_int_234|, ~N~0=v_~N~0_122, ~q~0.base=v_~q~0.base_170, ~n~0=v_~n~0_183, ~q~0.offset=v_~q~0.offset_170} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_68|, ~q_back~0=v_~q_back~0_300, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, #memory_int=|v_#memory_int_234|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ~N~0=v_~N~0_122, ~q~0.base=v_~q~0.base_170, ~n~0=v_~n~0_183, ~q~0.offset=v_~q~0.offset_170} 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-13 13:33:30,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_260| v_~q~0.base_185)) (.cse1 (* v_~q_back~0_322 4)) (.cse2 (+ v_~q_back~0_322 1))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_185)) 1) 1 0) 0)) (= (+ 1 v_~q_front~0_239) v_~q_front~0_238) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_195)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_89| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_112| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (= (+ v_~s~0_186 |v_thread2Thread1of1ForFork1_~j~0#1_101|) v_~s~0_185) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_101| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_112| (+ v_~N~0_130 1)) (= (select .cse0 (+ (* 4 v_~q_front~0_239) v_~q~0.offset_185)) |v_thread2Thread1of1ForFork1_~j~0#1_101|) (= (+ 2 v_~q_back~0_322) v_~q_back~0_320) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111| (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_185 4)) 1) 1 0)) (= (ite (and (< v_~q_front~0_239 v_~n~0_195) (<= 0 v_~q_front~0_239) (< v_~q_front~0_239 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|))) InVars {~q_back~0=v_~q_back~0_322, #memory_int=|v_#memory_int_260|, ~N~0=v_~N~0_130, ~q~0.base=v_~q~0.base_185, ~n~0=v_~n~0_195, ~q~0.offset=v_~q~0.offset_185, ~s~0=v_~s~0_186, ~q_front~0=v_~q_front~0_239} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_101|, ~q_back~0=v_~q_back~0_320, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_74|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_89|, ~N~0=v_~N~0_130, ~q~0.base=v_~q~0.base_185, ~q~0.offset=v_~q~0.offset_185, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_89|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_89|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_78|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_74|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, #memory_int=|v_#memory_int_260|, ~n~0=v_~n~0_195, ~s~0=v_~s~0_185, ~q_front~0=v_~q_front~0_238} 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-13 13:33:30,746 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:33:30,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-13 13:33:30,747 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 95 transitions, 1371 flow [2022-12-13 13:33:30,747 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-13 13:33:30,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:30,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:30,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 13:33:30,747 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-13 13:33:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1377273188, now seen corresponding path program 1 times [2022-12-13 13:33:30,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:30,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17936544] [2022-12-13 13:33:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:30,830 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-13 13:33:30,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:30,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17936544] [2022-12-13 13:33:30,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17936544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:30,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:30,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281247611] [2022-12-13 13:33:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:30,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:30,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:30,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:30,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 13:33:30,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 95 transitions, 1371 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-13 13:33:30,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:30,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 13:33:30,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:30,941 INFO L130 PetriNetUnfolder]: 300/630 cut-off events. [2022-12-13 13:33:30,941 INFO L131 PetriNetUnfolder]: For 6234/6234 co-relation queries the response was YES. [2022-12-13 13:33:30,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4062 conditions, 630 events. 300/630 cut-off events. For 6234/6234 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3263 event pairs, 117 based on Foata normal form. 28/594 useless extension candidates. Maximal degree in co-relation 3585. Up to 483 conditions per place. [2022-12-13 13:33:30,944 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 76 selfloop transitions, 8 changer transitions 11/96 dead transitions. [2022-12-13 13:33:30,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 1458 flow [2022-12-13 13:33:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 13:33:30,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2022-12-13 13:33:30,945 INFO L175 Difference]: Start difference. First operand has 71 places, 95 transitions, 1371 flow. Second operand 5 states and 48 transitions. [2022-12-13 13:33:30,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 1458 flow [2022-12-13 13:33:30,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 1394 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:30,956 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 995 flow [2022-12-13 13:33:30,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=995, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2022-12-13 13:33:30,956 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-13 13:33:30,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:30,956 INFO L89 Accepts]: Start accepts. Operand has 72 places, 72 transitions, 995 flow [2022-12-13 13:33:30,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:30,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:30,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 995 flow [2022-12-13 13:33:30,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 72 transitions, 995 flow [2022-12-13 13:33:30,976 INFO L130 PetriNetUnfolder]: 65/248 cut-off events. [2022-12-13 13:33:30,976 INFO L131 PetriNetUnfolder]: For 1575/1605 co-relation queries the response was YES. [2022-12-13 13:33:30,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 248 events. 65/248 cut-off events. For 1575/1605 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1381 event pairs, 4 based on Foata normal form. 21/238 useless extension candidates. Maximal degree in co-relation 1122. Up to 61 conditions per place. [2022-12-13 13:33:30,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 72 transitions, 995 flow [2022-12-13 13:33:30,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 13:33:30,982 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:30,982 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:30,982 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:30,982 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:30,982 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:30,982 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:31,281 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:31,282 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:31,352 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:33:31,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-13 13:33:31,353 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 997 flow [2022-12-13 13:33:31,353 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-13 13:33:31,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:31,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 13:33:31,353 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-13 13:33:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -98518960, now seen corresponding path program 1 times [2022-12-13 13:33:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:31,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886983799] [2022-12-13 13:33:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:31,657 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-13 13:33:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:31,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886983799] [2022-12-13 13:33:31,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886983799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:31,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:31,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:33:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642601163] [2022-12-13 13:33:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:31,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:33:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:33:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:33:31,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 13:33:31,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 997 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-13 13:33:31,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:31,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 13:33:31,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:31,860 INFO L130 PetriNetUnfolder]: 280/579 cut-off events. [2022-12-13 13:33:31,860 INFO L131 PetriNetUnfolder]: For 4781/4796 co-relation queries the response was YES. [2022-12-13 13:33:31,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 579 events. 280/579 cut-off events. For 4781/4796 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2900 event pairs, 111 based on Foata normal form. 9/522 useless extension candidates. Maximal degree in co-relation 3228. Up to 536 conditions per place. [2022-12-13 13:33:31,863 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 65 selfloop transitions, 2 changer transitions 19/87 dead transitions. [2022-12-13 13:33:31,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 1266 flow [2022-12-13 13:33:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-13 13:33:31,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 13:33:31,864 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 997 flow. Second operand 6 states and 45 transitions. [2022-12-13 13:33:31,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 1266 flow [2022-12-13 13:33:31,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 1145 flow, removed 50 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:31,877 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 825 flow [2022-12-13 13:33:31,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=825, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2022-12-13 13:33:31,877 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 13:33:31,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:31,877 INFO L89 Accepts]: Start accepts. Operand has 70 places, 67 transitions, 825 flow [2022-12-13 13:33:31,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:31,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:31,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 67 transitions, 825 flow [2022-12-13 13:33:31,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 825 flow [2022-12-13 13:33:31,898 INFO L130 PetriNetUnfolder]: 65/231 cut-off events. [2022-12-13 13:33:31,898 INFO L131 PetriNetUnfolder]: For 1000/1030 co-relation queries the response was YES. [2022-12-13 13:33:31,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 231 events. 65/231 cut-off events. For 1000/1030 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1210 event pairs, 4 based on Foata normal form. 21/221 useless extension candidates. Maximal degree in co-relation 1030. Up to 59 conditions per place. [2022-12-13 13:33:31,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 825 flow [2022-12-13 13:33:31,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 13:33:31,900 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:31,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 13:33:31,900 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 825 flow [2022-12-13 13:33:31,901 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-13 13:33:31,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:31,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:31,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 13:33:31,901 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-13 13:33:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash 490887210, now seen corresponding path program 1 times [2022-12-13 13:33:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:31,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771031621] [2022-12-13 13:33:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:32,181 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-13 13:33:32,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:32,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771031621] [2022-12-13 13:33:32,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771031621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:32,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496780606] [2022-12-13 13:33:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:32,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:32,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:32,183 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-13 13:33:32,185 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-13 13:33:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:32,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 13:33:32,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:32,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:32,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-13 13:33:32,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:32,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:32,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 50 [2022-12-13 13:33:32,454 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-13 13:33:32,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:32,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:32,595 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-13 13:33:32,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:32,604 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-13 13:33:32,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:32,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 62 treesize of output 49 [2022-12-13 13:33:32,695 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-13 13:33:32,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496780606] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:32,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:32,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:33:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968681076] [2022-12-13 13:33:32,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:32,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:33:32,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:32,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:33:32,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:33:32,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 13:33:32,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 825 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-13 13:33:32,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:32,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 13:33:32,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:33,046 INFO L130 PetriNetUnfolder]: 269/552 cut-off events. [2022-12-13 13:33:33,046 INFO L131 PetriNetUnfolder]: For 3421/3467 co-relation queries the response was YES. [2022-12-13 13:33:33,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 552 events. 269/552 cut-off events. For 3421/3467 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2695 event pairs, 109 based on Foata normal form. 16/503 useless extension candidates. Maximal degree in co-relation 3055. Up to 508 conditions per place. [2022-12-13 13:33:33,049 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 60 selfloop transitions, 8 changer transitions 17/86 dead transitions. [2022-12-13 13:33:33,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 1068 flow [2022-12-13 13:33:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:33:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:33:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-12-13 13:33:33,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-13 13:33:33,050 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 825 flow. Second operand 9 states and 55 transitions. [2022-12-13 13:33:33,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 1068 flow [2022-12-13 13:33:33,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 1032 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:33,057 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 789 flow [2022-12-13 13:33:33,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=789, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2022-12-13 13:33:33,057 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 13:33:33,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:33,057 INFO L89 Accepts]: Start accepts. Operand has 70 places, 65 transitions, 789 flow [2022-12-13 13:33:33,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:33,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:33,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 65 transitions, 789 flow [2022-12-13 13:33:33,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 789 flow [2022-12-13 13:33:33,075 INFO L130 PetriNetUnfolder]: 64/227 cut-off events. [2022-12-13 13:33:33,075 INFO L131 PetriNetUnfolder]: For 978/1036 co-relation queries the response was YES. [2022-12-13 13:33:33,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 227 events. 64/227 cut-off events. For 978/1036 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1193 event pairs, 4 based on Foata normal form. 27/222 useless extension candidates. Maximal degree in co-relation 997. Up to 58 conditions per place. [2022-12-13 13:33:33,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 65 transitions, 789 flow [2022-12-13 13:33:33,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 13:33:35,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [582] $Ultimate##0-->L108-6: Formula: (let ((.cse3 (store |v_#valid_107| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (select |v_#memory_int_238| 1)) (.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_72|) (<= v_~N~0_124 2147483647) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_49| 0) (= 1 (select |v_#valid_107| 1)) (= |v_#valid_106| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| 1)) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_92| 2147483647) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_93| 2147483647) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| |v_#StackHeapBarrier_53|) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_95| 2147483647) (<= 0 (+ 2147483648 v_~q_front~0_217)) (= (store (store (store |v_#length_102| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_72| 1073741824) 4)) |v_#length_101|) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_95| 2147483648)) (= |v_#NULL.base_18| 0) (= (select |v_#valid_107| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_29| v_~n~0_185) (= v_~s~0_161 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_99|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| (+ 1 |v_ULTIMATE.start_create_fresh_int_array_~size#1_72|)) (= (select |v_#valid_107| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_93| 2147483648)) (<= v_~n~0_185 2147483647) (= 2 (select |v_#length_102| 1)) (= v_~q~0.offset_172 0) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_94| 2147483648)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (= (store |v_#memory_int_238| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (store (store (store (store (select |v_#memory_int_238| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_93|) (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1 (- 12)) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_94|) (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1 (- 8)) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_95|) (+ (- 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_92|))) |v_#memory_int_236|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_54| 0) (= (select .cse2 1) 0) (= (select |v_#valid_107| 0) 0) (<= 0 (+ v_~N~0_124 2147483648)) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= |v_#NULL.offset_18| 0) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_94| 2147483647) (= (select .cse2 0) 48) (= 25 (select |v_#length_102| 2)) (= v_~q_back~0_306 v_~q_front~0_217) (<= v_~q_front~0_217 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_99| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_72| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_53| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4) (= 0 (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|)) (< 0 |v_#StackHeapBarrier_53|) (< |v_#StackHeapBarrier_53| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| 0) (= v_~q~0.base_172 0) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_92| 2147483648))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_238|, #length=|v_#length_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ~q_back~0=v_~q_back~0_306, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_54|, #NULL.offset=|v_#NULL.offset_18|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_91|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_44|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_49|, ~q~0.offset=v_~q~0.offset_172, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_70|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_46|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_57|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_50|, #length=|v_#length_101|, ~q_front~0=v_~q_front~0_217, ~s~0=v_~s~0_161, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_47|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_49|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_44|, ~N~0=v_~N~0_124, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_172, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_72|, #NULL.base=|v_#NULL.base_18|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_44|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_60|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_47|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_57|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_236|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_47|, ~n~0=v_~n~0_185, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_37|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_99|} AuxVars[|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_93|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_92|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_95|, |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_94|] 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, 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~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #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 [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:36,739 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:36,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] L65-2-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_421| v_~q~0.base_291))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_194| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (= (ite (= (select .cse0 (+ v_~q~0.offset_290 (* v_~q_back~0_532 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|) (= (+ v_~s~0_334 |v_thread2Thread1of1ForFork1_~j~0#1_194|) v_~s~0_333) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| (ite (and (< v_~q_front~0_405 v_~q_back~0_532) (< v_~q_front~0_405 v_~n~0_299) (<= 0 v_~q_front~0_405)) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_233| v_~N~0_213)) (= |v_thread1Thread1of1ForFork0_#res#1.base_78| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_78| 0) (= (select .cse0 (+ v_~q~0.offset_290 (* 4 v_~q_front~0_405))) |v_thread2Thread1of1ForFork1_~j~0#1_194|) (= v_~q_back~0_531 (+ v_~q_back~0_532 1)) (= (+ 1 v_~q_front~0_405) v_~q_front~0_404) (not (= (ite (and (< v_~q_back~0_532 v_~n~0_299) (<= 0 v_~q_back~0_532)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176| 0)))) InVars {~q_back~0=v_~q_back~0_532, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_233|, #memory_int=|v_#memory_int_421|, ~N~0=v_~N~0_213, ~q~0.base=v_~q~0.base_291, ~n~0=v_~n~0_299, ~q~0.offset=v_~q~0.offset_290, ~s~0=v_~s~0_334, ~q_front~0=v_~q_front~0_405} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_194|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_78|, ~q_back~0=v_~q_back~0_531, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_96|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_176|, ~N~0=v_~N~0_213, ~q~0.base=v_~q~0.base_291, ~q~0.offset=v_~q~0.offset_290, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_176|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, #memory_int=|v_#memory_int_421|, ~n~0=v_~n~0_299, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_78|, ~s~0=v_~s~0_333, ~q_front~0=v_~q_front~0_404} 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-13 13:33:36,874 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:36,874 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:36,874 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:36,874 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:36,875 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:36,875 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:37,119 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:33:37,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4064 [2022-12-13 13:33:37,121 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 829 flow [2022-12-13 13:33:37,121 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-13 13:33:37,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:37,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:37,125 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-13 13:33:37,321 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,SelfDestructingSolverStorable33 [2022-12-13 13:33:37,322 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-13 13:33:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1068884640, now seen corresponding path program 1 times [2022-12-13 13:33:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:37,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833546188] [2022-12-13 13:33:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:37,604 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-13 13:33:37,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:37,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833546188] [2022-12-13 13:33:37,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833546188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:37,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964135788] [2022-12-13 13:33:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:37,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:37,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:37,606 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-13 13:33:37,609 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-13 13:33:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:37,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 13:33:37,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:37,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:37,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:37,716 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-13 13:33:37,720 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-13 13:33:37,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:37,746 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-13 13:33:37,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:37,820 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-13 13:33:37,842 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-13 13:33:37,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:37,980 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-13 13:33:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964135788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:37,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:37,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-13 13:33:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323144939] [2022-12-13 13:33:37,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:37,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:33:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:33:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:33:37,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 13:33:37,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 829 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-13 13:33:37,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:37,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 13:33:37,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:38,344 INFO L130 PetriNetUnfolder]: 259/524 cut-off events. [2022-12-13 13:33:38,344 INFO L131 PetriNetUnfolder]: For 3075/3118 co-relation queries the response was YES. [2022-12-13 13:33:38,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 524 events. 259/524 cut-off events. For 3075/3118 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2497 event pairs, 103 based on Foata normal form. 20/476 useless extension candidates. Maximal degree in co-relation 2910. Up to 488 conditions per place. [2022-12-13 13:33:38,347 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 56 selfloop transitions, 7 changer transitions 23/87 dead transitions. [2022-12-13 13:33:38,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 1112 flow [2022-12-13 13:33:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:33:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:33:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-12-13 13:33:38,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-13 13:33:38,348 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 829 flow. Second operand 8 states and 56 transitions. [2022-12-13 13:33:38,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 1112 flow [2022-12-13 13:33:38,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 1027 flow, removed 33 selfloop flow, removed 8 redundant places. [2022-12-13 13:33:38,355 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 735 flow [2022-12-13 13:33:38,355 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=735, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2022-12-13 13:33:38,355 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 13:33:38,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:38,355 INFO L89 Accepts]: Start accepts. Operand has 70 places, 64 transitions, 735 flow [2022-12-13 13:33:38,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:38,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:38,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 64 transitions, 735 flow [2022-12-13 13:33:38,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 64 transitions, 735 flow [2022-12-13 13:33:38,411 INFO L130 PetriNetUnfolder]: 65/209 cut-off events. [2022-12-13 13:33:38,412 INFO L131 PetriNetUnfolder]: For 824/882 co-relation queries the response was YES. [2022-12-13 13:33:38,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 209 events. 65/209 cut-off events. For 824/882 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1042 event pairs, 4 based on Foata normal form. 27/204 useless extension candidates. Maximal degree in co-relation 909. Up to 57 conditions per place. [2022-12-13 13:33:38,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 64 transitions, 735 flow [2022-12-13 13:33:38,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 13:33:40,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:40,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2076 [2022-12-13 13:33:40,431 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 745 flow [2022-12-13 13:33:40,431 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-13 13:33:40,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:40,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:40,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:40,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:40,632 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-13 13:33:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 360371138, now seen corresponding path program 1 times [2022-12-13 13:33:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:40,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730725467] [2022-12-13 13:33:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:41,440 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-13 13:33:41,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730725467] [2022-12-13 13:33:41,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730725467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715746179] [2022-12-13 13:33:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:41,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:41,443 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-13 13:33:41,445 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-13 13:33:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:41,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 13:33:41,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:41,623 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-13 13:33:41,647 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-13 13:33:41,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:41,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:41,687 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-13 13:33:41,703 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-13 13:33:41,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715746179] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:41,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:41,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-13 13:33:41,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948222497] [2022-12-13 13:33:41,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:41,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:33:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:33:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:33:41,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 13:33:41,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 745 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-13 13:33:41,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:41,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 13:33:41,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:42,081 INFO L130 PetriNetUnfolder]: 305/602 cut-off events. [2022-12-13 13:33:42,082 INFO L131 PetriNetUnfolder]: For 2968/2994 co-relation queries the response was YES. [2022-12-13 13:33:42,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 602 events. 305/602 cut-off events. For 2968/2994 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2959 event pairs, 41 based on Foata normal form. 29/558 useless extension candidates. Maximal degree in co-relation 3201. Up to 406 conditions per place. [2022-12-13 13:33:42,084 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 66 selfloop transitions, 30 changer transitions 34/131 dead transitions. [2022-12-13 13:33:42,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 131 transitions, 1418 flow [2022-12-13 13:33:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:33:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:33:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 102 transitions. [2022-12-13 13:33:42,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3469387755102041 [2022-12-13 13:33:42,093 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 745 flow. Second operand 14 states and 102 transitions. [2022-12-13 13:33:42,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 131 transitions, 1418 flow [2022-12-13 13:33:42,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 1299 flow, removed 45 selfloop flow, removed 10 redundant places. [2022-12-13 13:33:42,102 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 920 flow [2022-12-13 13:33:42,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=920, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2022-12-13 13:33:42,102 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-13 13:33:42,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:42,103 INFO L89 Accepts]: Start accepts. Operand has 67 places, 78 transitions, 920 flow [2022-12-13 13:33:42,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:42,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:42,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 78 transitions, 920 flow [2022-12-13 13:33:42,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 78 transitions, 920 flow [2022-12-13 13:33:42,128 INFO L130 PetriNetUnfolder]: 70/236 cut-off events. [2022-12-13 13:33:42,129 INFO L131 PetriNetUnfolder]: For 1055/1105 co-relation queries the response was YES. [2022-12-13 13:33:42,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 236 events. 70/236 cut-off events. For 1055/1105 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1271 event pairs, 0 based on Foata normal form. 23/226 useless extension candidates. Maximal degree in co-relation 960. Up to 48 conditions per place. [2022-12-13 13:33:42,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 78 transitions, 920 flow [2022-12-13 13:33:42,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 13:33:42,142 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,142 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,142 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,142 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [597] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (+ 1 v_~q_front~0_266)) (.cse0 (select |v_#memory_int_273| v_~q~0.base_197))) (and (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_197 (* v_~q_back~0_349 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_128|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| (ite (and (< .cse1 v_~q_back~0_349) (<= 0 v_~q_front~0_266) (< v_~q_front~0_266 v_~n~0_207)) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_132| (+ v_~N~0_142 1)) (= v_~q_back~0_349 (+ 2 v_~q_back~0_351)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128| 0)) (= .cse1 v_~q_front~0_265) (= (select .cse0 (+ (* 4 v_~q_front~0_266) v_~q~0.offset_197)) |v_thread2Thread1of1ForFork1_~j~0#1_117|) (= (+ v_~s~0_212 |v_thread2Thread1of1ForFork1_~j~0#1_117|) v_~s~0_211) (= |v_thread1Thread1of1ForFork0_~i~0#1_132| 2) (not (= 0 (ite (= (select .cse0 (+ (* v_~q_back~0_351 4) v_~q~0.offset_197)) 1) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_128| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|) (not (= (ite (and (< v_~q_back~0_349 (+ v_~n~0_207 1)) (<= 1 v_~q_back~0_349)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_117| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|))) InVars {~q_back~0=v_~q_back~0_351, #memory_int=|v_#memory_int_273|, ~N~0=v_~N~0_142, ~q~0.base=v_~q~0.base_197, ~n~0=v_~n~0_207, ~q~0.offset=v_~q~0.offset_197, ~s~0=v_~s~0_212, ~q_front~0=v_~q_front~0_266} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_117|, ~q_back~0=v_~q_back~0_349, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_86|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_104|, ~N~0=v_~N~0_142, ~q~0.base=v_~q~0.base_197, ~q~0.offset=v_~q~0.offset_197, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_104|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_128|, 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_132|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_207, ~s~0=v_~s~0_211, ~q_front~0=v_~q_front~0_265} 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-13 13:33:42,685 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-13 13:33:42,869 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,869 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,869 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,870 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:42,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:43,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:43,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_443| v_~q~0.base_305))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_234|) (= |v_thread1Thread1of1ForFork0_~i~0#1_249| 1) (= |v_thread1Thread1of1ForFork0_#res#1.offset_86| 0) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_562 4) v_~q~0.offset_304)) 1) 1 0) 0)) (= v_~q_back~0_560 (+ 2 v_~q_back~0_562)) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_304 (* v_~q_back~0_560 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_249| v_~N~0_225)) (not (= (ite (and (<= 1 v_~q_back~0_560) (< v_~q_back~0_560 (+ v_~n~0_311 1))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_562) (< v_~q_back~0_562 v_~n~0_311)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_234| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_86| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_249| (+ v_~N~0_225 1)))) InVars {~q_back~0=v_~q_back~0_562, #memory_int=|v_#memory_int_443|, ~N~0=v_~N~0_225, ~q~0.base=v_~q~0.base_305, ~n~0=v_~n~0_311, ~q~0.offset=v_~q~0.offset_304} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_86|, ~q_back~0=v_~q_back~0_560, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_104|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_154|, ~N~0=v_~N~0_225, ~q~0.base=v_~q~0.base_305, ~q~0.offset=v_~q~0.offset_304, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_158|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_154|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_249|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_104|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_234|, #memory_int=|v_#memory_int_443|, ~n~0=v_~n~0_311, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_86|} 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-13 13:33:43,285 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:33:43,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1182 [2022-12-13 13:33:43,285 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 75 transitions, 947 flow [2022-12-13 13:33:43,285 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-13 13:33:43,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:43,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:43,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:43,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:43,490 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-13 13:33:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1959533054, now seen corresponding path program 1 times [2022-12-13 13:33:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:43,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107612946] [2022-12-13 13:33:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:43,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-13 13:33:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:43,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107612946] [2022-12-13 13:33:43,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107612946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:43,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:43,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154355095] [2022-12-13 13:33:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:43,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:33:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:33:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:33:43,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 13:33:43,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 75 transitions, 947 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-13 13:33:43,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:43,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 13:33:43,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:43,937 INFO L130 PetriNetUnfolder]: 274/529 cut-off events. [2022-12-13 13:33:43,937 INFO L131 PetriNetUnfolder]: For 3301/3328 co-relation queries the response was YES. [2022-12-13 13:33:43,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 529 events. 274/529 cut-off events. For 3301/3328 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2441 event pairs, 53 based on Foata normal form. 28/481 useless extension candidates. Maximal degree in co-relation 2768. Up to 489 conditions per place. [2022-12-13 13:33:43,940 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 68 selfloop transitions, 12 changer transitions 9/90 dead transitions. [2022-12-13 13:33:43,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 1229 flow [2022-12-13 13:33:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:33:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:33:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-13 13:33:43,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-13 13:33:43,940 INFO L175 Difference]: Start difference. First operand has 60 places, 75 transitions, 947 flow. Second operand 5 states and 47 transitions. [2022-12-13 13:33:43,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 1229 flow [2022-12-13 13:33:43,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 1139 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:43,947 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 902 flow [2022-12-13 13:33:43,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=902, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2022-12-13 13:33:43,947 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 40 predicate places. [2022-12-13 13:33:43,948 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:43,948 INFO L89 Accepts]: Start accepts. Operand has 61 places, 76 transitions, 902 flow [2022-12-13 13:33:43,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:43,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:43,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 76 transitions, 902 flow [2022-12-13 13:33:43,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 76 transitions, 902 flow [2022-12-13 13:33:43,965 INFO L130 PetriNetUnfolder]: 74/225 cut-off events. [2022-12-13 13:33:43,965 INFO L131 PetriNetUnfolder]: For 1052/1101 co-relation queries the response was YES. [2022-12-13 13:33:43,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 225 events. 74/225 cut-off events. For 1052/1101 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1110 event pairs, 0 based on Foata normal form. 37/228 useless extension candidates. Maximal degree in co-relation 880. Up to 55 conditions per place. [2022-12-13 13:33:43,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 76 transitions, 902 flow [2022-12-13 13:33:43,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 13:33:43,967 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:43,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 13:33:43,967 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 76 transitions, 902 flow [2022-12-13 13:33:43,967 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-13 13:33:43,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:43,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:43,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 13:33:43,968 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-13 13:33:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 188873695, now seen corresponding path program 1 times [2022-12-13 13:33:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:43,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641083899] [2022-12-13 13:33:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:44,217 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-13 13:33:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641083899] [2022-12-13 13:33:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641083899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:44,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:33:44,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:33:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906322804] [2022-12-13 13:33:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:44,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:44,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:33:44,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 13:33:44,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 76 transitions, 902 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-13 13:33:44,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:44,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 13:33:44,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:44,415 INFO L130 PetriNetUnfolder]: 301/601 cut-off events. [2022-12-13 13:33:44,415 INFO L131 PetriNetUnfolder]: For 3419/3446 co-relation queries the response was YES. [2022-12-13 13:33:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 601 events. 301/601 cut-off events. For 3419/3446 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 37 based on Foata normal form. 39/556 useless extension candidates. Maximal degree in co-relation 2871. Up to 371 conditions per place. [2022-12-13 13:33:44,418 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 74 selfloop transitions, 33 changer transitions 0/108 dead transitions. [2022-12-13 13:33:44,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 1337 flow [2022-12-13 13:33:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:33:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:33:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-13 13:33:44,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2022-12-13 13:33:44,420 INFO L175 Difference]: Start difference. First operand has 59 places, 76 transitions, 902 flow. Second operand 7 states and 65 transitions. [2022-12-13 13:33:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 1337 flow [2022-12-13 13:33:44,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 1273 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:44,427 INFO L231 Difference]: Finished difference. Result has 65 places, 84 transitions, 1084 flow [2022-12-13 13:33:44,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1084, PETRI_PLACES=65, PETRI_TRANSITIONS=84} [2022-12-13 13:33:44,427 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-13 13:33:44,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:44,427 INFO L89 Accepts]: Start accepts. Operand has 65 places, 84 transitions, 1084 flow [2022-12-13 13:33:44,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:44,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:44,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 84 transitions, 1084 flow [2022-12-13 13:33:44,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 84 transitions, 1084 flow [2022-12-13 13:33:44,453 INFO L130 PetriNetUnfolder]: 78/267 cut-off events. [2022-12-13 13:33:44,453 INFO L131 PetriNetUnfolder]: For 1431/1490 co-relation queries the response was YES. [2022-12-13 13:33:44,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 267 events. 78/267 cut-off events. For 1431/1490 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1477 event pairs, 0 based on Foata normal form. 43/272 useless extension candidates. Maximal degree in co-relation 970. Up to 55 conditions per place. [2022-12-13 13:33:44,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 84 transitions, 1084 flow [2022-12-13 13:33:44,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 13:33:44,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:44,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:33:44,775 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:33:44,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-13 13:33:44,775 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 84 transitions, 1100 flow [2022-12-13 13:33:44,775 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-13 13:33:44,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:44,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:44,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 13:33:44,776 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-13 13:33:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1947058974, now seen corresponding path program 1 times [2022-12-13 13:33:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:44,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365868774] [2022-12-13 13:33:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:45,092 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-13 13:33:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:45,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365868774] [2022-12-13 13:33:45,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365868774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:45,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111052172] [2022-12-13 13:33:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:45,094 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-13 13:33:45,096 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-13 13:33:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:45,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 13:33:45,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:45,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:45,249 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-13 13:33:45,287 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-13 13:33:45,304 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-13 13:33:45,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:45,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:45,374 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-13 13:33:45,378 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-13 13:33:45,380 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-13 13:33:45,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-13 13:33:45,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111052172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:45,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:45,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 13:33:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791878217] [2022-12-13 13:33:45,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:45,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:33:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:33:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:33:45,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-13 13:33:45,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 84 transitions, 1100 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-13 13:33:45,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:45,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-13 13:33:45,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:45,733 INFO L130 PetriNetUnfolder]: 296/576 cut-off events. [2022-12-13 13:33:45,734 INFO L131 PetriNetUnfolder]: For 4335/4374 co-relation queries the response was YES. [2022-12-13 13:33:45,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3068 conditions, 576 events. 296/576 cut-off events. For 4335/4374 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2766 event pairs, 41 based on Foata normal form. 46/544 useless extension candidates. Maximal degree in co-relation 2843. Up to 496 conditions per place. [2022-12-13 13:33:45,737 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 66 selfloop transitions, 16 changer transitions 16/99 dead transitions. [2022-12-13 13:33:45,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 1315 flow [2022-12-13 13:33:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-13 13:33:45,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 13:33:45,738 INFO L175 Difference]: Start difference. First operand has 65 places, 84 transitions, 1100 flow. Second operand 6 states and 58 transitions. [2022-12-13 13:33:45,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 1315 flow [2022-12-13 13:33:45,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 1273 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:45,745 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 945 flow [2022-12-13 13:33:45,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2022-12-13 13:33:45,745 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-13 13:33:45,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:45,746 INFO L89 Accepts]: Start accepts. Operand has 67 places, 77 transitions, 945 flow [2022-12-13 13:33:45,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:45,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:45,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 77 transitions, 945 flow [2022-12-13 13:33:45,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 77 transitions, 945 flow [2022-12-13 13:33:45,763 INFO L130 PetriNetUnfolder]: 74/229 cut-off events. [2022-12-13 13:33:45,764 INFO L131 PetriNetUnfolder]: For 1277/1327 co-relation queries the response was YES. [2022-12-13 13:33:45,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 229 events. 74/229 cut-off events. For 1277/1327 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1150 event pairs, 0 based on Foata normal form. 41/233 useless extension candidates. Maximal degree in co-relation 951. Up to 55 conditions per place. [2022-12-13 13:33:45,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 77 transitions, 945 flow [2022-12-13 13:33:45,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 13:33:45,765 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:45,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 13:33:45,766 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 77 transitions, 945 flow [2022-12-13 13:33:45,766 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-13 13:33:45,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:45,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:45,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:45,971 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,SelfDestructingSolverStorable38 [2022-12-13 13:33:45,972 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-13 13:33:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1659250300, now seen corresponding path program 1 times [2022-12-13 13:33:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:45,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785537065] [2022-12-13 13:33:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:46,452 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-13 13:33:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:46,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785537065] [2022-12-13 13:33:46,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785537065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:46,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655423008] [2022-12-13 13:33:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:46,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:46,454 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-13 13:33:46,456 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-13 13:33:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:46,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 13:33:46,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:46,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:46,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-13 13:33:46,621 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-13 13:33:46,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:33:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655423008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:33:46,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:33:46,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-13 13:33:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47754484] [2022-12-13 13:33:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:33:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:33:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:33:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:33:46,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 13:33:46,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 77 transitions, 945 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-13 13:33:46,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:46,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 13:33:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:46,738 INFO L130 PetriNetUnfolder]: 307/577 cut-off events. [2022-12-13 13:33:46,738 INFO L131 PetriNetUnfolder]: For 4187/4218 co-relation queries the response was YES. [2022-12-13 13:33:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3028 conditions, 577 events. 307/577 cut-off events. For 4187/4218 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2611 event pairs, 36 based on Foata normal form. 59/548 useless extension candidates. Maximal degree in co-relation 2962. Up to 366 conditions per place. [2022-12-13 13:33:46,742 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 64 selfloop transitions, 31 changer transitions 0/96 dead transitions. [2022-12-13 13:33:46,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 1288 flow [2022-12-13 13:33:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:33:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:33:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 13:33:46,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-13 13:33:46,743 INFO L175 Difference]: Start difference. First operand has 65 places, 77 transitions, 945 flow. Second operand 4 states and 41 transitions. [2022-12-13 13:33:46,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 1288 flow [2022-12-13 13:33:46,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 1244 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:46,750 INFO L231 Difference]: Finished difference. Result has 65 places, 84 transitions, 1116 flow [2022-12-13 13:33:46,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1116, PETRI_PLACES=65, PETRI_TRANSITIONS=84} [2022-12-13 13:33:46,751 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-13 13:33:46,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:46,751 INFO L89 Accepts]: Start accepts. Operand has 65 places, 84 transitions, 1116 flow [2022-12-13 13:33:46,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:46,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:46,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 84 transitions, 1116 flow [2022-12-13 13:33:46,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 84 transitions, 1116 flow [2022-12-13 13:33:46,770 INFO L130 PetriNetUnfolder]: 81/242 cut-off events. [2022-12-13 13:33:46,770 INFO L131 PetriNetUnfolder]: For 1645/1693 co-relation queries the response was YES. [2022-12-13 13:33:46,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 242 events. 81/242 cut-off events. For 1645/1693 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1201 event pairs, 0 based on Foata normal form. 40/243 useless extension candidates. Maximal degree in co-relation 875. Up to 61 conditions per place. [2022-12-13 13:33:46,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 84 transitions, 1116 flow [2022-12-13 13:33:46,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 13:33:46,773 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:46,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 13:33:46,773 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 84 transitions, 1116 flow [2022-12-13 13:33:46,773 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-13 13:33:46,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:46,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:46,778 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-13 13:33:46,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 13:33:46,974 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-13 13:33:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash 158576708, now seen corresponding path program 1 times [2022-12-13 13:33:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:46,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571983803] [2022-12-13 13:33:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:47,368 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-13 13:33:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571983803] [2022-12-13 13:33:47,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571983803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290541590] [2022-12-13 13:33:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:47,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:47,370 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-13 13:33:47,370 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-13 13:33:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:47,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 13:33:47,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:47,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:47,519 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-13 13:33:47,547 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-13 13:33:47,588 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-13 13:33:47,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:47,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:47,689 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-13 13:33:47,692 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-13 13:33:47,695 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-13 13:33:47,734 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-13 13:33:47,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290541590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:47,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:47,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:33:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889444134] [2022-12-13 13:33:47,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:47,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:33:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:33:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2022-12-13 13:33:47,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 13:33:47,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 84 transitions, 1116 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-13 13:33:47,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:47,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 13:33:47,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:48,062 INFO L130 PetriNetUnfolder]: 316/600 cut-off events. [2022-12-13 13:33:48,063 INFO L131 PetriNetUnfolder]: For 4812/4847 co-relation queries the response was YES. [2022-12-13 13:33:48,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 600 events. 316/600 cut-off events. For 4812/4847 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2817 event pairs, 52 based on Foata normal form. 36/548 useless extension candidates. Maximal degree in co-relation 2588. Up to 530 conditions per place. [2022-12-13 13:33:48,066 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 73 selfloop transitions, 19 changer transitions 7/100 dead transitions. [2022-12-13 13:33:48,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 1411 flow [2022-12-13 13:33:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:33:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:33:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-13 13:33:48,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3028571428571429 [2022-12-13 13:33:48,072 INFO L175 Difference]: Start difference. First operand has 65 places, 84 transitions, 1116 flow. Second operand 7 states and 53 transitions. [2022-12-13 13:33:48,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 1411 flow [2022-12-13 13:33:48,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 1372 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:33:48,080 INFO L231 Difference]: Finished difference. Result has 71 places, 85 transitions, 1144 flow [2022-12-13 13:33:48,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1144, PETRI_PLACES=71, PETRI_TRANSITIONS=85} [2022-12-13 13:33:48,080 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-13 13:33:48,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:48,081 INFO L89 Accepts]: Start accepts. Operand has 71 places, 85 transitions, 1144 flow [2022-12-13 13:33:48,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:48,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:48,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 85 transitions, 1144 flow [2022-12-13 13:33:48,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 1144 flow [2022-12-13 13:33:48,100 INFO L130 PetriNetUnfolder]: 81/243 cut-off events. [2022-12-13 13:33:48,100 INFO L131 PetriNetUnfolder]: For 1730/1777 co-relation queries the response was YES. [2022-12-13 13:33:48,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 243 events. 81/243 cut-off events. For 1730/1777 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1226 event pairs, 0 based on Foata normal form. 40/244 useless extension candidates. Maximal degree in co-relation 1063. Up to 61 conditions per place. [2022-12-13 13:33:48,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 85 transitions, 1144 flow [2022-12-13 13:33:48,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 13:33:48,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (+ v_~n~0_307 1)) (.cse1 (select |v_#memory_int_437| v_~q~0.base_301))) (and (not (= (ite (and (< v_~q_back~0_552 .cse0) (<= 1 v_~q_back~0_552)) 1 0) 0)) (not (= (+ v_~s~0_359 |v_thread2Thread1of1ForFork1_~j~0#1_210|) v_~s~0_357)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_230| (ite (= (select .cse1 (+ (* v_~q_back~0_552 4) (- 4) v_~q~0.offset_300)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_245| (+ v_~N~0_221 1)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_210| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_230| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|) (= (+ 2 v_~q_back~0_553) v_~q_back~0_552) (= (select .cse1 (+ (- 4) (* 4 v_~q_front~0_424) v_~q~0.offset_300)) |v_thread2Thread1of1ForFork1_~j~0#1_210|) (= |v_thread1Thread1of1ForFork0_~i~0#1_245| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_190| (ite (and (< v_~q_front~0_424 .cse0) (< v_~q_front~0_424 (+ v_~q_back~0_552 1)) (<= 1 v_~q_front~0_424)) 1 0)) (= (+ 2 v_~q_front~0_426) v_~q_front~0_424) (= (+ (select .cse1 (+ v_~q~0.offset_300 (* 4 v_~q_front~0_426))) v_~s~0_359 |v_thread2Thread1of1ForFork1_~j~0#1_210|) v_~s~0_357) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_300 (* v_~q_back~0_553 4))) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_426) (< (+ 1 v_~q_front~0_426) v_~q_back~0_552) (< v_~q_front~0_426 v_~n~0_307)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_190| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|))) InVars {~q_back~0=v_~q_back~0_553, #memory_int=|v_#memory_int_437|, ~N~0=v_~N~0_221, ~q~0.base=v_~q~0.base_301, ~n~0=v_~n~0_307, ~q~0.offset=v_~q~0.offset_300, ~s~0=v_~s~0_359, ~q_front~0=v_~q_front~0_426} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_210|, ~q_back~0=v_~q_back~0_552, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_190|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_190|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_150|, ~N~0=v_~N~0_221, ~q~0.base=v_~q~0.base_301, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_190|, ~q~0.offset=v_~q~0.offset_300, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_230|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_154|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_150|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_245|, #memory_int=|v_#memory_int_437|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|, ~n~0=v_~n~0_307, ~s~0=v_~s~0_357, ~q_front~0=v_~q_front~0_424} 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-13 13:33:48,106 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,106 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,107 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,107 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,107 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,108 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_263| v_~q~0.base_187))) (and (= (+ 1 v_~q_front~0_246) v_~q_front~0_245) (= (+ v_~q_back~0_330 1) v_~q_back~0_329) (= (ite (and (< v_~q_front~0_246 v_~q_back~0_329) (<= 0 v_~q_front~0_246) (< v_~q_front~0_246 v_~n~0_197)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_246) v_~q~0.offset_187)) |v_thread2Thread1of1ForFork1_~j~0#1_107|) (not (= (ite (and (<= 0 v_~q_back~0_330) (< v_~q_back~0_330 v_~n~0_197)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_107| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 1) (= (+ v_~s~0_192 |v_thread2Thread1of1ForFork1_~j~0#1_107|) v_~s~0_191) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_132 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (= (select .cse0 (+ v_~q~0.offset_187 (* v_~q_back~0_330 4))) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0)))) InVars {~q_back~0=v_~q_back~0_330, #memory_int=|v_#memory_int_263|, ~N~0=v_~N~0_132, ~q~0.base=v_~q~0.base_187, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_187, ~s~0=v_~s~0_192, ~q_front~0=v_~q_front~0_246} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_107|, ~q_back~0=v_~q_back~0_329, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_94|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_80|, ~N~0=v_~N~0_132, ~q~0.base=v_~q~0.base_187, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_94|, ~q~0.offset=v_~q~0.offset_187, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_84|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_80|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, #memory_int=|v_#memory_int_263|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, ~n~0=v_~n~0_197, ~s~0=v_~s~0_191, ~q_front~0=v_~q_front~0_245} 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-13 13:33:48,433 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,433 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,433 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,433 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,433 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,433 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:48,646 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-13 13:33:48,738 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-13 13:33:48,832 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:33:48,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 751 [2022-12-13 13:33:48,832 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 1133 flow [2022-12-13 13:33:48,832 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-13 13:33:48,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:48,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:48,838 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-13 13:33:49,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:49,033 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-13 13:33:49,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1802224922, now seen corresponding path program 1 times [2022-12-13 13:33:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:49,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410042163] [2022-12-13 13:33:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:49,470 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-13 13:33:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:49,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410042163] [2022-12-13 13:33:49,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410042163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:49,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057607506] [2022-12-13 13:33:49,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:49,472 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-13 13:33:49,476 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-13 13:33:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:49,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 13:33:49,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:33:49,615 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-13 13:33:49,643 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-13 13:33:49,668 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-13 13:33:49,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:49,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:49,694 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-13 13:33:49,696 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 41 [2022-12-13 13:33:49,749 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-13 13:33:49,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057607506] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:49,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:49,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 13:33:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893720957] [2022-12-13 13:33:49,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:49,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:33:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:49,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:33:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:33:49,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 13:33:49,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 1133 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-13 13:33:49,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:49,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 13:33:49,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:50,067 INFO L130 PetriNetUnfolder]: 314/592 cut-off events. [2022-12-13 13:33:50,067 INFO L131 PetriNetUnfolder]: For 5394/5427 co-relation queries the response was YES. [2022-12-13 13:33:50,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 592 events. 314/592 cut-off events. For 5394/5427 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2728 event pairs, 58 based on Foata normal form. 34/538 useless extension candidates. Maximal degree in co-relation 3163. Up to 544 conditions per place. [2022-12-13 13:33:50,071 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 73 selfloop transitions, 13 changer transitions 12/99 dead transitions. [2022-12-13 13:33:50,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 1401 flow [2022-12-13 13:33:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-13 13:33:50,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2022-12-13 13:33:50,072 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 1133 flow. Second operand 6 states and 53 transitions. [2022-12-13 13:33:50,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 1401 flow [2022-12-13 13:33:50,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 1315 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-12-13 13:33:50,080 INFO L231 Difference]: Finished difference. Result has 68 places, 81 transitions, 1061 flow [2022-12-13 13:33:50,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1061, PETRI_PLACES=68, PETRI_TRANSITIONS=81} [2022-12-13 13:33:50,081 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-13 13:33:50,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:50,081 INFO L89 Accepts]: Start accepts. Operand has 68 places, 81 transitions, 1061 flow [2022-12-13 13:33:50,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:50,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:50,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 81 transitions, 1061 flow [2022-12-13 13:33:50,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 81 transitions, 1061 flow [2022-12-13 13:33:50,100 INFO L130 PetriNetUnfolder]: 82/237 cut-off events. [2022-12-13 13:33:50,101 INFO L131 PetriNetUnfolder]: For 1731/1803 co-relation queries the response was YES. [2022-12-13 13:33:50,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 237 events. 82/237 cut-off events. For 1731/1803 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1148 event pairs, 0 based on Foata normal form. 55/251 useless extension candidates. Maximal degree in co-relation 1038. Up to 65 conditions per place. [2022-12-13 13:33:50,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 81 transitions, 1061 flow [2022-12-13 13:33:50,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-13 13:33:50,103 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:50,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 13:33:50,103 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 81 transitions, 1061 flow [2022-12-13 13:33:50,104 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-13 13:33:50,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:50,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:50,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:50,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:50,311 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-13 13:33:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1607693332, now seen corresponding path program 1 times [2022-12-13 13:33:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:50,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459781408] [2022-12-13 13:33:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:50,551 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-13 13:33:50,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:50,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459781408] [2022-12-13 13:33:50,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459781408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:50,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838198896] [2022-12-13 13:33:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:50,553 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-13 13:33:50,556 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-13 13:33:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:50,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:33:50,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:50,758 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-13 13:33:50,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:50,794 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 13:33:50,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 27 treesize of output 16 [2022-12-13 13:33:50,840 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-13 13:33:50,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838198896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:50,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:50,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-13 13:33:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69796069] [2022-12-13 13:33:50,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:50,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:33:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:33:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:33:50,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 13:33:50,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 81 transitions, 1061 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-13 13:33:50,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:50,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 13:33:50,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:51,184 INFO L130 PetriNetUnfolder]: 429/815 cut-off events. [2022-12-13 13:33:51,184 INFO L131 PetriNetUnfolder]: For 6021/6068 co-relation queries the response was YES. [2022-12-13 13:33:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 815 events. 429/815 cut-off events. For 6021/6068 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4186 event pairs, 77 based on Foata normal form. 71/760 useless extension candidates. Maximal degree in co-relation 4227. Up to 431 conditions per place. [2022-12-13 13:33:51,188 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 118 selfloop transitions, 30 changer transitions 0/149 dead transitions. [2022-12-13 13:33:51,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 149 transitions, 1835 flow [2022-12-13 13:33:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:33:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:33:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-12-13 13:33:51,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-13 13:33:51,200 INFO L175 Difference]: Start difference. First operand has 66 places, 81 transitions, 1061 flow. Second operand 10 states and 87 transitions. [2022-12-13 13:33:51,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 149 transitions, 1835 flow [2022-12-13 13:33:51,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 149 transitions, 1797 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:51,211 INFO L231 Difference]: Finished difference. Result has 74 places, 95 transitions, 1302 flow [2022-12-13 13:33:51,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1302, PETRI_PLACES=74, PETRI_TRANSITIONS=95} [2022-12-13 13:33:51,211 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2022-12-13 13:33:51,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:51,212 INFO L89 Accepts]: Start accepts. Operand has 74 places, 95 transitions, 1302 flow [2022-12-13 13:33:51,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:51,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:51,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 95 transitions, 1302 flow [2022-12-13 13:33:51,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 95 transitions, 1302 flow [2022-12-13 13:33:51,238 INFO L130 PetriNetUnfolder]: 112/334 cut-off events. [2022-12-13 13:33:51,239 INFO L131 PetriNetUnfolder]: For 2267/2338 co-relation queries the response was YES. [2022-12-13 13:33:51,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 334 events. 112/334 cut-off events. For 2267/2338 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1915 event pairs, 0 based on Foata normal form. 54/346 useless extension candidates. Maximal degree in co-relation 1437. Up to 94 conditions per place. [2022-12-13 13:33:51,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 95 transitions, 1302 flow [2022-12-13 13:33:51,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-13 13:33:51,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [639] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_435| v_~q~0.base_299)) (.cse1 (* v_~q_back~0_548 4))) (and (= v_~q_back~0_546 (+ 3 v_~q_back~0_548)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_298 .cse1)) 1) 1 0) 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_421) v_~q~0.offset_298)) |v_thread2Thread1of1ForFork1_~j~0#1_208|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_548))) (and (< .cse2 v_~n~0_305) (<= 0 .cse2))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_188| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226|) (= |v_thread1Thread1of1ForFork0_~i~0#1_241| 3) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_298 .cse1 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226| 0)) (= (+ v_~s~0_354 |v_thread2Thread1of1ForFork1_~j~0#1_208|) v_~s~0_353) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_188| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_188|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_188| (ite (and (< v_~q_front~0_421 (+ v_~q_back~0_548 1)) (<= 0 v_~q_front~0_421) (< v_~q_front~0_421 v_~n~0_305)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226| (ite (= (select .cse0 (+ 8 v_~q~0.offset_298 .cse1)) 1) 1 0)) (< 2 v_~N~0_219) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_208| 0)) (= (+ 1 v_~q_front~0_421) v_~q_front~0_420))) InVars {~q_back~0=v_~q_back~0_548, #memory_int=|v_#memory_int_435|, ~N~0=v_~N~0_219, ~q~0.base=v_~q~0.base_299, ~n~0=v_~n~0_305, ~q~0.offset=v_~q~0.offset_298, ~s~0=v_~s~0_354, ~q_front~0=v_~q_front~0_421} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_208|, ~q_back~0=v_~q_back~0_546, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_188|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_146|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_188|, ~N~0=v_~N~0_219, ~q~0.base=v_~q~0.base_299, ~q~0.offset=v_~q~0.offset_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_188|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_188|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_150|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_146|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_241|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_226|, #memory_int=|v_#memory_int_435|, ~n~0=v_~n~0_305, ~s~0=v_~s~0_353, ~q_front~0=v_~q_front~0_420} 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-13 13:33:51,597 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:51,597 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:51,597 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:51,597 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:52,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [659] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_485| v_~q~0.base_332)) (.cse1 (* v_~q_back~0_634 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_331 4)) 1) 1 0) 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_479) v_~q~0.offset_331)) |v_thread2Thread1of1ForFork1_~j~0#1_249|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|) (= (+ v_~s~0_413 |v_thread2Thread1of1ForFork1_~j~0#1_249|) v_~s~0_412) (= (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_632 4) v_~q~0.offset_331)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_281|) (< 2 v_~N~0_251) (= |v_thread1Thread1of1ForFork0_#res#1.offset_104| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_297| 3) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_331)) 1) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_297| v_~N~0_251)) (= (+ 1 v_~q_front~0_479) v_~q_front~0_478) (not (= (ite (= 1 (select .cse0 (+ .cse1 8 v_~q~0.offset_331))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225| 0)) (not (= (ite (and (<= 1 v_~q_back~0_632) (< v_~q_back~0_632 (+ v_~n~0_337 1))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_104| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_281| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|) (= v_~q_back~0_632 (+ v_~q_back~0_634 4)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_249| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| (ite (and (< v_~q_front~0_479 (+ v_~q_back~0_634 1)) (< v_~q_front~0_479 v_~n~0_337) (<= 0 v_~q_front~0_479)) 1 0)))) InVars {~q_back~0=v_~q_back~0_634, #memory_int=|v_#memory_int_485|, ~N~0=v_~N~0_251, ~q~0.base=v_~q~0.base_332, ~n~0=v_~n~0_337, ~q~0.offset=v_~q~0.offset_331, ~s~0=v_~s~0_413, ~q_front~0=v_~q_front~0_479} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_249|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_104|, ~q_back~0=v_~q_back~0_632, 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_225|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_190|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_225|, ~N~0=v_~N~0_251, ~q~0.base=v_~q~0.base_332, ~q~0.offset=v_~q~0.offset_331, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_225|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_281|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_194|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_190|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_297|, 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_281|, #memory_int=|v_#memory_int_485|, ~n~0=v_~n~0_337, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_104|, ~s~0=v_~s~0_412, ~q_front~0=v_~q_front~0_478} 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-13 13:33:52,748 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:52,879 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:33:52,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1667 [2022-12-13 13:33:52,879 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 94 transitions, 1360 flow [2022-12-13 13:33:52,879 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-13 13:33:52,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:52,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:52,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 13:33:53,080 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,SelfDestructingSolverStorable42 [2022-12-13 13:33:53,080 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-13 13:33:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2060678550, now seen corresponding path program 1 times [2022-12-13 13:33:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:53,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432669534] [2022-12-13 13:33:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:53,419 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-13 13:33:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432669534] [2022-12-13 13:33:53,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432669534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770631102] [2022-12-13 13:33:53,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:53,428 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-13 13:33:53,440 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-13 13:33:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:53,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 13:33:53,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:53,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:53,622 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-13 13:33:53,667 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-13 13:33:53,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:53,790 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-13 13:33:53,791 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 108 [2022-12-13 13:33:53,887 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-13 13:33:53,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770631102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:53,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:53,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 13:33:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656038732] [2022-12-13 13:33:53,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:53,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:33:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:33:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:33:53,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 13:33:53,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 94 transitions, 1360 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-13 13:33:53,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:53,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 13:33:53,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:54,800 INFO L130 PetriNetUnfolder]: 706/1374 cut-off events. [2022-12-13 13:33:54,801 INFO L131 PetriNetUnfolder]: For 10638/10671 co-relation queries the response was YES. [2022-12-13 13:33:54,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7878 conditions, 1374 events. 706/1374 cut-off events. For 10638/10671 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8267 event pairs, 83 based on Foata normal form. 46/1300 useless extension candidates. Maximal degree in co-relation 6844. Up to 805 conditions per place. [2022-12-13 13:33:54,807 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 140 selfloop transitions, 106 changer transitions 32/279 dead transitions. [2022-12-13 13:33:54,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 279 transitions, 3550 flow [2022-12-13 13:33:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:33:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 13:33:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 177 transitions. [2022-12-13 13:33:54,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2595307917888563 [2022-12-13 13:33:54,828 INFO L175 Difference]: Start difference. First operand has 73 places, 94 transitions, 1360 flow. Second operand 22 states and 177 transitions. [2022-12-13 13:33:54,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 279 transitions, 3550 flow [2022-12-13 13:33:54,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 279 transitions, 3338 flow, removed 86 selfloop flow, removed 5 redundant places. [2022-12-13 13:33:54,846 INFO L231 Difference]: Finished difference. Result has 106 places, 181 transitions, 2625 flow [2022-12-13 13:33:54,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2625, PETRI_PLACES=106, PETRI_TRANSITIONS=181} [2022-12-13 13:33:54,846 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 85 predicate places. [2022-12-13 13:33:54,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:54,846 INFO L89 Accepts]: Start accepts. Operand has 106 places, 181 transitions, 2625 flow [2022-12-13 13:33:54,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:54,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:54,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 181 transitions, 2625 flow [2022-12-13 13:33:54,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 181 transitions, 2625 flow [2022-12-13 13:33:54,892 INFO L130 PetriNetUnfolder]: 162/506 cut-off events. [2022-12-13 13:33:54,892 INFO L131 PetriNetUnfolder]: For 4250/4298 co-relation queries the response was YES. [2022-12-13 13:33:54,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 506 events. 162/506 cut-off events. For 4250/4298 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3376 event pairs, 0 based on Foata normal form. 37/502 useless extension candidates. Maximal degree in co-relation 2771. Up to 159 conditions per place. [2022-12-13 13:33:54,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 181 transitions, 2625 flow [2022-12-13 13:33:54,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 13:33:54,897 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [658] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_483| v_~q~0.base_330)) (.cse1 (* v_~q_back~0_628 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_329)) 1) 1 0) 0)) (= (+ v_~s~0_409 |v_thread2Thread1of1ForFork1_~j~0#1_247|) v_~s~0_408) (= (+ 1 v_~q_front~0_475) v_~q_front~0_474) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_223|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_247| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_293| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277| (ite (= (select .cse0 (+ (* v_~q_back~0_626 4) (- 4) v_~q~0.offset_329)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_223| 0)) (= v_~q_back~0_626 (+ v_~q_back~0_628 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| (ite (and (< v_~q_front~0_475 (+ v_~q_back~0_628 1)) (< v_~q_front~0_475 v_~n~0_335) (<= 0 v_~q_front~0_475)) 1 0)) (= (select .cse0 (+ v_~q~0.offset_329 (* 4 v_~q_front~0_475))) |v_thread2Thread1of1ForFork1_~j~0#1_247|) (< 3 v_~N~0_249) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_329 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_329)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_277| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_277|) (not (= (ite (and (< v_~q_back~0_626 (+ v_~n~0_335 1)) (<= 1 v_~q_back~0_626)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_628, #memory_int=|v_#memory_int_483|, ~N~0=v_~N~0_249, ~q~0.base=v_~q~0.base_330, ~n~0=v_~n~0_335, ~q~0.offset=v_~q~0.offset_329, ~s~0=v_~s~0_409, ~q_front~0=v_~q_front~0_475} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_247|, ~q_back~0=v_~q_back~0_626, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_186|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_223|, ~N~0=v_~N~0_249, ~q~0.base=v_~q~0.base_330, ~q~0.offset=v_~q~0.offset_329, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_223|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_223|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_190|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_186|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_277|, #memory_int=|v_#memory_int_483|, ~n~0=v_~n~0_335, ~s~0=v_~s~0_408, ~q_front~0=v_~q_front~0_474} 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-13 13:33:55,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:55,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-13 13:33:55,467 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:55,467 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:55,467 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:55,467 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:55,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-13 13:33:55,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:33:55,975 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:33:55,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1130 [2022-12-13 13:33:55,976 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 178 transitions, 2676 flow [2022-12-13 13:33:55,976 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-13 13:33:55,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:55,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:55,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 13:33:56,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 13:33:56,182 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-13 13:33:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash 119352157, now seen corresponding path program 1 times [2022-12-13 13:33:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:56,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085399247] [2022-12-13 13:33:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:56,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-13 13:33:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:56,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085399247] [2022-12-13 13:33:56,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085399247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:56,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369771393] [2022-12-13 13:33:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:56,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:56,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:56,457 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-13 13:33:56,457 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-13 13:33:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:56,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 13:33:56,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:56,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:56,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 16 [2022-12-13 13:33:56,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-13 13:33:56,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:56,783 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-13 13:33:56,784 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 108 [2022-12-13 13:33:56,878 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-13 13:33:56,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369771393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:56,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:56,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-13 13:33:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003746545] [2022-12-13 13:33:56,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:56,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:33:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:33:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:33:56,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 13:33:56,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 178 transitions, 2676 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-13 13:33:56,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:56,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 13:33:56,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:57,215 INFO L130 PetriNetUnfolder]: 648/1246 cut-off events. [2022-12-13 13:33:57,216 INFO L131 PetriNetUnfolder]: For 14512/14569 co-relation queries the response was YES. [2022-12-13 13:33:57,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8426 conditions, 1246 events. 648/1246 cut-off events. For 14512/14569 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7190 event pairs, 104 based on Foata normal form. 22/1191 useless extension candidates. Maximal degree in co-relation 8253. Up to 1111 conditions per place. [2022-12-13 13:33:57,223 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 157 selfloop transitions, 36 changer transitions 3/197 dead transitions. [2022-12-13 13:33:57,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 197 transitions, 3168 flow [2022-12-13 13:33:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:33:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:33:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 13:33:57,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2022-12-13 13:33:57,236 INFO L175 Difference]: Start difference. First operand has 100 places, 178 transitions, 2676 flow. Second operand 6 states and 69 transitions. [2022-12-13 13:33:57,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 197 transitions, 3168 flow [2022-12-13 13:33:57,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 197 transitions, 2796 flow, removed 181 selfloop flow, removed 7 redundant places. [2022-12-13 13:33:57,280 INFO L231 Difference]: Finished difference. Result has 100 places, 178 transitions, 2420 flow [2022-12-13 13:33:57,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2310, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2420, PETRI_PLACES=100, PETRI_TRANSITIONS=178} [2022-12-13 13:33:57,281 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-13 13:33:57,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:57,281 INFO L89 Accepts]: Start accepts. Operand has 100 places, 178 transitions, 2420 flow [2022-12-13 13:33:57,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:57,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:57,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 178 transitions, 2420 flow [2022-12-13 13:33:57,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 178 transitions, 2420 flow [2022-12-13 13:33:57,335 INFO L130 PetriNetUnfolder]: 161/506 cut-off events. [2022-12-13 13:33:57,336 INFO L131 PetriNetUnfolder]: For 3754/3802 co-relation queries the response was YES. [2022-12-13 13:33:57,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2713 conditions, 506 events. 161/506 cut-off events. For 3754/3802 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3358 event pairs, 1 based on Foata normal form. 37/506 useless extension candidates. Maximal degree in co-relation 2644. Up to 160 conditions per place. [2022-12-13 13:33:57,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 178 transitions, 2420 flow [2022-12-13 13:33:57,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 13:33:57,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:33:57,488 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,488 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,488 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:57,489 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:58,008 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:58,009 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:33:58,591 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:33:58,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1310 [2022-12-13 13:33:58,591 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 176 transitions, 2404 flow [2022-12-13 13:33:58,592 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-13 13:33:58,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:58,592 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:58,599 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-13 13:33:58,797 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-13 13:33:58,797 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-13 13:33:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:33:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -725756392, now seen corresponding path program 1 times [2022-12-13 13:33:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:33:58,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132459357] [2022-12-13 13:33:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:33:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:59,167 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-13 13:33:59,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:33:59,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132459357] [2022-12-13 13:33:59,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132459357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:33:59,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378559248] [2022-12-13 13:33:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:33:59,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:33:59,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:33:59,185 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-13 13:33:59,186 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-13 13:33:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:33:59,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 13:33:59,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:33:59,322 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-13 13:33:59,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:33:59,338 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:33:59,339 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-13 13:33:59,348 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-13 13:33:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378559248] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:33:59,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:33:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-13 13:33:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196583011] [2022-12-13 13:33:59,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:33:59,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:33:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:33:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:33:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:33:59,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 13:33:59,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 176 transitions, 2404 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-13 13:33:59,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:33:59,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 13:33:59,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:33:59,758 INFO L130 PetriNetUnfolder]: 707/1326 cut-off events. [2022-12-13 13:33:59,759 INFO L131 PetriNetUnfolder]: For 15235/15270 co-relation queries the response was YES. [2022-12-13 13:33:59,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8305 conditions, 1326 events. 707/1326 cut-off events. For 15235/15270 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7573 event pairs, 38 based on Foata normal form. 107/1351 useless extension candidates. Maximal degree in co-relation 8259. Up to 804 conditions per place. [2022-12-13 13:33:59,766 INFO L137 encePairwiseOnDemand]: 15/38 looper letters, 123 selfloop transitions, 104 changer transitions 2/230 dead transitions. [2022-12-13 13:33:59,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 230 transitions, 3262 flow [2022-12-13 13:33:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:33:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:33:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2022-12-13 13:33:59,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2657894736842105 [2022-12-13 13:33:59,768 INFO L175 Difference]: Start difference. First operand has 98 places, 176 transitions, 2404 flow. Second operand 10 states and 101 transitions. [2022-12-13 13:33:59,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 230 transitions, 3262 flow [2022-12-13 13:33:59,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 230 transitions, 3166 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-13 13:33:59,800 INFO L231 Difference]: Finished difference. Result has 110 places, 191 transitions, 2921 flow [2022-12-13 13:33:59,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2921, PETRI_PLACES=110, PETRI_TRANSITIONS=191} [2022-12-13 13:33:59,800 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-13 13:33:59,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:33:59,800 INFO L89 Accepts]: Start accepts. Operand has 110 places, 191 transitions, 2921 flow [2022-12-13 13:33:59,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:33:59,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:33:59,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 191 transitions, 2921 flow [2022-12-13 13:33:59,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 191 transitions, 2921 flow [2022-12-13 13:33:59,848 INFO L130 PetriNetUnfolder]: 180/537 cut-off events. [2022-12-13 13:33:59,848 INFO L131 PetriNetUnfolder]: For 5067/5135 co-relation queries the response was YES. [2022-12-13 13:33:59,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 537 events. 180/537 cut-off events. For 5067/5135 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3551 event pairs, 1 based on Foata normal form. 32/526 useless extension candidates. Maximal degree in co-relation 2992. Up to 195 conditions per place. [2022-12-13 13:33:59,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 191 transitions, 2921 flow [2022-12-13 13:33:59,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 618 [2022-12-13 13:33:59,853 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:33:59,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 13:33:59,853 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 191 transitions, 2921 flow [2022-12-13 13:33:59,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-13 13:33:59,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:33:59,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:33:59,860 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-13 13:34:00,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:00,054 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-13 13:34:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:00,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1923467970, now seen corresponding path program 1 times [2022-12-13 13:34:00,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:00,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707362959] [2022-12-13 13:34:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:00,329 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-13 13:34:00,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:00,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707362959] [2022-12-13 13:34:00,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707362959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:00,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322201967] [2022-12-13 13:34:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:00,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:00,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:00,331 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-13 13:34:00,331 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-13 13:34:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:00,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:34:00,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:00,477 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-13 13:34:00,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:00,499 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:34:00,500 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-13 13:34:00,510 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-13 13:34:00,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322201967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:00,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:00,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:34:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027175695] [2022-12-13 13:34:00,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:00,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:34:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:00,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:34:00,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:34:00,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 13:34:00,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 191 transitions, 2921 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-13 13:34:00,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:00,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 13:34:00,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:00,952 INFO L130 PetriNetUnfolder]: 760/1401 cut-off events. [2022-12-13 13:34:00,952 INFO L131 PetriNetUnfolder]: For 19196/19214 co-relation queries the response was YES. [2022-12-13 13:34:00,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 1401 events. 760/1401 cut-off events. For 19196/19214 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8035 event pairs, 75 based on Foata normal form. 74/1386 useless extension candidates. Maximal degree in co-relation 9218. Up to 591 conditions per place. [2022-12-13 13:34:00,977 INFO L137 encePairwiseOnDemand]: 11/37 looper letters, 126 selfloop transitions, 136 changer transitions 1/264 dead transitions. [2022-12-13 13:34:00,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 264 transitions, 4007 flow [2022-12-13 13:34:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:34:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:34:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-12-13 13:34:00,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2545045045045045 [2022-12-13 13:34:00,978 INFO L175 Difference]: Start difference. First operand has 110 places, 191 transitions, 2921 flow. Second operand 12 states and 113 transitions. [2022-12-13 13:34:00,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 264 transitions, 4007 flow [2022-12-13 13:34:01,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 264 transitions, 3704 flow, removed 111 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:01,021 INFO L231 Difference]: Finished difference. Result has 116 places, 207 transitions, 3270 flow [2022-12-13 13:34:01,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3270, PETRI_PLACES=116, PETRI_TRANSITIONS=207} [2022-12-13 13:34:01,021 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-13 13:34:01,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:01,021 INFO L89 Accepts]: Start accepts. Operand has 116 places, 207 transitions, 3270 flow [2022-12-13 13:34:01,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:01,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:01,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 207 transitions, 3270 flow [2022-12-13 13:34:01,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 207 transitions, 3270 flow [2022-12-13 13:34:01,075 INFO L130 PetriNetUnfolder]: 198/570 cut-off events. [2022-12-13 13:34:01,075 INFO L131 PetriNetUnfolder]: For 5635/5709 co-relation queries the response was YES. [2022-12-13 13:34:01,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 570 events. 198/570 cut-off events. For 5635/5709 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3785 event pairs, 0 based on Foata normal form. 39/570 useless extension candidates. Maximal degree in co-relation 3255. Up to 221 conditions per place. [2022-12-13 13:34:01,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 207 transitions, 3270 flow [2022-12-13 13:34:01,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 13:34:01,081 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-13 13:34:01,143 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:34:01,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 13:34:01,144 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 207 transitions, 3282 flow [2022-12-13 13:34:01,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-13 13:34:01,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:01,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:01,156 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-13 13:34:01,349 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,SelfDestructingSolverStorable46 [2022-12-13 13:34:01,349 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-13 13:34:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2044688709, now seen corresponding path program 1 times [2022-12-13 13:34:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:01,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133341468] [2022-12-13 13:34:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:01,767 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-13 13:34:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:01,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133341468] [2022-12-13 13:34:01,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133341468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:01,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731942644] [2022-12-13 13:34:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:01,769 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-13 13:34:01,770 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-13 13:34:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:01,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 13:34:01,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:02,037 INFO L321 Elim1Store]: treesize reduction 115, result has 8.0 percent of original size [2022-12-13 13:34:02,037 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 68 treesize of output 25 [2022-12-13 13:34:02,066 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-13 13:34:02,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:02,197 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-13 13:34:02,197 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 108 [2022-12-13 13:34:02,284 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-13 13:34:02,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731942644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:02,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:02,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 13:34:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768952875] [2022-12-13 13:34:02,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:34:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:02,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:34:02,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:34:02,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 13:34:02,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 207 transitions, 3282 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-13 13:34:02,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:02,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 13:34:02,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:02,984 INFO L130 PetriNetUnfolder]: 806/1482 cut-off events. [2022-12-13 13:34:02,985 INFO L131 PetriNetUnfolder]: For 20271/20314 co-relation queries the response was YES. [2022-12-13 13:34:02,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10253 conditions, 1482 events. 806/1482 cut-off events. For 20271/20314 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8550 event pairs, 121 based on Foata normal form. 34/1439 useless extension candidates. Maximal degree in co-relation 10112. Up to 1119 conditions per place. [2022-12-13 13:34:02,993 INFO L137 encePairwiseOnDemand]: 14/37 looper letters, 177 selfloop transitions, 62 changer transitions 12/252 dead transitions. [2022-12-13 13:34:02,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 252 transitions, 4164 flow [2022-12-13 13:34:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:34:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:34:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-12-13 13:34:02,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24324324324324326 [2022-12-13 13:34:02,994 INFO L175 Difference]: Start difference. First operand has 116 places, 207 transitions, 3282 flow. Second operand 10 states and 90 transitions. [2022-12-13 13:34:02,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 252 transitions, 4164 flow [2022-12-13 13:34:03,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 252 transitions, 3900 flow, removed 85 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:03,066 INFO L231 Difference]: Finished difference. Result has 121 places, 211 transitions, 3247 flow [2022-12-13 13:34:03,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3035, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3247, PETRI_PLACES=121, PETRI_TRANSITIONS=211} [2022-12-13 13:34:03,067 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-13 13:34:03,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:03,067 INFO L89 Accepts]: Start accepts. Operand has 121 places, 211 transitions, 3247 flow [2022-12-13 13:34:03,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:03,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:03,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 211 transitions, 3247 flow [2022-12-13 13:34:03,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 211 transitions, 3247 flow [2022-12-13 13:34:03,121 INFO L130 PetriNetUnfolder]: 211/595 cut-off events. [2022-12-13 13:34:03,122 INFO L131 PetriNetUnfolder]: For 5863/5901 co-relation queries the response was YES. [2022-12-13 13:34:03,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 595 events. 211/595 cut-off events. For 5863/5901 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3938 event pairs, 0 based on Foata normal form. 25/579 useless extension candidates. Maximal degree in co-relation 3468. Up to 241 conditions per place. [2022-12-13 13:34:03,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 211 transitions, 3247 flow [2022-12-13 13:34:03,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-13 13:34:03,127 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:03,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 13:34:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 211 transitions, 3247 flow [2022-12-13 13:34:03,127 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-13 13:34:03,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:03,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:03,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 13:34:03,328 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,SelfDestructingSolverStorable47 [2022-12-13 13:34:03,328 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-13 13:34:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1709401120, now seen corresponding path program 1 times [2022-12-13 13:34:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:03,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803533455] [2022-12-13 13:34:03,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:03,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:03,643 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-13 13:34:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:03,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803533455] [2022-12-13 13:34:03,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803533455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723968645] [2022-12-13 13:34:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:03,645 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-13 13:34:03,659 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-13 13:34:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:03,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 13:34:03,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:03,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:03,832 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-13 13:34:03,875 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-13 13:34:03,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:03,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:03,956 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-13 13:34:04,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-13 13:34:04,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723968645] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:04,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:04,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 13:34:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741898868] [2022-12-13 13:34:04,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:04,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:34:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:34:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:34:04,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 13:34:04,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 211 transitions, 3247 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-13 13:34:04,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:04,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 13:34:04,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:04,471 INFO L130 PetriNetUnfolder]: 807/1497 cut-off events. [2022-12-13 13:34:04,471 INFO L131 PetriNetUnfolder]: For 18924/18938 co-relation queries the response was YES. [2022-12-13 13:34:04,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10195 conditions, 1497 events. 807/1497 cut-off events. For 18924/18938 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8690 event pairs, 157 based on Foata normal form. 16/1436 useless extension candidates. Maximal degree in co-relation 10082. Up to 1383 conditions per place. [2022-12-13 13:34:04,481 INFO L137 encePairwiseOnDemand]: 15/37 looper letters, 197 selfloop transitions, 35 changer transitions 13/246 dead transitions. [2022-12-13 13:34:04,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 246 transitions, 3955 flow [2022-12-13 13:34:04,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:34:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:34:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-12-13 13:34:04,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19542619542619544 [2022-12-13 13:34:04,482 INFO L175 Difference]: Start difference. First operand has 118 places, 211 transitions, 3247 flow. Second operand 13 states and 94 transitions. [2022-12-13 13:34:04,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 246 transitions, 3955 flow [2022-12-13 13:34:04,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 246 transitions, 3865 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:04,540 INFO L231 Difference]: Finished difference. Result has 130 places, 214 transitions, 3289 flow [2022-12-13 13:34:04,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3159, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3289, PETRI_PLACES=130, PETRI_TRANSITIONS=214} [2022-12-13 13:34:04,540 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-13 13:34:04,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:04,540 INFO L89 Accepts]: Start accepts. Operand has 130 places, 214 transitions, 3289 flow [2022-12-13 13:34:04,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:04,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:04,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 214 transitions, 3289 flow [2022-12-13 13:34:04,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 214 transitions, 3289 flow [2022-12-13 13:34:04,598 INFO L130 PetriNetUnfolder]: 209/598 cut-off events. [2022-12-13 13:34:04,599 INFO L131 PetriNetUnfolder]: For 6194/6232 co-relation queries the response was YES. [2022-12-13 13:34:04,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 598 events. 209/598 cut-off events. For 6194/6232 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4003 event pairs, 0 based on Foata normal form. 25/582 useless extension candidates. Maximal degree in co-relation 3461. Up to 242 conditions per place. [2022-12-13 13:34:04,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 214 transitions, 3289 flow [2022-12-13 13:34:04,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 13:34:04,609 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-13 13:34:04,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (+ 1 v_~q_front~0_450)) (.cse0 (select |v_#memory_int_470| v_~q~0.base_321))) (and (not (= 0 (ite (and (< v_~q_back~0_603 (+ v_~n~0_327 1)) (<= 1 v_~q_back~0_603)) 1 0))) (= (select .cse0 (+ (* 4 v_~q_front~0_450) v_~q~0.offset_320)) |v_thread2Thread1of1ForFork1_~j~0#1_228|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|) (< |v_thread1Thread1of1ForFork0_~i~0#1_275| (+ v_~N~0_241 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_275| 2) (= (+ 2 v_~q_back~0_605) v_~q_back~0_603) (= .cse1 v_~q_front~0_449) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (and (< v_~q_front~0_450 v_~n~0_327) (<= 0 v_~q_front~0_450) (< .cse1 v_~q_back~0_603)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_605 4) v_~q~0.offset_320)) 1) 1 0) 0)) (= (+ v_~s~0_384 |v_thread2Thread1of1ForFork1_~j~0#1_228|) v_~s~0_383) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_228| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_603 4) v_~q~0.offset_320)) 1) 1 0)))) InVars {~q_back~0=v_~q_back~0_605, #memory_int=|v_#memory_int_470|, ~N~0=v_~N~0_241, ~q~0.base=v_~q~0.base_321, ~n~0=v_~n~0_327, ~q~0.offset=v_~q~0.offset_320, ~s~0=v_~s~0_384, ~q_front~0=v_~q_front~0_450} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_228|, ~q_back~0=v_~q_back~0_603, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_172|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_206|, ~N~0=v_~N~0_241, ~q~0.base=v_~q~0.base_321, ~q~0.offset=v_~q~0.offset_320, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_206|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_176|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_275|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|, #memory_int=|v_#memory_int_470|, ~n~0=v_~n~0_327, ~s~0=v_~s~0_383, ~q_front~0=v_~q_front~0_449} 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 [676] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_523| v_~q~0.base_360))) (and (not (= (ite (and (<= 0 v_~q_back~0_713) (< v_~q_back~0_713 v_~n~0_365)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_333| (ite (= (select .cse0 (+ v_~q~0.offset_359 (* v_~q_back~0_713 4))) 1) 1 0)) (= (+ v_~q_back~0_713 1) v_~q_back~0_712) (= (+ v_~s~0_489 |v_thread2Thread1of1ForFork1_~j~0#1_305|) v_~s~0_488) (< |v_thread1Thread1of1ForFork0_~i~0#1_354| v_~N~0_279) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_305| 0)) (= (+ 1 v_~q_front~0_550) v_~q_front~0_549) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_275| (ite (and (< v_~q_front~0_550 v_~n~0_365) (<= 0 v_~q_front~0_550) (< v_~q_front~0_550 v_~q_back~0_713)) 1 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_550) v_~q~0.offset_359)) |v_thread2Thread1of1ForFork1_~j~0#1_305|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_333| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_333|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_275| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_275|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_275| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_333| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_353| (+ |v_thread1Thread1of1ForFork0_~i~0#1_354| 1)))) InVars {~q_back~0=v_~q_back~0_713, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_354|, #memory_int=|v_#memory_int_523|, ~N~0=v_~N~0_279, ~q~0.base=v_~q~0.base_360, ~n~0=v_~n~0_365, ~q~0.offset=v_~q~0.offset_359, ~s~0=v_~s~0_489, ~q_front~0=v_~q_front~0_550} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_305|, ~q_back~0=v_~q_back~0_712, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_275|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_228|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_275|, ~N~0=v_~N~0_279, ~q~0.base=v_~q~0.base_360, ~q~0.offset=v_~q~0.offset_359, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_275|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_275|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_333|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_232|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_228|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_353|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_333|, #memory_int=|v_#memory_int_523|, ~n~0=v_~n~0_365, ~s~0=v_~s~0_488, ~q_front~0=v_~q_front~0_549} 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] [2022-12-13 13:34:04,998 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:04,998 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:04,998 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:04,998 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:05,373 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:05,373 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:05,374 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:05,374 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:05,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_525| v_~q~0.base_362)) (.cse1 (* v_~q_back~0_716 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_277| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| (ite (and (<= 0 v_~q_front~0_554) (< (+ 2 v_~q_front~0_554) v_~q_back~0_716) (< v_~q_front~0_554 v_~n~0_367)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_307| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_357| 2) (= (select .cse0 (+ v_~q~0.offset_361 (* 4 v_~q_front~0_554))) |v_thread2Thread1of1ForFork1_~j~0#1_307|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_277|) (not (= (ite (= 1 (select .cse0 (+ v_~q~0.offset_361 (* v_~q_back~0_718 4)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_335|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_132| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335| (ite (= (select .cse0 (+ .cse1 (- 4) v_~q~0.offset_361)) 0) 1 0)) (= (+ 1 v_~q_front~0_554) v_~q_front~0_553) (= |v_thread1Thread1of1ForFork0_#res#1.base_132| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_357| (+ v_~N~0_281 1)) (= (+ v_~s~0_493 |v_thread2Thread1of1ForFork1_~j~0#1_307|) v_~s~0_492) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_361 (- 8))) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_335| 0)) (not (= (ite (and (<= 1 v_~q_back~0_716) (< v_~q_back~0_716 (+ v_~n~0_367 1))) 1 0) 0)) (= (+ 3 v_~q_back~0_718) v_~q_back~0_716) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_357| v_~N~0_281)))) InVars {~q_back~0=v_~q_back~0_718, #memory_int=|v_#memory_int_525|, ~N~0=v_~N~0_281, ~q~0.base=v_~q~0.base_362, ~n~0=v_~n~0_367, ~q~0.offset=v_~q~0.offset_361, ~s~0=v_~s~0_493, ~q_front~0=v_~q_front~0_554} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_307|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_132|, ~q_back~0=v_~q_back~0_716, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_150|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_230|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_277|, ~N~0=v_~N~0_281, ~q~0.base=v_~q~0.base_362, ~q~0.offset=v_~q~0.offset_361, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_277|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_277|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_234|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_230|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_357|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_150|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_335|, #memory_int=|v_#memory_int_525|, ~n~0=v_~n~0_367, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_132|, ~s~0=v_~s~0_492, ~q_front~0=v_~q_front~0_553} 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-13 13:34:06,020 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:34:06,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1481 [2022-12-13 13:34:06,021 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 212 transitions, 3320 flow [2022-12-13 13:34:06,021 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-13 13:34:06,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:06,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:06,027 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-13 13:34:06,226 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,SelfDestructingSolverStorable48 [2022-12-13 13:34:06,227 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-13 13:34:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1408242951, now seen corresponding path program 1 times [2022-12-13 13:34:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:06,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628125985] [2022-12-13 13:34:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:06,896 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-13 13:34:06,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:06,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628125985] [2022-12-13 13:34:06,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628125985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:06,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:06,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:34:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492985494] [2022-12-13 13:34:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:06,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:34:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:34:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:34:06,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 13:34:06,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 212 transitions, 3320 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-13 13:34:06,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:06,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 13:34:06,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:07,190 INFO L130 PetriNetUnfolder]: 791/1455 cut-off events. [2022-12-13 13:34:07,190 INFO L131 PetriNetUnfolder]: For 20399/20438 co-relation queries the response was YES. [2022-12-13 13:34:07,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10000 conditions, 1455 events. 791/1455 cut-off events. For 20399/20438 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8327 event pairs, 158 based on Foata normal form. 25/1402 useless extension candidates. Maximal degree in co-relation 9855. Up to 1417 conditions per place. [2022-12-13 13:34:07,198 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 201 selfloop transitions, 11 changer transitions 7/220 dead transitions. [2022-12-13 13:34:07,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 220 transitions, 3799 flow [2022-12-13 13:34:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:34:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:34:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 13:34:07,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33125 [2022-12-13 13:34:07,199 INFO L175 Difference]: Start difference. First operand has 126 places, 212 transitions, 3320 flow. Second operand 4 states and 53 transitions. [2022-12-13 13:34:07,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 220 transitions, 3799 flow [2022-12-13 13:34:07,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 220 transitions, 3695 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:07,252 INFO L231 Difference]: Finished difference. Result has 121 places, 209 transitions, 3172 flow [2022-12-13 13:34:07,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3209, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3172, PETRI_PLACES=121, PETRI_TRANSITIONS=209} [2022-12-13 13:34:07,252 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-13 13:34:07,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:07,252 INFO L89 Accepts]: Start accepts. Operand has 121 places, 209 transitions, 3172 flow [2022-12-13 13:34:07,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:07,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:07,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 209 transitions, 3172 flow [2022-12-13 13:34:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 209 transitions, 3172 flow [2022-12-13 13:34:07,307 INFO L130 PetriNetUnfolder]: 209/589 cut-off events. [2022-12-13 13:34:07,307 INFO L131 PetriNetUnfolder]: For 6020/6057 co-relation queries the response was YES. [2022-12-13 13:34:07,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 589 events. 209/589 cut-off events. For 6020/6057 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3900 event pairs, 0 based on Foata normal form. 25/573 useless extension candidates. Maximal degree in co-relation 3355. Up to 240 conditions per place. [2022-12-13 13:34:07,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 209 transitions, 3172 flow [2022-12-13 13:34:07,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 13:34:07,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:07,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 13:34:07,313 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 209 transitions, 3172 flow [2022-12-13 13:34:07,313 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-13 13:34:07,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:07,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:07,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 13:34:07,313 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-13 13:34:07,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash 653994630, now seen corresponding path program 1 times [2022-12-13 13:34:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:07,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359827933] [2022-12-13 13:34:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:07,839 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-13 13:34:07,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:07,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359827933] [2022-12-13 13:34:07,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359827933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:07,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387107156] [2022-12-13 13:34:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:07,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:07,841 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-13 13:34:07,842 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-13 13:34:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:07,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:34:07,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:08,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:08,015 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-13 13:34:08,050 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-13 13:34:08,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:08,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:08,135 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-13 13:34:08,205 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-13 13:34:08,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387107156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:08,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:08,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-13 13:34:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520913577] [2022-12-13 13:34:08,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:08,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:34:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:34:08,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:34:08,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 13:34:08,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 209 transitions, 3172 flow. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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-13 13:34:08,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:08,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 13:34:08,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:08,800 INFO L130 PetriNetUnfolder]: 805/1486 cut-off events. [2022-12-13 13:34:08,800 INFO L131 PetriNetUnfolder]: For 18898/18913 co-relation queries the response was YES. [2022-12-13 13:34:08,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10044 conditions, 1486 events. 805/1486 cut-off events. For 18898/18913 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8587 event pairs, 149 based on Foata normal form. 16/1425 useless extension candidates. Maximal degree in co-relation 9780. Up to 1385 conditions per place. [2022-12-13 13:34:08,808 INFO L137 encePairwiseOnDemand]: 15/38 looper letters, 197 selfloop transitions, 36 changer transitions 7/241 dead transitions. [2022-12-13 13:34:08,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 241 transitions, 3870 flow [2022-12-13 13:34:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:34:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:34:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 86 transitions. [2022-12-13 13:34:08,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18859649122807018 [2022-12-13 13:34:08,809 INFO L175 Difference]: Start difference. First operand has 118 places, 209 transitions, 3172 flow. Second operand 12 states and 86 transitions. [2022-12-13 13:34:08,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 241 transitions, 3870 flow [2022-12-13 13:34:08,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 241 transitions, 3836 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 13:34:08,857 INFO L231 Difference]: Finished difference. Result has 130 places, 215 transitions, 3331 flow [2022-12-13 13:34:08,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3142, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3331, PETRI_PLACES=130, PETRI_TRANSITIONS=215} [2022-12-13 13:34:08,858 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-13 13:34:08,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:08,858 INFO L89 Accepts]: Start accepts. Operand has 130 places, 215 transitions, 3331 flow [2022-12-13 13:34:08,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:08,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:08,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 215 transitions, 3331 flow [2022-12-13 13:34:08,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 215 transitions, 3331 flow [2022-12-13 13:34:08,915 INFO L130 PetriNetUnfolder]: 210/599 cut-off events. [2022-12-13 13:34:08,916 INFO L131 PetriNetUnfolder]: For 6258/6295 co-relation queries the response was YES. [2022-12-13 13:34:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 599 events. 210/599 cut-off events. For 6258/6295 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4010 event pairs, 0 based on Foata normal form. 25/583 useless extension candidates. Maximal degree in co-relation 3502. Up to 244 conditions per place. [2022-12-13 13:34:08,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 215 transitions, 3331 flow [2022-12-13 13:34:08,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-13 13:34:08,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_263| v_~q~0.base_187))) (and (= (+ 1 v_~q_front~0_246) v_~q_front~0_245) (= (+ v_~q_back~0_330 1) v_~q_back~0_329) (= (ite (and (< v_~q_front~0_246 v_~q_back~0_329) (<= 0 v_~q_front~0_246) (< v_~q_front~0_246 v_~n~0_197)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_246) v_~q~0.offset_187)) |v_thread2Thread1of1ForFork1_~j~0#1_107|) (not (= (ite (and (<= 0 v_~q_back~0_330) (< v_~q_back~0_330 v_~n~0_197)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_107| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 1) (= (+ v_~s~0_192 |v_thread2Thread1of1ForFork1_~j~0#1_107|) v_~s~0_191) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_132 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118| (ite (= (select .cse0 (+ v_~q~0.offset_187 (* v_~q_back~0_330 4))) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0)))) InVars {~q_back~0=v_~q_back~0_330, #memory_int=|v_#memory_int_263|, ~N~0=v_~N~0_132, ~q~0.base=v_~q~0.base_187, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_187, ~s~0=v_~s~0_192, ~q_front~0=v_~q_front~0_246} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_107|, ~q_back~0=v_~q_back~0_329, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_94|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_80|, ~N~0=v_~N~0_132, ~q~0.base=v_~q~0.base_187, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_94|, ~q~0.offset=v_~q~0.offset_187, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_118|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_84|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_80|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, #memory_int=|v_#memory_int_263|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, ~n~0=v_~n~0_197, ~s~0=v_~s~0_191, ~q_front~0=v_~q_front~0_245} 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-13 13:34:08,926 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:08,926 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:08,926 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:08,926 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:08,926 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:08,926 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:09,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:34:09,276 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:34:09,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-13 13:34:09,276 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 213 transitions, 3315 flow [2022-12-13 13:34:09,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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-13 13:34:09,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:09,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:09,282 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-13 13:34:09,482 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-13 13:34:09,482 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-13 13:34:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1019633777, now seen corresponding path program 1 times [2022-12-13 13:34:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:09,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022470665] [2022-12-13 13:34:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:09,936 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-13 13:34:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:09,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022470665] [2022-12-13 13:34:09,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022470665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:09,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:09,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:34:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709545148] [2022-12-13 13:34:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:09,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:34:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:09,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:34:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:34:09,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 13:34:09,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 213 transitions, 3315 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-13 13:34:09,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:09,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 13:34:09,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:10,218 INFO L130 PetriNetUnfolder]: 793/1457 cut-off events. [2022-12-13 13:34:10,218 INFO L131 PetriNetUnfolder]: For 18839/18854 co-relation queries the response was YES. [2022-12-13 13:34:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10000 conditions, 1457 events. 793/1457 cut-off events. For 18839/18854 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8349 event pairs, 157 based on Foata normal form. 16/1396 useless extension candidates. Maximal degree in co-relation 9871. Up to 1410 conditions per place. [2022-12-13 13:34:10,227 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 198 selfloop transitions, 17 changer transitions 6/222 dead transitions. [2022-12-13 13:34:10,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 222 transitions, 3800 flow [2022-12-13 13:34:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:34:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:34:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 13:34:10,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28717948717948716 [2022-12-13 13:34:10,229 INFO L175 Difference]: Start difference. First operand has 127 places, 213 transitions, 3315 flow. Second operand 5 states and 56 transitions. [2022-12-13 13:34:10,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 222 transitions, 3800 flow [2022-12-13 13:34:10,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 222 transitions, 3706 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 13:34:10,286 INFO L231 Difference]: Finished difference. Result has 122 places, 211 transitions, 3231 flow [2022-12-13 13:34:10,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3214, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3231, PETRI_PLACES=122, PETRI_TRANSITIONS=211} [2022-12-13 13:34:10,287 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-13 13:34:10,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:10,287 INFO L89 Accepts]: Start accepts. Operand has 122 places, 211 transitions, 3231 flow [2022-12-13 13:34:10,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:10,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:10,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 211 transitions, 3231 flow [2022-12-13 13:34:10,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 211 transitions, 3231 flow [2022-12-13 13:34:10,342 INFO L130 PetriNetUnfolder]: 210/591 cut-off events. [2022-12-13 13:34:10,342 INFO L131 PetriNetUnfolder]: For 6235/6304 co-relation queries the response was YES. [2022-12-13 13:34:10,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 591 events. 210/591 cut-off events. For 6235/6304 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3910 event pairs, 0 based on Foata normal form. 28/577 useless extension candidates. Maximal degree in co-relation 3374. Up to 242 conditions per place. [2022-12-13 13:34:10,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 211 transitions, 3231 flow [2022-12-13 13:34:10,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-13 13:34:10,347 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:10,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 13:34:10,348 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 211 transitions, 3231 flow [2022-12-13 13:34:10,348 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-13 13:34:10,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:10,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:10,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 13:34:10,348 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-13 13:34:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1003887284, now seen corresponding path program 1 times [2022-12-13 13:34:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54739759] [2022-12-13 13:34:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:10,399 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-13 13:34:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54739759] [2022-12-13 13:34:10,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54739759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:10,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:10,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:34:10,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976091391] [2022-12-13 13:34:10,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:10,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:34:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:34:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:34:10,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 13:34:10,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 211 transitions, 3231 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-13 13:34:10,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:10,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 13:34:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:10,619 INFO L130 PetriNetUnfolder]: 726/1338 cut-off events. [2022-12-13 13:34:10,619 INFO L131 PetriNetUnfolder]: For 19517/19561 co-relation queries the response was YES. [2022-12-13 13:34:10,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9137 conditions, 1338 events. 726/1338 cut-off events. For 19517/19561 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7564 event pairs, 240 based on Foata normal form. 21/1279 useless extension candidates. Maximal degree in co-relation 8887. Up to 1298 conditions per place. [2022-12-13 13:34:10,628 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 183 selfloop transitions, 5 changer transitions 7/196 dead transitions. [2022-12-13 13:34:10,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 196 transitions, 3400 flow [2022-12-13 13:34:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:34:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:34:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 13:34:10,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3223684210526316 [2022-12-13 13:34:10,629 INFO L175 Difference]: Start difference. First operand has 120 places, 211 transitions, 3231 flow. Second operand 4 states and 49 transitions. [2022-12-13 13:34:10,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 196 transitions, 3400 flow [2022-12-13 13:34:10,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 196 transitions, 3342 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:10,679 INFO L231 Difference]: Finished difference. Result has 118 places, 187 transitions, 2865 flow [2022-12-13 13:34:10,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2945, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2865, PETRI_PLACES=118, PETRI_TRANSITIONS=187} [2022-12-13 13:34:10,679 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2022-12-13 13:34:10,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:10,680 INFO L89 Accepts]: Start accepts. Operand has 118 places, 187 transitions, 2865 flow [2022-12-13 13:34:10,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:10,680 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:10,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 187 transitions, 2865 flow [2022-12-13 13:34:10,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 187 transitions, 2865 flow [2022-12-13 13:34:10,728 INFO L130 PetriNetUnfolder]: 192/543 cut-off events. [2022-12-13 13:34:10,728 INFO L131 PetriNetUnfolder]: For 5496/5533 co-relation queries the response was YES. [2022-12-13 13:34:10,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3188 conditions, 543 events. 192/543 cut-off events. For 5496/5533 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3504 event pairs, 0 based on Foata normal form. 25/527 useless extension candidates. Maximal degree in co-relation 3080. Up to 226 conditions per place. [2022-12-13 13:34:10,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 187 transitions, 2865 flow [2022-12-13 13:34:10,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-13 13:34:10,737 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-13 13:34:10,834 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:10,834 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:10,834 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:10,834 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:10,834 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:10,834 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:11,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (= v_~N~0_In_5 v_~s~0_In_3)) 1 0))) InVars {~N~0=v_~N~0_In_5, ~s~0=v_~s~0_In_3} OutVars{~N~0=v_~N~0_In_5, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ~s~0=v_~s~0_In_3} 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 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:34:11,231 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:34:11,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-13 13:34:11,232 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 186 transitions, 2867 flow [2022-12-13 13:34:11,232 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-13 13:34:11,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:11,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:11,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 13:34:11,233 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-13 13:34:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash 404360955, now seen corresponding path program 1 times [2022-12-13 13:34:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:11,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559971946] [2022-12-13 13:34:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:11,553 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-13 13:34:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559971946] [2022-12-13 13:34:11,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559971946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081976410] [2022-12-13 13:34:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:11,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:11,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:11,565 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-13 13:34:11,566 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-13 13:34:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:11,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:34:11,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:11,729 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-13 13:34:11,752 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-13 13:34:11,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:11,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:11,792 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-13 13:34:11,794 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-13 13:34:11,823 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-13 13:34:11,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081976410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:11,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:11,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 13:34:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538429151] [2022-12-13 13:34:11,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:11,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:34:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:11,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:34:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:34:11,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 13:34:11,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 186 transitions, 2867 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-13 13:34:11,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:11,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 13:34:11,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:12,334 INFO L130 PetriNetUnfolder]: 815/1491 cut-off events. [2022-12-13 13:34:12,335 INFO L131 PetriNetUnfolder]: For 19079/19092 co-relation queries the response was YES. [2022-12-13 13:34:12,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9993 conditions, 1491 events. 815/1491 cut-off events. For 19079/19092 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8502 event pairs, 115 based on Foata normal form. 33/1437 useless extension candidates. Maximal degree in co-relation 9715. Up to 779 conditions per place. [2022-12-13 13:34:12,344 INFO L137 encePairwiseOnDemand]: 16/36 looper letters, 154 selfloop transitions, 109 changer transitions 0/264 dead transitions. [2022-12-13 13:34:12,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 264 transitions, 4071 flow [2022-12-13 13:34:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:34:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:34:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-12-13 13:34:12,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26515151515151514 [2022-12-13 13:34:12,345 INFO L175 Difference]: Start difference. First operand has 114 places, 186 transitions, 2867 flow. Second operand 11 states and 105 transitions. [2022-12-13 13:34:12,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 264 transitions, 4071 flow [2022-12-13 13:34:12,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 264 transitions, 3981 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:12,394 INFO L231 Difference]: Finished difference. Result has 124 places, 207 transitions, 3540 flow [2022-12-13 13:34:12,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3540, PETRI_PLACES=124, PETRI_TRANSITIONS=207} [2022-12-13 13:34:12,394 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-13 13:34:12,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:12,394 INFO L89 Accepts]: Start accepts. Operand has 124 places, 207 transitions, 3540 flow [2022-12-13 13:34:12,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:12,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:12,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 207 transitions, 3540 flow [2022-12-13 13:34:12,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 207 transitions, 3540 flow [2022-12-13 13:34:12,451 INFO L130 PetriNetUnfolder]: 213/602 cut-off events. [2022-12-13 13:34:12,451 INFO L131 PetriNetUnfolder]: For 6205/6241 co-relation queries the response was YES. [2022-12-13 13:34:12,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 602 events. 213/602 cut-off events. For 6205/6241 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4004 event pairs, 2 based on Foata normal form. 24/541 useless extension candidates. Maximal degree in co-relation 3582. Up to 266 conditions per place. [2022-12-13 13:34:12,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 207 transitions, 3540 flow [2022-12-13 13:34:12,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 13:34:12,457 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:12,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 13:34:12,457 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 207 transitions, 3540 flow [2022-12-13 13:34:12,457 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-13 13:34:12,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:12,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:12,465 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-13 13:34:12,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:12,663 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-13 13:34:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1027472505, now seen corresponding path program 1 times [2022-12-13 13:34:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:12,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479747429] [2022-12-13 13:34:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:12,723 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-13 13:34:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479747429] [2022-12-13 13:34:12,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479747429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:12,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:12,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:34:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788590829] [2022-12-13 13:34:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:12,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:34:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:34:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:34:12,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 13:34:12,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 207 transitions, 3540 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-13 13:34:12,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:12,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 13:34:12,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:12,964 INFO L130 PetriNetUnfolder]: 723/1336 cut-off events. [2022-12-13 13:34:12,964 INFO L131 PetriNetUnfolder]: For 18885/18904 co-relation queries the response was YES. [2022-12-13 13:34:12,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 1336 events. 723/1336 cut-off events. For 18885/18904 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7472 event pairs, 249 based on Foata normal form. 19/1182 useless extension candidates. Maximal degree in co-relation 9450. Up to 1281 conditions per place. [2022-12-13 13:34:12,973 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 160 selfloop transitions, 3 changer transitions 14/178 dead transitions. [2022-12-13 13:34:12,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 178 transitions, 3479 flow [2022-12-13 13:34:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:34:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:34:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-13 13:34:12,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-13 13:34:12,974 INFO L175 Difference]: Start difference. First operand has 124 places, 207 transitions, 3540 flow. Second operand 5 states and 50 transitions. [2022-12-13 13:34:12,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 178 transitions, 3479 flow [2022-12-13 13:34:13,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 178 transitions, 3376 flow, removed 42 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:13,026 INFO L231 Difference]: Finished difference. Result has 117 places, 162 transitions, 2745 flow [2022-12-13 13:34:13,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3013, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2745, PETRI_PLACES=117, PETRI_TRANSITIONS=162} [2022-12-13 13:34:13,026 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2022-12-13 13:34:13,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:13,027 INFO L89 Accepts]: Start accepts. Operand has 117 places, 162 transitions, 2745 flow [2022-12-13 13:34:13,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:13,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:13,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 162 transitions, 2745 flow [2022-12-13 13:34:13,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 162 transitions, 2745 flow [2022-12-13 13:34:13,073 INFO L130 PetriNetUnfolder]: 185/525 cut-off events. [2022-12-13 13:34:13,073 INFO L131 PetriNetUnfolder]: For 5208/5244 co-relation queries the response was YES. [2022-12-13 13:34:13,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 525 events. 185/525 cut-off events. For 5208/5244 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3358 event pairs, 2 based on Foata normal form. 24/469 useless extension candidates. Maximal degree in co-relation 3016. Up to 239 conditions per place. [2022-12-13 13:34:13,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 162 transitions, 2745 flow [2022-12-13 13:34:13,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 13:34:13,082 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-13 13:34:13,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [679] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_527| v_~q~0.base_364)) (.cse2 (* 4 v_~q_front~0_559)) (.cse4 (+ 2 v_~q_front~0_559))) (let ((.cse1 (* v_~q_back~0_722 4)) (.cse6 (< .cse4 v_~q_back~0_722)) (.cse3 (select .cse0 (+ .cse2 v_~q~0.offset_363)))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_309| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_363 .cse1 (- 8))) 1) 1 0) 0)) (= (select .cse0 (+ .cse2 v_~q~0.offset_363 4)) |v_thread2Thread1of1ForFork1_~j~0#1_309|) (not (= .cse3 0)) (= .cse4 v_~q_front~0_557) (< |v_thread1Thread1of1ForFork0_~i~0#1_359| (+ v_~N~0_283 1)) (not (= (ite (and (<= 1 v_~q_back~0_722) (< v_~q_back~0_722 (+ v_~n~0_369 1))) 1 0) 0)) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_363 .cse1)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_339|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279| (ite (let ((.cse5 (+ 1 v_~q_front~0_559))) (and (<= 0 .cse5) .cse6 (< .cse5 v_~n~0_369))) 1 0)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_724 4) v_~q~0.offset_363)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_559) .cse6 (< v_~q_front~0_559 v_~n~0_369)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_339| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_339|) (= |v_thread1Thread1of1ForFork0_~i~0#1_359| 3) (= v_~q_back~0_722 (+ 3 v_~q_back~0_724)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_339| 0)) (= (+ .cse3 v_~s~0_498 |v_thread2Thread1of1ForFork1_~j~0#1_309|) v_~s~0_496) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|)))) InVars {~q_back~0=v_~q_back~0_724, #memory_int=|v_#memory_int_527|, ~N~0=v_~N~0_283, ~q~0.base=v_~q~0.base_364, ~n~0=v_~n~0_369, ~q~0.offset=v_~q~0.offset_363, ~s~0=v_~s~0_498, ~q_front~0=v_~q_front~0_559} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_309|, ~q_back~0=v_~q_back~0_722, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_232|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_279|, ~N~0=v_~N~0_283, ~q~0.base=v_~q~0.base_364, ~q~0.offset=v_~q~0.offset_363, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_279|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_339|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_236|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_232|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_359|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_339|, #memory_int=|v_#memory_int_527|, ~n~0=v_~n~0_369, ~s~0=v_~s~0_496, ~q_front~0=v_~q_front~0_557} 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 [690] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_546| v_~q~0.base_380))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366| 0)) (= v_~q_back~0_765 (+ v_~q_back~0_766 1)) (not (= (ite (and (< v_~q_back~0_766 v_~n~0_385) (<= 0 v_~q_back~0_766)) 1 0) 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_604) v_~q~0.offset_379)) |v_thread2Thread1of1ForFork1_~j~0#1_340|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_387| 1) |v_thread1Thread1of1ForFork0_~i~0#1_386|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| (ite (and (<= 0 v_~q_front~0_604) (< v_~q_front~0_604 v_~q_back~0_766) (< v_~q_front~0_604 v_~n~0_385)) 1 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_766 4) v_~q~0.offset_379)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|) (< |v_thread1Thread1of1ForFork0_~i~0#1_387| v_~N~0_299) (= (+ v_~s~0_543 |v_thread2Thread1of1ForFork1_~j~0#1_340|) v_~s~0_542) (= (+ 1 v_~q_front~0_604) v_~q_front~0_603) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_340| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|))) InVars {~q_back~0=v_~q_back~0_766, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_387|, #memory_int=|v_#memory_int_546|, ~N~0=v_~N~0_299, ~q~0.base=v_~q~0.base_380, ~n~0=v_~n~0_385, ~q~0.offset=v_~q~0.offset_379, ~s~0=v_~s~0_543, ~q_front~0=v_~q_front~0_604} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_340|, ~q_back~0=v_~q_back~0_765, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_253|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_308|, ~N~0=v_~N~0_299, ~q~0.base=v_~q~0.base_380, ~q~0.offset=v_~q~0.offset_379, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_308|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_257|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_253|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_386|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|, #memory_int=|v_#memory_int_546|, ~n~0=v_~n~0_385, ~s~0=v_~s~0_542, ~q_front~0=v_~q_front~0_603} 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] [2022-12-13 13:34:13,190 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,190 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,190 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,190 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,190 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,191 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,680 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,680 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,680 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,680 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,680 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:13,680 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:14,012 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:34:14,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 987 [2022-12-13 13:34:14,013 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 161 transitions, 2761 flow [2022-12-13 13:34:14,013 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-13 13:34:14,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:14,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:14,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 13:34:14,013 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-13 13:34:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1784240140, now seen corresponding path program 2 times [2022-12-13 13:34:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:14,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428506301] [2022-12-13 13:34:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:14,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:14,293 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-13 13:34:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428506301] [2022-12-13 13:34:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428506301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592780190] [2022-12-13 13:34:14,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:34:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:14,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:14,295 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-13 13:34:14,297 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-13 13:34:14,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:34:14,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:34:14,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 13:34:14,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:14,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:14,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 19 treesize of output 21 [2022-12-13 13:34:14,521 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-13 13:34:14,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:14,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1824) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-12-13 13:34:14,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:14,556 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-13 13:34:14,559 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-13 13:34:14,591 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-13 13:34:14,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592780190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:14,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:14,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 13:34:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93560186] [2022-12-13 13:34:14,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:14,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:34:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:14,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:34:14,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2022-12-13 13:34:14,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-13 13:34:14,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 161 transitions, 2761 flow. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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-13 13:34:14,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:14,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-13 13:34:14,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:15,123 INFO L130 PetriNetUnfolder]: 754/1377 cut-off events. [2022-12-13 13:34:15,123 INFO L131 PetriNetUnfolder]: For 18564/18577 co-relation queries the response was YES. [2022-12-13 13:34:15,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 1377 events. 754/1377 cut-off events. For 18564/18577 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7634 event pairs, 87 based on Foata normal form. 45/1238 useless extension candidates. Maximal degree in co-relation 9343. Up to 692 conditions per place. [2022-12-13 13:34:15,132 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 125 selfloop transitions, 83 changer transitions 1/210 dead transitions. [2022-12-13 13:34:15,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 210 transitions, 3519 flow [2022-12-13 13:34:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:34:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:34:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-13 13:34:15,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2818181818181818 [2022-12-13 13:34:15,133 INFO L175 Difference]: Start difference. First operand has 109 places, 161 transitions, 2761 flow. Second operand 10 states and 93 transitions. [2022-12-13 13:34:15,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 210 transitions, 3519 flow [2022-12-13 13:34:15,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 210 transitions, 3437 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-13 13:34:15,174 INFO L231 Difference]: Finished difference. Result has 113 places, 165 transitions, 2983 flow [2022-12-13 13:34:15,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2681, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2983, PETRI_PLACES=113, PETRI_TRANSITIONS=165} [2022-12-13 13:34:15,175 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-13 13:34:15,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:15,175 INFO L89 Accepts]: Start accepts. Operand has 113 places, 165 transitions, 2983 flow [2022-12-13 13:34:15,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:15,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:15,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 165 transitions, 2983 flow [2022-12-13 13:34:15,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 165 transitions, 2983 flow [2022-12-13 13:34:15,224 INFO L130 PetriNetUnfolder]: 197/550 cut-off events. [2022-12-13 13:34:15,224 INFO L131 PetriNetUnfolder]: For 6639/6693 co-relation queries the response was YES. [2022-12-13 13:34:15,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3435 conditions, 550 events. 197/550 cut-off events. For 6639/6693 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3481 event pairs, 2 based on Foata normal form. 26/489 useless extension candidates. Maximal degree in co-relation 3289. Up to 244 conditions per place. [2022-12-13 13:34:15,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 165 transitions, 2983 flow [2022-12-13 13:34:15,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 13:34:15,229 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:15,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 13:34:15,229 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 165 transitions, 2983 flow [2022-12-13 13:34:15,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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-13 13:34:15,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:15,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:15,235 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-13 13:34:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:15,435 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-13 13:34:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash 401647347, now seen corresponding path program 1 times [2022-12-13 13:34:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:15,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141514106] [2022-12-13 13:34:15,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:15,963 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-13 13:34:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:15,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141514106] [2022-12-13 13:34:15,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141514106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:15,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903678343] [2022-12-13 13:34:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:15,965 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-13 13:34:15,966 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-13 13:34:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:16,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 13:34:16,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:16,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:16,248 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-13 13:34:16,271 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-13 13:34:16,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:16,408 INFO L321 Elim1Store]: treesize reduction 84, result has 61.3 percent of original size [2022-12-13 13:34:16,408 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 166 [2022-12-13 13:34:16,509 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-13 13:34:16,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903678343] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:16,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:16,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 13:34:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176322356] [2022-12-13 13:34:16,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:16,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:34:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:16,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:34:16,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:34:16,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 13:34:16,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 165 transitions, 2983 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-13 13:34:16,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:16,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 13:34:16,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:17,382 INFO L130 PetriNetUnfolder]: 830/1535 cut-off events. [2022-12-13 13:34:17,382 INFO L131 PetriNetUnfolder]: For 22241/22253 co-relation queries the response was YES. [2022-12-13 13:34:17,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11023 conditions, 1535 events. 830/1535 cut-off events. For 22241/22253 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8875 event pairs, 190 based on Foata normal form. 13/1350 useless extension candidates. Maximal degree in co-relation 10647. Up to 1062 conditions per place. [2022-12-13 13:34:17,392 INFO L137 encePairwiseOnDemand]: 12/32 looper letters, 179 selfloop transitions, 27 changer transitions 11/218 dead transitions. [2022-12-13 13:34:17,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 218 transitions, 3917 flow [2022-12-13 13:34:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:34:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:34:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-12-13 13:34:17,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2528409090909091 [2022-12-13 13:34:17,393 INFO L175 Difference]: Start difference. First operand has 112 places, 165 transitions, 2983 flow. Second operand 11 states and 89 transitions. [2022-12-13 13:34:17,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 218 transitions, 3917 flow [2022-12-13 13:34:17,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 218 transitions, 3762 flow, removed 45 selfloop flow, removed 6 redundant places. [2022-12-13 13:34:17,447 INFO L231 Difference]: Finished difference. Result has 122 places, 172 transitions, 3059 flow [2022-12-13 13:34:17,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2847, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3059, PETRI_PLACES=122, PETRI_TRANSITIONS=172} [2022-12-13 13:34:17,447 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-13 13:34:17,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:17,447 INFO L89 Accepts]: Start accepts. Operand has 122 places, 172 transitions, 3059 flow [2022-12-13 13:34:17,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:17,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:17,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 172 transitions, 3059 flow [2022-12-13 13:34:17,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 172 transitions, 3059 flow [2022-12-13 13:34:17,504 INFO L130 PetriNetUnfolder]: 212/601 cut-off events. [2022-12-13 13:34:17,505 INFO L131 PetriNetUnfolder]: For 6554/6590 co-relation queries the response was YES. [2022-12-13 13:34:17,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3711 conditions, 601 events. 212/601 cut-off events. For 6554/6590 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3961 event pairs, 2 based on Foata normal form. 24/532 useless extension candidates. Maximal degree in co-relation 3645. Up to 265 conditions per place. [2022-12-13 13:34:17,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 172 transitions, 3059 flow [2022-12-13 13:34:17,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-13 13:34:17,514 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,514 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 [696] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_555| v_~q~0.base_386))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_385 (* 4 v_~q_front~0_626))))) (and (not (= .cse0 0)) (= (+ 2 v_~q_front~0_626) v_~q_front~0_624) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_357| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_323| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|) (not (= (ite (and (< v_~q_front~0_626 v_~q_back~0_787) (<= 0 v_~q_front~0_626) (< v_~q_front~0_626 v_~n~0_391)) 1 0) 0)) (= (select .cse1 (+ (- 4) v_~q~0.offset_385 (* 4 v_~q_front~0_624))) |v_thread2Thread1of1ForFork1_~j~0#1_357|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_323| (ite (and (< v_~q_front~0_624 (+ v_~q_back~0_787 1)) (<= 1 v_~q_front~0_624) (< v_~q_front~0_624 (+ v_~n~0_391 1))) 1 0)) (= (+ .cse0 v_~s~0_566 |v_thread2Thread1of1ForFork1_~j~0#1_357|) v_~s~0_564)))) InVars {~q_back~0=v_~q_back~0_787, #memory_int=|v_#memory_int_555|, ~q~0.base=v_~q~0.base_386, ~n~0=v_~n~0_391, ~q~0.offset=v_~q~0.offset_385, ~s~0=v_~s~0_566, ~q_front~0=v_~q_front~0_626} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_357|, ~q_back~0=v_~q_back~0_787, #memory_int=|v_#memory_int_555|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_323|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_323|, ~q~0.base=v_~q~0.base_386, ~n~0=v_~n~0_391, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_323|, ~q~0.offset=v_~q~0.offset_385, ~s~0=v_~s~0_564, ~q_front~0=v_~q_front~0_624} 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-13 13:34:17,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_548| v_~q~0.base_382)) (.cse3 (* 4 v_~q_front~0_609))) (let ((.cse1 (* v_~q_back~0_771 4)) (.cse5 (+ v_~q_back~0_771 4)) (.cse2 (select .cse0 (+ .cse3 v_~q~0.offset_381)))) (and (not (= (ite (and (<= 0 v_~q_front~0_609) (< v_~q_front~0_609 (+ v_~q_back~0_771 1)) (< v_~q_front~0_609 v_~n~0_387)) 1 0) 0)) (= (+ 3 v_~q_front~0_609) v_~q_front~0_607) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_381)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_381)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_390| 4) (not (= .cse2 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_607) (- 4) v_~q~0.offset_381)) |v_thread2Thread1of1ForFork1_~j~0#1_342|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_368| 0)) (= (+ (select .cse0 (+ .cse3 v_~q~0.offset_381 4)) .cse2 v_~s~0_548 |v_thread2Thread1of1ForFork1_~j~0#1_342|) v_~s~0_546) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_342| 0)) (not (= (ite (let ((.cse4 (+ 3 v_~q_back~0_771))) (and (< .cse4 v_~n~0_387) (<= 0 .cse4))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_310| (ite (and (< v_~q_front~0_607 .cse5) (< v_~q_front~0_607 (+ v_~n~0_387 1)) (<= 1 v_~q_front~0_607)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_368| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_368|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_381 4)) 1) 1 0) 0)) (< 3 v_~N~0_301) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_368| (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_381)) 1) 1 0)) (= v_~q_back~0_769 .cse5) (not (= (+ .cse2 v_~s~0_548 |v_thread2Thread1of1ForFork1_~j~0#1_342|) v_~s~0_546)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_310| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|)))) InVars {~q_back~0=v_~q_back~0_771, #memory_int=|v_#memory_int_548|, ~N~0=v_~N~0_301, ~q~0.base=v_~q~0.base_382, ~n~0=v_~n~0_387, ~q~0.offset=v_~q~0.offset_381, ~s~0=v_~s~0_548, ~q_front~0=v_~q_front~0_609} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_342|, ~q_back~0=v_~q_back~0_769, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_310|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_255|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_310|, ~N~0=v_~N~0_301, ~q~0.base=v_~q~0.base_382, ~q~0.offset=v_~q~0.offset_381, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_310|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_368|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_259|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_255|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_390|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_368|, #memory_int=|v_#memory_int_548|, ~n~0=v_~n~0_387, ~s~0=v_~s~0_546, ~q_front~0=v_~q_front~0_607} 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-13 13:34:17,800 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,800 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,800 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,800 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,800 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:17,800 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,267 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,268 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,268 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,268 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,268 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,268 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:18,765 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:34:18,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1318 [2022-12-13 13:34:18,766 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 170 transitions, 3075 flow [2022-12-13 13:34:18,766 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-13 13:34:18,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:18,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:18,773 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-13 13:34:18,971 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,SelfDestructingSolverStorable56 [2022-12-13 13:34:18,971 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-13 13:34:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1793258636, now seen corresponding path program 1 times [2022-12-13 13:34:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:18,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617509289] [2022-12-13 13:34:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:19,250 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-13 13:34:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617509289] [2022-12-13 13:34:19,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617509289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:19,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:19,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:34:19,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706785890] [2022-12-13 13:34:19,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:19,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:34:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:19,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:34:19,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:34:19,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 13:34:19,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 170 transitions, 3075 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-13 13:34:19,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:19,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 13:34:19,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:19,550 INFO L130 PetriNetUnfolder]: 818/1510 cut-off events. [2022-12-13 13:34:19,550 INFO L131 PetriNetUnfolder]: For 20991/21017 co-relation queries the response was YES. [2022-12-13 13:34:19,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10693 conditions, 1510 events. 818/1510 cut-off events. For 20991/21017 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8675 event pairs, 190 based on Foata normal form. 27/1341 useless extension candidates. Maximal degree in co-relation 10443. Up to 1459 conditions per place. [2022-12-13 13:34:19,558 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 158 selfloop transitions, 14 changer transitions 7/180 dead transitions. [2022-12-13 13:34:19,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 3506 flow [2022-12-13 13:34:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:34:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:34:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 13:34:19,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2914285714285714 [2022-12-13 13:34:19,559 INFO L175 Difference]: Start difference. First operand has 118 places, 170 transitions, 3075 flow. Second operand 5 states and 51 transitions. [2022-12-13 13:34:19,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 3506 flow [2022-12-13 13:34:19,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 180 transitions, 3440 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:19,613 INFO L231 Difference]: Finished difference. Result has 117 places, 170 transitions, 3032 flow [2022-12-13 13:34:19,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3009, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3032, PETRI_PLACES=117, PETRI_TRANSITIONS=170} [2022-12-13 13:34:19,614 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2022-12-13 13:34:19,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:19,614 INFO L89 Accepts]: Start accepts. Operand has 117 places, 170 transitions, 3032 flow [2022-12-13 13:34:19,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:19,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:19,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 170 transitions, 3032 flow [2022-12-13 13:34:19,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 170 transitions, 3032 flow [2022-12-13 13:34:19,669 INFO L130 PetriNetUnfolder]: 212/599 cut-off events. [2022-12-13 13:34:19,670 INFO L131 PetriNetUnfolder]: For 6447/6482 co-relation queries the response was YES. [2022-12-13 13:34:19,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 599 events. 212/599 cut-off events. For 6447/6482 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3946 event pairs, 2 based on Foata normal form. 24/530 useless extension candidates. Maximal degree in co-relation 3611. Up to 267 conditions per place. [2022-12-13 13:34:19,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 170 transitions, 3032 flow [2022-12-13 13:34:19,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 13:34:19,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_559| v_~q~0.base_390)) (.cse5 (* 4 v_~q_front~0_636))) (let ((.cse6 (select .cse1 (+ .cse5 v_~q~0.offset_389))) (.cse0 (select .cse1 (+ .cse5 v_~q~0.offset_389 4))) (.cse2 (* v_~q_back~0_794 4))) (and (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_329| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|) (= (+ v_~q_back~0_794 4) v_~q_back~0_793) (not (= (ite (and (<= 0 v_~q_front~0_636) (< v_~q_front~0_636 (+ v_~q_back~0_794 1)) (< v_~q_front~0_636 v_~n~0_395)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_405| 4) (= (+ 4 v_~q_front~0_636) v_~q_front~0_634) (not (= (ite (= 1 (select .cse1 (+ .cse2 8 v_~q~0.offset_389))) 1 0) 0)) (not (= (ite (let ((.cse3 (+ 3 v_~q_back~0_794))) (and (<= 0 .cse3) (< .cse3 v_~n~0_395))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_329| (ite (let ((.cse4 (+ 3 v_~q_front~0_636))) (and (<= 0 .cse4) (< .cse4 v_~q_back~0_793) (< .cse4 v_~n~0_395))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_384| 0)) (= (select .cse1 (+ .cse5 12 v_~q~0.offset_389)) |v_thread2Thread1of1ForFork1_~j~0#1_363|) (not (= .cse6 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_384| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_384|) (< 3 v_~N~0_307) (= v_~s~0_574 (+ .cse6 .cse0 (select .cse1 (+ .cse5 8 v_~q~0.offset_389)) v_~s~0_576 |v_thread2Thread1of1ForFork1_~j~0#1_363|)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_363| 0)) (not (= (+ .cse6 .cse0 v_~s~0_576 |v_thread2Thread1of1ForFork1_~j~0#1_363|) v_~s~0_574)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_389 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_389)) 1) 1 0) 0)) (= (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_389)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_384|)))) InVars {~q_back~0=v_~q_back~0_794, #memory_int=|v_#memory_int_559|, ~N~0=v_~N~0_307, ~q~0.base=v_~q~0.base_390, ~n~0=v_~n~0_395, ~q~0.offset=v_~q~0.offset_389, ~s~0=v_~s~0_576, ~q_front~0=v_~q_front~0_636} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_363|, ~q_back~0=v_~q_back~0_793, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_329|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_329|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_268|, ~N~0=v_~N~0_307, ~q~0.base=v_~q~0.base_390, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_329|, ~q~0.offset=v_~q~0.offset_389, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_329|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_384|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_272|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_268|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_405|, #memory_int=|v_#memory_int_559|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_384|, ~n~0=v_~n~0_395, ~s~0=v_~s~0_574, ~q_front~0=v_~q_front~0_634} 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-13 13:34:20,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:34:20,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 564 [2022-12-13 13:34:20,178 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 169 transitions, 3022 flow [2022-12-13 13:34:20,178 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-13 13:34:20,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:20,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:20,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 13:34:20,178 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-13 13:34:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash -584150189, now seen corresponding path program 1 times [2022-12-13 13:34:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:20,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450897886] [2022-12-13 13:34:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:20,233 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-13 13:34:20,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:20,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450897886] [2022-12-13 13:34:20,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450897886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:20,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:20,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:34:20,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912895156] [2022-12-13 13:34:20,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:20,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:34:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:34:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:34:20,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-13 13:34:20,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 169 transitions, 3022 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-13 13:34:20,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:20,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-13 13:34:20,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:20,468 INFO L130 PetriNetUnfolder]: 821/1519 cut-off events. [2022-12-13 13:34:20,468 INFO L131 PetriNetUnfolder]: For 21717/21750 co-relation queries the response was YES. [2022-12-13 13:34:20,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10690 conditions, 1519 events. 821/1519 cut-off events. For 21717/21750 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8660 event pairs, 157 based on Foata normal form. 27/1344 useless extension candidates. Maximal degree in co-relation 10585. Up to 1193 conditions per place. [2022-12-13 13:34:20,478 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 148 selfloop transitions, 27 changer transitions 7/183 dead transitions. [2022-12-13 13:34:20,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 183 transitions, 3499 flow [2022-12-13 13:34:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:34:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:34:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-13 13:34:20,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2022-12-13 13:34:20,479 INFO L175 Difference]: Start difference. First operand has 114 places, 169 transitions, 3022 flow. Second operand 5 states and 55 transitions. [2022-12-13 13:34:20,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 183 transitions, 3499 flow [2022-12-13 13:34:20,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 183 transitions, 3455 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:20,526 INFO L231 Difference]: Finished difference. Result has 116 places, 166 transitions, 3008 flow [2022-12-13 13:34:20,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3008, PETRI_PLACES=116, PETRI_TRANSITIONS=166} [2022-12-13 13:34:20,526 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-13 13:34:20,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:20,527 INFO L89 Accepts]: Start accepts. Operand has 116 places, 166 transitions, 3008 flow [2022-12-13 13:34:20,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:20,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:20,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 166 transitions, 3008 flow [2022-12-13 13:34:20,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 166 transitions, 3008 flow [2022-12-13 13:34:20,607 INFO L130 PetriNetUnfolder]: 212/598 cut-off events. [2022-12-13 13:34:20,607 INFO L131 PetriNetUnfolder]: For 6831/6865 co-relation queries the response was YES. [2022-12-13 13:34:20,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 598 events. 212/598 cut-off events. For 6831/6865 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3893 event pairs, 2 based on Foata normal form. 24/527 useless extension candidates. Maximal degree in co-relation 3620. Up to 266 conditions per place. [2022-12-13 13:34:20,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 166 transitions, 3008 flow [2022-12-13 13:34:20,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 13:34:20,614 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:20,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 13:34:20,615 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 166 transitions, 3008 flow [2022-12-13 13:34:20,615 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-13 13:34:20,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:20,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:20,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 13:34:20,615 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-13 13:34:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash 370408422, now seen corresponding path program 1 times [2022-12-13 13:34:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559437230] [2022-12-13 13:34:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:21,366 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-13 13:34:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559437230] [2022-12-13 13:34:21,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559437230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871870704] [2022-12-13 13:34:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:21,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:21,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:21,368 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-13 13:34:21,369 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-13 13:34:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:21,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 13:34:21,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:21,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:21,562 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-13 13:34:21,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:21,632 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-13 13:34:21,676 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-13 13:34:21,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:21,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q_front~0 4))) (let ((.cse1 (+ c_~q~0.offset (* 4 c_~q_back~0))) (.cse3 (+ .cse7 c_~q~0.offset 4)) (.cse4 (+ .cse7 c_~q~0.offset))) (and (forall ((v_ArrVal_1975 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1975) c_~q~0.base))) (let ((.cse2 (select .cse0 .cse4))) (or (not (= (select .cse0 .cse1) 1)) (= .cse2 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| (+ c_~s~0 .cse2 (select .cse0 .cse3))))))) (forall ((v_ArrVal_1975 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1975) c_~q~0.base))) (let ((.cse6 (select .cse5 .cse4))) (or (not (= (select .cse5 .cse1) 1)) (= .cse6 0) (< (+ c_~s~0 .cse6 (select .cse5 .cse3)) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|))))))))) is different from false [2022-12-13 13:34:21,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:21,819 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 244 treesize of output 220 [2022-12-13 13:34:21,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:21,831 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 163 treesize of output 164 [2022-12-13 13:34:21,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:21,842 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 137 treesize of output 138 [2022-12-13 13:34:22,147 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-13 13:34:22,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871870704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:22,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:22,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:34:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897980941] [2022-12-13 13:34:22,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:22,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:34:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:34:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2022-12-13 13:34:22,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 13:34:22,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 166 transitions, 3008 flow. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:34:22,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:22,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 13:34:22,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:22,821 INFO L130 PetriNetUnfolder]: 837/1573 cut-off events. [2022-12-13 13:34:22,821 INFO L131 PetriNetUnfolder]: For 21936/21963 co-relation queries the response was YES. [2022-12-13 13:34:22,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11201 conditions, 1573 events. 837/1573 cut-off events. For 21936/21963 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9260 event pairs, 193 based on Foata normal form. 30/1403 useless extension candidates. Maximal degree in co-relation 10670. Up to 1422 conditions per place. [2022-12-13 13:34:22,831 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 147 selfloop transitions, 33 changer transitions 10/191 dead transitions. [2022-12-13 13:34:22,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 191 transitions, 3555 flow [2022-12-13 13:34:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:34:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:34:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-12-13 13:34:22,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22903225806451613 [2022-12-13 13:34:22,832 INFO L175 Difference]: Start difference. First operand has 114 places, 166 transitions, 3008 flow. Second operand 10 states and 71 transitions. [2022-12-13 13:34:22,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 191 transitions, 3555 flow [2022-12-13 13:34:22,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 191 transitions, 3476 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:22,883 INFO L231 Difference]: Finished difference. Result has 120 places, 166 transitions, 2997 flow [2022-12-13 13:34:22,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2933, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2997, PETRI_PLACES=120, PETRI_TRANSITIONS=166} [2022-12-13 13:34:22,883 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-13 13:34:22,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:22,883 INFO L89 Accepts]: Start accepts. Operand has 120 places, 166 transitions, 2997 flow [2022-12-13 13:34:22,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:22,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:22,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 166 transitions, 2997 flow [2022-12-13 13:34:22,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 166 transitions, 2997 flow [2022-12-13 13:34:22,940 INFO L130 PetriNetUnfolder]: 208/605 cut-off events. [2022-12-13 13:34:22,940 INFO L131 PetriNetUnfolder]: For 6866/6900 co-relation queries the response was YES. [2022-12-13 13:34:22,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 605 events. 208/605 cut-off events. For 6866/6900 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3997 event pairs, 2 based on Foata normal form. 24/534 useless extension candidates. Maximal degree in co-relation 3606. Up to 265 conditions per place. [2022-12-13 13:34:22,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 166 transitions, 2997 flow [2022-12-13 13:34:22,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-13 13:34:22,946 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:22,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 13:34:22,946 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 166 transitions, 2997 flow [2022-12-13 13:34:22,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:34:22,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:22,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:22,951 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-13 13:34:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 13:34:23,147 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-13 13:34:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -443631836, now seen corresponding path program 2 times [2022-12-13 13:34:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:23,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519031373] [2022-12-13 13:34:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:23,799 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-13 13:34:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519031373] [2022-12-13 13:34:23,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519031373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4591895] [2022-12-13 13:34:23,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:34:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:23,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:23,801 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-13 13:34:23,802 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-13 13:34:23,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:34:23,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:34:23,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:34:23,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:24,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:24,012 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-13 13:34:24,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:24,117 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-13 13:34:24,144 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-13 13:34:24,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:24,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:24,352 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 244 treesize of output 220 [2022-12-13 13:34:24,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:24,365 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 163 treesize of output 164 [2022-12-13 13:34:24,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:24,377 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 137 treesize of output 138 [2022-12-13 13:34:24,694 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-13 13:34:24,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4591895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:24,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:24,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:34:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931684967] [2022-12-13 13:34:24,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:24,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:34:24,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:34:24,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=322, Unknown=7, NotChecked=0, Total=380 [2022-12-13 13:34:24,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 13:34:24,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 166 transitions, 2997 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-13 13:34:24,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:24,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 13:34:24,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:25,376 INFO L130 PetriNetUnfolder]: 817/1524 cut-off events. [2022-12-13 13:34:25,376 INFO L131 PetriNetUnfolder]: For 21786/21813 co-relation queries the response was YES. [2022-12-13 13:34:25,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10665 conditions, 1524 events. 817/1524 cut-off events. For 21786/21813 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8849 event pairs, 190 based on Foata normal form. 29/1353 useless extension candidates. Maximal degree in co-relation 10541. Up to 1423 conditions per place. [2022-12-13 13:34:25,385 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 142 selfloop transitions, 24 changer transitions 13/180 dead transitions. [2022-12-13 13:34:25,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 180 transitions, 3410 flow [2022-12-13 13:34:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:34:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:34:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-12-13 13:34:25,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24193548387096775 [2022-12-13 13:34:25,390 INFO L175 Difference]: Start difference. First operand has 119 places, 166 transitions, 2997 flow. Second operand 8 states and 60 transitions. [2022-12-13 13:34:25,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 180 transitions, 3410 flow [2022-12-13 13:34:25,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 180 transitions, 3299 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:25,446 INFO L231 Difference]: Finished difference. Result has 118 places, 160 transitions, 2819 flow [2022-12-13 13:34:25,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2881, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2819, PETRI_PLACES=118, PETRI_TRANSITIONS=160} [2022-12-13 13:34:25,446 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2022-12-13 13:34:25,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:25,446 INFO L89 Accepts]: Start accepts. Operand has 118 places, 160 transitions, 2819 flow [2022-12-13 13:34:25,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:25,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:25,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 160 transitions, 2819 flow [2022-12-13 13:34:25,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 160 transitions, 2819 flow [2022-12-13 13:34:25,501 INFO L130 PetriNetUnfolder]: 207/592 cut-off events. [2022-12-13 13:34:25,501 INFO L131 PetriNetUnfolder]: For 6668/6702 co-relation queries the response was YES. [2022-12-13 13:34:25,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 592 events. 207/592 cut-off events. For 6668/6702 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3845 event pairs, 2 based on Foata normal form. 24/521 useless extension candidates. Maximal degree in co-relation 3455. Up to 261 conditions per place. [2022-12-13 13:34:25,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 160 transitions, 2819 flow [2022-12-13 13:34:25,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-13 13:34:25,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:25,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 13:34:25,508 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 160 transitions, 2819 flow [2022-12-13 13:34:25,508 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-13 13:34:25,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:25,508 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:25,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 13:34:25,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:25,713 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-13 13:34:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1474512727, now seen corresponding path program 1 times [2022-12-13 13:34:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:25,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585138972] [2022-12-13 13:34:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:26,099 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-13 13:34:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585138972] [2022-12-13 13:34:26,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585138972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:26,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110625627] [2022-12-13 13:34:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:26,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:26,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:26,101 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-13 13:34:26,103 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-13 13:34:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:26,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 13:34:26,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:26,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2022-12-13 13:34:26,266 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-13 13:34:26,288 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-13 13:34:26,542 INFO L321 Elim1Store]: treesize reduction 212, result has 5.8 percent of original size [2022-12-13 13:34:26,542 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 91 treesize of output 32 [2022-12-13 13:34:26,567 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-13 13:34:26,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:26,908 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-13 13:34:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110625627] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:26,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:26,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:34:26,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107005108] [2022-12-13 13:34:26,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:26,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:34:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:26,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:34:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=316, Unknown=1, NotChecked=0, Total=380 [2022-12-13 13:34:26,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 13:34:26,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 160 transitions, 2819 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-13 13:34:26,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:26,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 13:34:26,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:27,826 INFO L130 PetriNetUnfolder]: 822/1530 cut-off events. [2022-12-13 13:34:27,826 INFO L131 PetriNetUnfolder]: For 22019/22052 co-relation queries the response was YES. [2022-12-13 13:34:27,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10691 conditions, 1530 events. 822/1530 cut-off events. For 22019/22052 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8715 event pairs, 154 based on Foata normal form. 11/1339 useless extension candidates. Maximal degree in co-relation 10378. Up to 851 conditions per place. [2022-12-13 13:34:27,836 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 186 selfloop transitions, 32 changer transitions 4/223 dead transitions. [2022-12-13 13:34:27,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 223 transitions, 3824 flow [2022-12-13 13:34:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:34:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:34:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-12-13 13:34:27,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24813895781637718 [2022-12-13 13:34:27,837 INFO L175 Difference]: Start difference. First operand has 115 places, 160 transitions, 2819 flow. Second operand 13 states and 100 transitions. [2022-12-13 13:34:27,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 223 transitions, 3824 flow [2022-12-13 13:34:27,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 223 transitions, 3758 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 13:34:27,884 INFO L231 Difference]: Finished difference. Result has 126 places, 169 transitions, 3002 flow [2022-12-13 13:34:27,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2755, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3002, PETRI_PLACES=126, PETRI_TRANSITIONS=169} [2022-12-13 13:34:27,885 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 105 predicate places. [2022-12-13 13:34:27,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:27,885 INFO L89 Accepts]: Start accepts. Operand has 126 places, 169 transitions, 3002 flow [2022-12-13 13:34:27,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:27,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:27,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 169 transitions, 3002 flow [2022-12-13 13:34:27,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 169 transitions, 3002 flow [2022-12-13 13:34:27,949 INFO L130 PetriNetUnfolder]: 207/603 cut-off events. [2022-12-13 13:34:27,949 INFO L131 PetriNetUnfolder]: For 7268/7302 co-relation queries the response was YES. [2022-12-13 13:34:27,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3788 conditions, 603 events. 207/603 cut-off events. For 7268/7302 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4001 event pairs, 2 based on Foata normal form. 24/565 useless extension candidates. Maximal degree in co-relation 3658. Up to 261 conditions per place. [2022-12-13 13:34:27,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 169 transitions, 3002 flow [2022-12-13 13:34:27,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-13 13:34:29,815 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:29,815 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:29,904 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:29,904 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:29,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:34:30,117 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:30,117 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:30,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 [710] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_584| v_~q~0.base_404)) (.cse2 (* 4 v_~q_front~0_685))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_403 .cse2)))) (and (not (= .cse0 0)) (= (select .cse1 (+ (- 4) (* 4 v_~q_front~0_683) v_~q~0.offset_403)) |v_thread2Thread1of1ForFork1_~j~0#1_397|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_360| (ite (and (< v_~q_front~0_683 (+ v_~n~0_409 1)) (<= 1 v_~q_front~0_683) (< v_~q_front~0_683 (+ v_~q_back~0_830 1))) 1 0)) (= (+ 3 v_~q_front~0_685) v_~q_front~0_683) (not (= (+ .cse0 v_~s~0_628 |v_thread2Thread1of1ForFork1_~j~0#1_397|) v_~s~0_626)) (= v_~s~0_626 (+ (select .cse1 (+ v_~q~0.offset_403 .cse2 4)) .cse0 v_~s~0_628 |v_thread2Thread1of1ForFork1_~j~0#1_397|)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_397| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_360| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|) (not (= (ite (and (< v_~q_front~0_685 v_~n~0_409) (< v_~q_front~0_685 v_~q_back~0_830) (<= 0 v_~q_front~0_685)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_830, #memory_int=|v_#memory_int_584|, ~q~0.base=v_~q~0.base_404, ~n~0=v_~n~0_409, ~q~0.offset=v_~q~0.offset_403, ~s~0=v_~s~0_628, ~q_front~0=v_~q_front~0_685} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_397|, ~q_back~0=v_~q_back~0_830, #memory_int=|v_#memory_int_584|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_360|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_360|, ~q~0.base=v_~q~0.base_404, ~n~0=v_~n~0_409, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_360|, ~q~0.offset=v_~q~0.offset_403, ~s~0=v_~s~0_626, ~q_front~0=v_~q_front~0_683} 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-13 13:34:30,551 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:30,551 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:30,551 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:30,551 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:31,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [694] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_550| v_~q~0.base_384)) (.cse6 (* 4 v_~q_front~0_614))) (let ((.cse3 (select .cse1 (+ .cse6 v_~q~0.offset_383))) (.cse5 (< v_~q_front~0_614 (+ v_~q_back~0_777 1))) (.cse2 (* v_~q_back~0_777 4))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_394| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_372|) (not (= (ite (let ((.cse0 (+ 3 v_~q_back~0_777))) (and (<= 0 .cse0) (< .cse0 v_~n~0_389))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_383)) 1) 1 0) 0)) (not (= 0 .cse3)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_346| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_314| (ite (let ((.cse4 (+ 1 v_~q_front~0_614))) (and (<= 0 .cse4) .cse5 (< .cse4 v_~n~0_389))) 1 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_383 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_383)) 1) 1 0) 0)) (= (select .cse1 (+ .cse6 v_~q~0.offset_383 4)) |v_thread2Thread1of1ForFork1_~j~0#1_346|) (< 3 v_~N~0_303) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_314| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_314|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_372| 0)) (= v_~s~0_552 (+ v_~s~0_553 |v_thread2Thread1of1ForFork1_~j~0#1_346| .cse3)) (not (= (ite (and (< v_~q_front~0_614 v_~n~0_389) .cse5 (<= 0 v_~q_front~0_614)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372| (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_383)) 1) 1 0)) (= (+ 2 v_~q_front~0_614) v_~q_front~0_613) (= v_~q_back~0_775 (+ v_~q_back~0_777 4))))) InVars {~q_back~0=v_~q_back~0_777, #memory_int=|v_#memory_int_550|, ~N~0=v_~N~0_303, ~q~0.base=v_~q~0.base_384, ~n~0=v_~n~0_389, ~q~0.offset=v_~q~0.offset_383, ~s~0=v_~s~0_553, ~q_front~0=v_~q_front~0_614} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_346|, ~q_back~0=v_~q_back~0_775, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_314|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_259|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_314|, ~N~0=v_~N~0_303, ~q~0.base=v_~q~0.base_384, ~q~0.offset=v_~q~0.offset_383, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_314|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_314|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_263|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_259|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_394|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_372|, #memory_int=|v_#memory_int_550|, ~n~0=v_~n~0_389, ~s~0=v_~s~0_552, ~q_front~0=v_~q_front~0_613} 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-13 13:34:32,099 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:32,100 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:32,100 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:32,100 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:32,100 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:32,100 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:32,411 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 13:34:32,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4526 [2022-12-13 13:34:32,412 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 162 transitions, 2969 flow [2022-12-13 13:34:32,412 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-13 13:34:32,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:32,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:32,418 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-13 13:34:32,612 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,SelfDestructingSolverStorable61 [2022-12-13 13:34:32,612 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-13 13:34:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash -995003606, now seen corresponding path program 1 times [2022-12-13 13:34:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:32,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732611120] [2022-12-13 13:34:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:32,957 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-13 13:34:32,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732611120] [2022-12-13 13:34:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732611120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686900896] [2022-12-13 13:34:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:32,959 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-13 13:34:32,961 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-13 13:34:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:33,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-13 13:34:33,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:33,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2022-12-13 13:34:33,134 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-13 13:34:33,160 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-13 13:34:33,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:33,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 20 [2022-12-13 13:34:33,293 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-13 13:34:33,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:33,528 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-13 13:34:33,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686900896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:33,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:33,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:34:33,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024621790] [2022-12-13 13:34:33,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:33,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:34:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:34:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2022-12-13 13:34:33,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 13:34:33,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 162 transitions, 2969 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-13 13:34:33,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:33,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 13:34:33,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:34,668 INFO L130 PetriNetUnfolder]: 987/1858 cut-off events. [2022-12-13 13:34:34,669 INFO L131 PetriNetUnfolder]: For 30773/30846 co-relation queries the response was YES. [2022-12-13 13:34:34,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13532 conditions, 1858 events. 987/1858 cut-off events. For 30773/30846 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11298 event pairs, 245 based on Foata normal form. 29/1747 useless extension candidates. Maximal degree in co-relation 13211. Up to 1091 conditions per place. [2022-12-13 13:34:34,682 INFO L137 encePairwiseOnDemand]: 12/35 looper letters, 210 selfloop transitions, 72 changer transitions 25/308 dead transitions. [2022-12-13 13:34:34,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 308 transitions, 5289 flow [2022-12-13 13:34:34,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:34:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:34:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 157 transitions. [2022-12-13 13:34:34,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2492063492063492 [2022-12-13 13:34:34,683 INFO L175 Difference]: Start difference. First operand has 119 places, 162 transitions, 2969 flow. Second operand 18 states and 157 transitions. [2022-12-13 13:34:34,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 308 transitions, 5289 flow [2022-12-13 13:34:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 308 transitions, 5033 flow, removed 91 selfloop flow, removed 6 redundant places. [2022-12-13 13:34:34,751 INFO L231 Difference]: Finished difference. Result has 144 places, 222 transitions, 4062 flow [2022-12-13 13:34:34,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4062, PETRI_PLACES=144, PETRI_TRANSITIONS=222} [2022-12-13 13:34:34,751 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-13 13:34:34,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:34,751 INFO L89 Accepts]: Start accepts. Operand has 144 places, 222 transitions, 4062 flow [2022-12-13 13:34:34,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:34,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:34,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 222 transitions, 4062 flow [2022-12-13 13:34:34,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 222 transitions, 4062 flow [2022-12-13 13:34:34,825 INFO L130 PetriNetUnfolder]: 237/709 cut-off events. [2022-12-13 13:34:34,826 INFO L131 PetriNetUnfolder]: For 10840/10914 co-relation queries the response was YES. [2022-12-13 13:34:34,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 709 events. 237/709 cut-off events. For 10840/10914 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4996 event pairs, 2 based on Foata normal form. 28/711 useless extension candidates. Maximal degree in co-relation 4892. Up to 305 conditions per place. [2022-12-13 13:34:34,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 222 transitions, 4062 flow [2022-12-13 13:34:34,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-13 13:34:34,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_588| v_~q~0.base_408)) (.cse5 (* 4 v_~q_front~0_694))) (let ((.cse2 (< v_~q_front~0_694 (+ v_~q_back~0_838 1))) (.cse6 (select .cse0 (+ .cse5 v_~q~0.offset_407))) (.cse1 (* v_~q_back~0_838 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_409| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_409|) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_407)) 1) 1 0))) (= (+ 2 v_~q_front~0_694) v_~q_front~0_693) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| (ite (let ((.cse3 (+ 1 v_~q_front~0_694))) (and .cse2 (<= 0 .cse3) (< .cse3 v_~n~0_413))) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_407 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_409| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_409| (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_407)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_429| 5) (not (= (ite (let ((.cse4 (+ v_~q_back~0_838 4))) (and (< .cse4 v_~n~0_413) (<= 0 .cse4))) 1 0) 0)) (not (= (ite (and .cse2 (< v_~q_front~0_694 v_~n~0_413) (<= 0 v_~q_front~0_694)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_407)) 1) 1 0) 0)) (= (select .cse0 (+ .cse5 v_~q~0.offset_407 4)) |v_thread2Thread1of1ForFork1_~j~0#1_403|) (= v_~q_back~0_836 (+ 5 v_~q_back~0_838)) (< |v_thread1Thread1of1ForFork0_~i~0#1_429| (+ v_~N~0_319 1)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_403| 0)) (= (+ .cse6 v_~s~0_637 |v_thread2Thread1of1ForFork1_~j~0#1_403|) v_~s~0_636) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|) (not (= .cse6 0)) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_407)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_838, #memory_int=|v_#memory_int_588|, ~N~0=v_~N~0_319, ~q~0.base=v_~q~0.base_408, ~n~0=v_~n~0_413, ~q~0.offset=v_~q~0.offset_407, ~s~0=v_~s~0_637, ~q_front~0=v_~q_front~0_694} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_403|, ~q_back~0=v_~q_back~0_836, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_286|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_366|, ~N~0=v_~N~0_319, ~q~0.base=v_~q~0.base_408, ~q~0.offset=v_~q~0.offset_407, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_366|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_409|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_290|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_286|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_429|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_409|, #memory_int=|v_#memory_int_588|, ~n~0=v_~n~0_413, ~s~0=v_~s~0_636, ~q_front~0=v_~q_front~0_693} 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-13 13:34:35,322 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,322 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,322 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,322 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,322 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,322 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [715] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_592| v_~q~0.base_412)) (.cse3 (* 4 v_~q_front~0_705))) (let ((.cse2 (* v_~q_back~0_849 4)) (.cse0 (select .cse1 (+ v_~q~0.offset_411 .cse3)))) (and (not (= .cse0 0)) (= (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_411)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417|) (not (= (ite (and (< v_~q_front~0_705 (+ v_~q_back~0_849 1)) (< v_~q_front~0_705 v_~n~0_417) (<= 0 v_~q_front~0_705)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_409| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_417|) (= (+ .cse0 (select .cse1 (+ v_~q~0.offset_411 .cse3 4)) v_~s~0_648 |v_thread2Thread1of1ForFork1_~j~0#1_409|) v_~s~0_646) (< 3 v_~N~0_323) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_411 4)) 1) 1 0) 0)) (= (+ v_~q_back~0_849 4) v_~q_back~0_848) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_411)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| (ite (and (< v_~q_front~0_703 (+ v_~n~0_417 1)) (<= 1 v_~q_front~0_703) (< v_~q_front~0_703 (+ v_~q_back~0_848 1))) 1 0)) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_411)) 1) 1 0) 0)) (= (+ 3 v_~q_front~0_705) v_~q_front~0_703) (= |v_thread1Thread1of1ForFork0_~i~0#1_435| 4) (not (= (ite (let ((.cse4 (+ 3 v_~q_back~0_849))) (and (< .cse4 v_~n~0_417) (<= 0 .cse4))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_417| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|) (not (= (+ .cse0 v_~s~0_648 |v_thread2Thread1of1ForFork1_~j~0#1_409|) v_~s~0_646)) (= (select .cse1 (+ (- 4) v_~q~0.offset_411 (* 4 v_~q_front~0_703))) |v_thread2Thread1of1ForFork1_~j~0#1_409|)))) InVars {~q_back~0=v_~q_back~0_849, #memory_int=|v_#memory_int_592|, ~N~0=v_~N~0_323, ~q~0.base=v_~q~0.base_412, ~n~0=v_~n~0_417, ~q~0.offset=v_~q~0.offset_411, ~s~0=v_~s~0_648, ~q_front~0=v_~q_front~0_705} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_409|, ~q_back~0=v_~q_back~0_848, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_372|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_292|, ~N~0=v_~N~0_323, ~q~0.base=v_~q~0.base_412, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_372|, ~q~0.offset=v_~q~0.offset_411, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_296|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_292|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_435|, #memory_int=|v_#memory_int_592|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_417|, ~n~0=v_~n~0_417, ~s~0=v_~s~0_646, ~q_front~0=v_~q_front~0_703} 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-13 13:34:35,821 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,821 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,822 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,822 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,822 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:35,822 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:36,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [715] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_592| v_~q~0.base_412)) (.cse3 (* 4 v_~q_front~0_705))) (let ((.cse2 (* v_~q_back~0_849 4)) (.cse0 (select .cse1 (+ v_~q~0.offset_411 .cse3)))) (and (not (= .cse0 0)) (= (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_411)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417|) (not (= (ite (and (< v_~q_front~0_705 (+ v_~q_back~0_849 1)) (< v_~q_front~0_705 v_~n~0_417) (<= 0 v_~q_front~0_705)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_409| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_417|) (= (+ .cse0 (select .cse1 (+ v_~q~0.offset_411 .cse3 4)) v_~s~0_648 |v_thread2Thread1of1ForFork1_~j~0#1_409|) v_~s~0_646) (< 3 v_~N~0_323) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_411 4)) 1) 1 0) 0)) (= (+ v_~q_back~0_849 4) v_~q_back~0_848) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_411)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| (ite (and (< v_~q_front~0_703 (+ v_~n~0_417 1)) (<= 1 v_~q_front~0_703) (< v_~q_front~0_703 (+ v_~q_back~0_848 1))) 1 0)) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_411)) 1) 1 0) 0)) (= (+ 3 v_~q_front~0_705) v_~q_front~0_703) (= |v_thread1Thread1of1ForFork0_~i~0#1_435| 4) (not (= (ite (let ((.cse4 (+ 3 v_~q_back~0_849))) (and (< .cse4 v_~n~0_417) (<= 0 .cse4))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_417| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|) (not (= (+ .cse0 v_~s~0_648 |v_thread2Thread1of1ForFork1_~j~0#1_409|) v_~s~0_646)) (= (select .cse1 (+ (- 4) v_~q~0.offset_411 (* 4 v_~q_front~0_703))) |v_thread2Thread1of1ForFork1_~j~0#1_409|)))) InVars {~q_back~0=v_~q_back~0_849, #memory_int=|v_#memory_int_592|, ~N~0=v_~N~0_323, ~q~0.base=v_~q~0.base_412, ~n~0=v_~n~0_417, ~q~0.offset=v_~q~0.offset_411, ~s~0=v_~s~0_648, ~q_front~0=v_~q_front~0_705} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_409|, ~q_back~0=v_~q_back~0_848, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_372|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_292|, ~N~0=v_~N~0_323, ~q~0.base=v_~q~0.base_412, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_372|, ~q~0.offset=v_~q~0.offset_411, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_296|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_292|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_435|, #memory_int=|v_#memory_int_592|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_417|, ~n~0=v_~n~0_417, ~s~0=v_~s~0_646, ~q_front~0=v_~q_front~0_703} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:34:36,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [720] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_601| v_~q~0.base_418)) (.cse6 (* 4 v_~q_front~0_728))) (let ((.cse4 (* v_~q_back~0_864 4)) (.cse3 (select .cse1 (+ .cse6 v_~q~0.offset_417))) (.cse2 (* 4 v_~q_front~0_726)) (.cse0 (select .cse1 (+ .cse6 v_~q~0.offset_417 4)))) (and (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_388| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_388|) (< 3 v_~N~0_329) (= (select .cse1 (+ .cse2 (- 4) v_~q~0.offset_417)) |v_thread2Thread1of1ForFork1_~j~0#1_426|) (not (= .cse3 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_388| (ite (and (<= 1 v_~q_front~0_726) (< v_~q_front~0_726 (+ v_~n~0_423 1)) (< v_~q_front~0_726 (+ v_~q_back~0_863 1))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_443| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426| 0)) (= (+ v_~q_back~0_864 4) v_~q_back~0_863) (= (+ 4 v_~q_front~0_728) v_~q_front~0_726) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_426| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426| (ite (= (select .cse1 (+ .cse4 12 v_~q~0.offset_417)) 1) 1 0)) (not (= (ite (let ((.cse5 (+ 3 v_~q_back~0_864))) (and (<= 0 .cse5) (< .cse5 v_~n~0_423))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse4 8 v_~q~0.offset_417)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_728 v_~n~0_423) (<= 0 v_~q_front~0_728) (< v_~q_front~0_728 (+ v_~q_back~0_864 1))) 1 0) 0)) (not (= v_~s~0_670 (+ .cse3 .cse0 v_~s~0_672 |v_thread2Thread1of1ForFork1_~j~0#1_426|))) (not (= (ite (= (select .cse1 (+ .cse4 v_~q~0.offset_417 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse4 v_~q~0.offset_417)) 1) 1 0) 0)) (= (+ .cse3 (select .cse1 (+ .cse2 v_~q~0.offset_417 (- 8))) .cse0 v_~s~0_672 |v_thread2Thread1of1ForFork1_~j~0#1_426|) v_~s~0_670) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|)))) InVars {~q_back~0=v_~q_back~0_864, #memory_int=|v_#memory_int_601|, ~N~0=v_~N~0_329, ~q~0.base=v_~q~0.base_418, ~n~0=v_~n~0_423, ~q~0.offset=v_~q~0.offset_417, ~s~0=v_~s~0_672, ~q_front~0=v_~q_front~0_728} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_426|, ~q_back~0=v_~q_back~0_863, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_388|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_388|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_298|, ~N~0=v_~N~0_329, ~q~0.base=v_~q~0.base_418, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_388|, ~q~0.offset=v_~q~0.offset_417, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_388|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_426|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_302|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_298|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_443|, #memory_int=|v_#memory_int_601|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|, ~n~0=v_~n~0_423, ~s~0=v_~s~0_670, ~q_front~0=v_~q_front~0_726} 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-13 13:34:40,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:34:40,927 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:34:40,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6177 [2022-12-13 13:34:40,928 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 220 transitions, 4178 flow [2022-12-13 13:34:40,928 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-13 13:34:40,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:40,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:40,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 13:34:41,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:41,129 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-13 13:34:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1123013194, now seen corresponding path program 1 times [2022-12-13 13:34:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:41,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112823903] [2022-12-13 13:34:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:41,562 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-13 13:34:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:41,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112823903] [2022-12-13 13:34:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112823903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:41,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195993059] [2022-12-13 13:34:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:41,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:41,565 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-13 13:34:41,567 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-13 13:34:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:41,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 13:34:41,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:41,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:41,740 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-13 13:34:41,787 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-13 13:34:41,809 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-13 13:34:41,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:41,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:41,859 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-13 13:34:41,861 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 41 [2022-12-13 13:34:41,887 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-13 13:34:41,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195993059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:41,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:41,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-13 13:34:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759847689] [2022-12-13 13:34:41,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:41,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:34:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:34:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:34:41,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 13:34:41,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 220 transitions, 4178 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-13 13:34:41,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:41,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 13:34:41,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:42,465 INFO L130 PetriNetUnfolder]: 984/1854 cut-off events. [2022-12-13 13:34:42,465 INFO L131 PetriNetUnfolder]: For 35332/35396 co-relation queries the response was YES. [2022-12-13 13:34:42,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14868 conditions, 1854 events. 984/1854 cut-off events. For 35332/35396 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11393 event pairs, 179 based on Foata normal form. 58/1874 useless extension candidates. Maximal degree in co-relation 14648. Up to 1723 conditions per place. [2022-12-13 13:34:42,476 INFO L137 encePairwiseOnDemand]: 11/40 looper letters, 199 selfloop transitions, 32 changer transitions 30/262 dead transitions. [2022-12-13 13:34:42,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 262 transitions, 5174 flow [2022-12-13 13:34:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:34:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:34:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-12-13 13:34:42,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24722222222222223 [2022-12-13 13:34:42,477 INFO L175 Difference]: Start difference. First operand has 139 places, 220 transitions, 4178 flow. Second operand 9 states and 89 transitions. [2022-12-13 13:34:42,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 262 transitions, 5174 flow [2022-12-13 13:34:42,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 262 transitions, 4728 flow, removed 217 selfloop flow, removed 6 redundant places. [2022-12-13 13:34:42,571 INFO L231 Difference]: Finished difference. Result has 148 places, 225 transitions, 3983 flow [2022-12-13 13:34:42,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3774, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3983, PETRI_PLACES=148, PETRI_TRANSITIONS=225} [2022-12-13 13:34:42,571 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-13 13:34:42,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:42,571 INFO L89 Accepts]: Start accepts. Operand has 148 places, 225 transitions, 3983 flow [2022-12-13 13:34:42,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:42,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:42,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 225 transitions, 3983 flow [2022-12-13 13:34:42,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 225 transitions, 3983 flow [2022-12-13 13:34:42,644 INFO L130 PetriNetUnfolder]: 242/714 cut-off events. [2022-12-13 13:34:42,644 INFO L131 PetriNetUnfolder]: For 10266/10312 co-relation queries the response was YES. [2022-12-13 13:34:42,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 714 events. 242/714 cut-off events. For 10266/10312 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5014 event pairs, 2 based on Foata normal form. 29/719 useless extension candidates. Maximal degree in co-relation 4775. Up to 274 conditions per place. [2022-12-13 13:34:42,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 225 transitions, 3983 flow [2022-12-13 13:34:42,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 13:34:42,651 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:42,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 13:34:42,651 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 225 transitions, 3983 flow [2022-12-13 13:34:42,651 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-13 13:34:42,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:42,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:42,658 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-13 13:34:42,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-13 13:34:42,852 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-13 13:34:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash -853567682, now seen corresponding path program 2 times [2022-12-13 13:34:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394905829] [2022-12-13 13:34:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:43,346 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-13 13:34:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394905829] [2022-12-13 13:34:43,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394905829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97368397] [2022-12-13 13:34:43,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:34:43,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:43,348 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-13 13:34:43,348 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-13 13:34:43,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:34:43,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:34:43,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 13:34:43,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:43,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:43,593 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-13 13:34:43,622 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-13 13:34:43,656 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-13 13:34:43,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:43,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:43,724 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-13 13:34:43,727 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-13 13:34:43,729 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-13 13:34:43,769 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-13 13:34:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97368397] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:43,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:43,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:34:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352633900] [2022-12-13 13:34:43,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:43,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:34:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:34:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:34:43,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 13:34:43,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 225 transitions, 3983 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-13 13:34:43,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:43,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 13:34:43,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:44,267 INFO L130 PetriNetUnfolder]: 957/1798 cut-off events. [2022-12-13 13:34:44,267 INFO L131 PetriNetUnfolder]: For 31062/31100 co-relation queries the response was YES. [2022-12-13 13:34:44,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13746 conditions, 1798 events. 957/1798 cut-off events. For 31062/31100 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10914 event pairs, 213 based on Foata normal form. 40/1804 useless extension candidates. Maximal degree in co-relation 13505. Up to 1701 conditions per place. [2022-12-13 13:34:44,279 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 200 selfloop transitions, 35 changer transitions 12/248 dead transitions. [2022-12-13 13:34:44,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 248 transitions, 4628 flow [2022-12-13 13:34:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:34:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:34:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-12-13 13:34:44,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23723723723723725 [2022-12-13 13:34:44,280 INFO L175 Difference]: Start difference. First operand has 142 places, 225 transitions, 3983 flow. Second operand 9 states and 79 transitions. [2022-12-13 13:34:44,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 248 transitions, 4628 flow [2022-12-13 13:34:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 248 transitions, 4548 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:44,376 INFO L231 Difference]: Finished difference. Result has 147 places, 227 transitions, 4027 flow [2022-12-13 13:34:44,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3903, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4027, PETRI_PLACES=147, PETRI_TRANSITIONS=227} [2022-12-13 13:34:44,377 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 126 predicate places. [2022-12-13 13:34:44,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:44,377 INFO L89 Accepts]: Start accepts. Operand has 147 places, 227 transitions, 4027 flow [2022-12-13 13:34:44,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:44,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:44,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 227 transitions, 4027 flow [2022-12-13 13:34:44,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 227 transitions, 4027 flow [2022-12-13 13:34:44,449 INFO L130 PetriNetUnfolder]: 242/710 cut-off events. [2022-12-13 13:34:44,449 INFO L131 PetriNetUnfolder]: For 10523/10571 co-relation queries the response was YES. [2022-12-13 13:34:44,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 710 events. 242/710 cut-off events. For 10523/10571 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4968 event pairs, 2 based on Foata normal form. 29/715 useless extension candidates. Maximal degree in co-relation 4715. Up to 275 conditions per place. [2022-12-13 13:34:44,454 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 227 transitions, 4027 flow [2022-12-13 13:34:44,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-13 13:34:44,458 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-13 13:34:44,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:34:44,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-13 13:34:44,551 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 226 transitions, 4017 flow [2022-12-13 13:34:44,551 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-13 13:34:44,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:44,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:44,557 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-13 13:34:44,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:44,752 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-13 13:34:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1091598576, now seen corresponding path program 1 times [2022-12-13 13:34:44,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:44,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652156361] [2022-12-13 13:34:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:44,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:45,058 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-13 13:34:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:45,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652156361] [2022-12-13 13:34:45,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652156361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:45,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:45,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:34:45,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559674256] [2022-12-13 13:34:45,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:45,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:34:45,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:34:45,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:34:45,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 13:34:45,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 226 transitions, 4017 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-13 13:34:45,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:45,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 13:34:45,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:45,508 INFO L130 PetriNetUnfolder]: 1011/1877 cut-off events. [2022-12-13 13:34:45,509 INFO L131 PetriNetUnfolder]: For 34663/34708 co-relation queries the response was YES. [2022-12-13 13:34:45,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14305 conditions, 1877 events. 1011/1877 cut-off events. For 34663/34708 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11328 event pairs, 214 based on Foata normal form. 51/1893 useless extension candidates. Maximal degree in co-relation 14077. Up to 1666 conditions per place. [2022-12-13 13:34:45,521 INFO L137 encePairwiseOnDemand]: 19/38 looper letters, 214 selfloop transitions, 44 changer transitions 0/259 dead transitions. [2022-12-13 13:34:45,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 259 transitions, 4825 flow [2022-12-13 13:34:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:34:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:34:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 13:34:45,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2894736842105263 [2022-12-13 13:34:45,524 INFO L175 Difference]: Start difference. First operand has 144 places, 226 transitions, 4017 flow. Second operand 7 states and 77 transitions. [2022-12-13 13:34:45,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 259 transitions, 4825 flow [2022-12-13 13:34:45,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 259 transitions, 4726 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 13:34:45,620 INFO L231 Difference]: Finished difference. Result has 146 places, 234 transitions, 4222 flow [2022-12-13 13:34:45,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3843, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4222, PETRI_PLACES=146, PETRI_TRANSITIONS=234} [2022-12-13 13:34:45,620 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-13 13:34:45,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:45,620 INFO L89 Accepts]: Start accepts. Operand has 146 places, 234 transitions, 4222 flow [2022-12-13 13:34:45,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:45,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:45,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 234 transitions, 4222 flow [2022-12-13 13:34:45,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 234 transitions, 4222 flow [2022-12-13 13:34:45,697 INFO L130 PetriNetUnfolder]: 257/752 cut-off events. [2022-12-13 13:34:45,697 INFO L131 PetriNetUnfolder]: For 12135/12229 co-relation queries the response was YES. [2022-12-13 13:34:45,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 752 events. 257/752 cut-off events. For 12135/12229 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5387 event pairs, 2 based on Foata normal form. 42/770 useless extension candidates. Maximal degree in co-relation 5076. Up to 294 conditions per place. [2022-12-13 13:34:45,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 234 transitions, 4222 flow [2022-12-13 13:34:45,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 800 [2022-12-13 13:34:45,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:34:45,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:34:46,021 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:34:46,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 401 [2022-12-13 13:34:46,022 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 234 transitions, 4268 flow [2022-12-13 13:34:46,022 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-13 13:34:46,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:46,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:46,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 13:34:46,022 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-13 13:34:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1814695699, now seen corresponding path program 1 times [2022-12-13 13:34:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:46,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387993817] [2022-12-13 13:34:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:46,314 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-13 13:34:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:46,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387993817] [2022-12-13 13:34:46,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387993817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:46,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:46,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:34:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939810636] [2022-12-13 13:34:46,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:46,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:34:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:46,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:34:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:34:46,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 13:34:46,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 234 transitions, 4268 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-13 13:34:46,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:46,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 13:34:46,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:46,721 INFO L130 PetriNetUnfolder]: 1004/1856 cut-off events. [2022-12-13 13:34:46,721 INFO L131 PetriNetUnfolder]: For 36345/36439 co-relation queries the response was YES. [2022-12-13 13:34:46,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14548 conditions, 1856 events. 1004/1856 cut-off events. For 36345/36439 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11112 event pairs, 220 based on Foata normal form. 50/1869 useless extension candidates. Maximal degree in co-relation 14210. Up to 1669 conditions per place. [2022-12-13 13:34:46,734 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 207 selfloop transitions, 39 changer transitions 2/249 dead transitions. [2022-12-13 13:34:46,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 249 transitions, 4795 flow [2022-12-13 13:34:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:34:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:34:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 13:34:46,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.315 [2022-12-13 13:34:46,735 INFO L175 Difference]: Start difference. First operand has 146 places, 234 transitions, 4268 flow. Second operand 5 states and 63 transitions. [2022-12-13 13:34:46,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 249 transitions, 4795 flow [2022-12-13 13:34:46,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 249 transitions, 4690 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 13:34:46,838 INFO L231 Difference]: Finished difference. Result has 148 places, 233 transitions, 4174 flow [2022-12-13 13:34:46,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4078, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4174, PETRI_PLACES=148, PETRI_TRANSITIONS=233} [2022-12-13 13:34:46,839 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-13 13:34:46,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:46,839 INFO L89 Accepts]: Start accepts. Operand has 148 places, 233 transitions, 4174 flow [2022-12-13 13:34:46,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:46,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:46,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 233 transitions, 4174 flow [2022-12-13 13:34:46,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 233 transitions, 4174 flow [2022-12-13 13:34:46,922 INFO L130 PetriNetUnfolder]: 256/741 cut-off events. [2022-12-13 13:34:46,922 INFO L131 PetriNetUnfolder]: For 12128/12226 co-relation queries the response was YES. [2022-12-13 13:34:46,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 741 events. 256/741 cut-off events. For 12128/12226 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5217 event pairs, 2 based on Foata normal form. 41/757 useless extension candidates. Maximal degree in co-relation 4998. Up to 284 conditions per place. [2022-12-13 13:34:46,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 233 transitions, 4174 flow [2022-12-13 13:34:46,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 794 [2022-12-13 13:34:46,929 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:34:46,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 13:34:46,929 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 233 transitions, 4174 flow [2022-12-13 13:34:46,929 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-13 13:34:46,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:46,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:46,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 13:34:46,930 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-13 13:34:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash -174961038, now seen corresponding path program 1 times [2022-12-13 13:34:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:46,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004943751] [2022-12-13 13:34:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:47,308 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-13 13:34:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:47,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004943751] [2022-12-13 13:34:47,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004943751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:47,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203694392] [2022-12-13 13:34:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:47,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:47,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:47,310 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-13 13:34:47,319 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-13 13:34:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:47,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 13:34:47,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:47,501 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-13 13:34:47,556 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-13 13:34:47,586 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-13 13:34:47,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:47,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:47,654 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-13 13:34:47,657 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-13 13:34:47,659 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-13 13:34:47,713 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-13 13:34:47,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203694392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:47,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:47,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:34:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931263077] [2022-12-13 13:34:47,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:47,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:34:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:34:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:34:47,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 13:34:47,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 233 transitions, 4174 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-13 13:34:47,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:47,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 13:34:47,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:48,441 INFO L130 PetriNetUnfolder]: 1037/1933 cut-off events. [2022-12-13 13:34:48,442 INFO L131 PetriNetUnfolder]: For 36366/36421 co-relation queries the response was YES. [2022-12-13 13:34:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15044 conditions, 1933 events. 1037/1933 cut-off events. For 36366/36421 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11766 event pairs, 200 based on Foata normal form. 57/1956 useless extension candidates. Maximal degree in co-relation 14705. Up to 1782 conditions per place. [2022-12-13 13:34:48,454 INFO L137 encePairwiseOnDemand]: 12/38 looper letters, 203 selfloop transitions, 43 changer transitions 35/282 dead transitions. [2022-12-13 13:34:48,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 282 transitions, 5159 flow [2022-12-13 13:34:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:34:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:34:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-12-13 13:34:48,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.212406015037594 [2022-12-13 13:34:48,455 INFO L175 Difference]: Start difference. First operand has 146 places, 233 transitions, 4174 flow. Second operand 14 states and 113 transitions. [2022-12-13 13:34:48,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 282 transitions, 5159 flow [2022-12-13 13:34:48,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 282 transitions, 5077 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 13:34:48,563 INFO L231 Difference]: Finished difference. Result has 159 places, 236 transitions, 4304 flow [2022-12-13 13:34:48,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=4092, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4304, PETRI_PLACES=159, PETRI_TRANSITIONS=236} [2022-12-13 13:34:48,564 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 138 predicate places. [2022-12-13 13:34:48,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:48,564 INFO L89 Accepts]: Start accepts. Operand has 159 places, 236 transitions, 4304 flow [2022-12-13 13:34:48,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:48,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:48,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 236 transitions, 4304 flow [2022-12-13 13:34:48,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 236 transitions, 4304 flow [2022-12-13 13:34:48,644 INFO L130 PetriNetUnfolder]: 258/747 cut-off events. [2022-12-13 13:34:48,644 INFO L131 PetriNetUnfolder]: For 12659/12740 co-relation queries the response was YES. [2022-12-13 13:34:48,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5270 conditions, 747 events. 258/747 cut-off events. For 12659/12740 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5238 event pairs, 2 based on Foata normal form. 36/759 useless extension candidates. Maximal degree in co-relation 5107. Up to 288 conditions per place. [2022-12-13 13:34:48,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 236 transitions, 4304 flow [2022-12-13 13:34:48,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 794 [2022-12-13 13:34:48,651 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L93-3: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_557) (< v_~q_back~0_557 v_~n~0_309)) 1 0) 0)) (= (store |v_#memory_int_440| |v_ULTIMATE.start_main_~#t2~0#1.base_111| (store (select |v_#memory_int_440| |v_ULTIMATE.start_main_~#t2~0#1.base_111|) |v_ULTIMATE.start_main_~#t2~0#1.offset_105| |v_ULTIMATE.start_main_#t~pre14#1_131|)) |v_#memory_int_439|) (< |v_thread1Thread1of1ForFork0_~i~0#1_247| (+ v_~N~0_223 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_247| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_232| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_232|) (= (+ |v_#pthreadsForks_163| 1) |v_#pthreadsForks_162|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_232| (ite (= (select (select |v_#memory_int_440| v_~q~0.base_303) (+ v_~q~0.offset_302 (* v_~q_back~0_557 4))) 1) 1 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_131| |v_#pthreadsForks_163|) (= (+ v_~q_back~0_557 1) v_~q_back~0_556) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_232| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_163|, ~q_back~0=v_~q_back~0_557, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_105|, #memory_int=|v_#memory_int_440|, ~N~0=v_~N~0_223, ~q~0.base=v_~q~0.base_303, ~n~0=v_~n~0_309, ~q~0.offset=v_~q~0.offset_302, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|} OutVars{~q_back~0=v_~q_back~0_556, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_105|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_152|, ~N~0=v_~N~0_223, ~q~0.base=v_~q~0.base_303, ~q~0.offset=v_~q~0.offset_302, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_138|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_232|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_131|, #pthreadsForks=|v_#pthreadsForks_162|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_156|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_247|, #memory_int=|v_#memory_int_439|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_111|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_232|, ~n~0=v_~n~0_309, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|} 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-13 13:34:48,651 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:48,651 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:48,651 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:48,651 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:48,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:34:48,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-13 13:34:48,805 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 236 transitions, 4326 flow [2022-12-13 13:34:48,805 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-13 13:34:48,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:48,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:48,813 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-13 13:34:49,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-13 13:34:49,006 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-13 13:34:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:49,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1006538088, now seen corresponding path program 1 times [2022-12-13 13:34:49,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106911131] [2022-12-13 13:34:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:49,055 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-13 13:34:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:49,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106911131] [2022-12-13 13:34:49,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106911131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:49,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:49,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:34:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711584619] [2022-12-13 13:34:49,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:49,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:34:49,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:49,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:34:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:34:49,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 13:34:49,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 236 transitions, 4326 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-13 13:34:49,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:49,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 13:34:49,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:49,353 INFO L130 PetriNetUnfolder]: 862/1605 cut-off events. [2022-12-13 13:34:49,354 INFO L131 PetriNetUnfolder]: For 32573/32616 co-relation queries the response was YES. [2022-12-13 13:34:49,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12737 conditions, 1605 events. 862/1605 cut-off events. For 32573/32616 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9270 event pairs, 174 based on Foata normal form. 40/1609 useless extension candidates. Maximal degree in co-relation 12561. Up to 1284 conditions per place. [2022-12-13 13:34:49,363 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 170 selfloop transitions, 23 changer transitions 13/207 dead transitions. [2022-12-13 13:34:49,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 207 transitions, 4251 flow [2022-12-13 13:34:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:34:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:34:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-13 13:34:49,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-13 13:34:49,364 INFO L175 Difference]: Start difference. First operand has 153 places, 236 transitions, 4326 flow. Second operand 5 states and 60 transitions. [2022-12-13 13:34:49,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 207 transitions, 4251 flow [2022-12-13 13:34:49,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 207 transitions, 4137 flow, removed 31 selfloop flow, removed 8 redundant places. [2022-12-13 13:34:49,444 INFO L231 Difference]: Finished difference. Result has 147 places, 184 transitions, 3449 flow [2022-12-13 13:34:49,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3648, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3449, PETRI_PLACES=147, PETRI_TRANSITIONS=184} [2022-12-13 13:34:49,444 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 126 predicate places. [2022-12-13 13:34:49,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:49,444 INFO L89 Accepts]: Start accepts. Operand has 147 places, 184 transitions, 3449 flow [2022-12-13 13:34:49,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:49,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:49,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 184 transitions, 3449 flow [2022-12-13 13:34:49,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 184 transitions, 3449 flow [2022-12-13 13:34:49,507 INFO L130 PetriNetUnfolder]: 223/640 cut-off events. [2022-12-13 13:34:49,507 INFO L131 PetriNetUnfolder]: For 10324/10399 co-relation queries the response was YES. [2022-12-13 13:34:49,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 640 events. 223/640 cut-off events. For 10324/10399 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4243 event pairs, 2 based on Foata normal form. 36/624 useless extension candidates. Maximal degree in co-relation 4261. Up to 272 conditions per place. [2022-12-13 13:34:49,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 184 transitions, 3449 flow [2022-12-13 13:34:49,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 13:34:49,516 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-13 13:34:49,619 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,619 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,619 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,619 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_743 4)) (.cse2 (+ v_~q_back~0_743 1)) (.cse0 (select |v_#memory_int_534| v_~q~0.base_370))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_371| (+ v_~N~0_289 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= (+ 1 v_~q_front~0_579) v_~q_front~0_578) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_375)) 1 0))) (= (ite (and (<= 0 v_~q_front~0_579) (< v_~q_front~0_579 v_~n~0_375) (< v_~q_front~0_579 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|) (= |v_thread1Thread1of1ForFork0_~i~0#1_371| 2) (= (+ v_~s~0_519 |v_thread2Thread1of1ForFork1_~j~0#1_324|) v_~s~0_518) (= (select .cse0 (+ (* 4 v_~q_front~0_579) v_~q~0.offset_369)) |v_thread2Thread1of1ForFork1_~j~0#1_324|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (= (+ 2 v_~q_back~0_743) v_~q_back~0_741) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_324| 0)))) InVars {~q_back~0=v_~q_back~0_743, #memory_int=|v_#memory_int_534|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~n~0=v_~n~0_375, ~q~0.offset=v_~q~0.offset_369, ~s~0=v_~s~0_519, ~q_front~0=v_~q_front~0_579} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_324|, ~q_back~0=v_~q_back~0_741, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_244|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_293|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~q~0.offset=v_~q~0.offset_369, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_293|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_248|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_244|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|, #memory_int=|v_#memory_int_534|, ~n~0=v_~n~0_375, ~s~0=v_~s~0_518, ~q_front~0=v_~q_front~0_578} 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 [733] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_640| v_~q~0.base_443))) (and (= (ite (= (select .cse0 (+ (* v_~q_back~0_918 4) v_~q~0.offset_442)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_461|) (= (+ 1 v_~q_front~0_773) v_~q_front~0_772) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461| 0)) (= (+ v_~q_back~0_918 1) v_~q_back~0_917) (not (= (ite (and (<= 0 v_~q_back~0_918) (< v_~q_back~0_918 v_~n~0_445)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_415| (ite (and (< v_~q_front~0_773 v_~q_back~0_918) (<= 0 v_~q_front~0_773) (< v_~q_front~0_773 v_~n~0_445)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_456| 0)) (= v_~s~0_720 (+ v_~s~0_721 |v_thread2Thread1of1ForFork1_~j~0#1_456|)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_415| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_456| (select .cse0 (+ (* 4 v_~q_front~0_773) v_~q~0.offset_442))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_461| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_415| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_415|) (= |v_thread1Thread1of1ForFork0_~i~0#1_477| (+ |v_thread1Thread1of1ForFork0_~i~0#1_478| 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_478| v_~N~0_351))) InVars {~q_back~0=v_~q_back~0_918, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_478|, #memory_int=|v_#memory_int_640|, ~N~0=v_~N~0_351, ~q~0.base=v_~q~0.base_443, ~n~0=v_~n~0_445, ~q~0.offset=v_~q~0.offset_442, ~s~0=v_~s~0_721, ~q_front~0=v_~q_front~0_773} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_456|, ~q_back~0=v_~q_back~0_917, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_415|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_324|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_415|, ~N~0=v_~N~0_351, ~q~0.base=v_~q~0.base_443, ~q~0.offset=v_~q~0.offset_442, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_415|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_415|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_461|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_328|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_324|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_477|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461|, #memory_int=|v_#memory_int_640|, ~n~0=v_~n~0_445, ~s~0=v_~s~0_720, ~q_front~0=v_~q_front~0_772} 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] [2022-12-13 13:34:49,868 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,868 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,868 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:49,868 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:34:50,245 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:34:50,246 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 802 [2022-12-13 13:34:50,246 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 183 transitions, 3483 flow [2022-12-13 13:34:50,246 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-13 13:34:50,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:50,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:50,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 13:34:50,246 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-13 13:34:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 781729480, now seen corresponding path program 1 times [2022-12-13 13:34:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:50,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981292118] [2022-12-13 13:34:50,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:50,532 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-13 13:34:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981292118] [2022-12-13 13:34:50,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981292118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:34:50,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:34:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:34:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324809948] [2022-12-13 13:34:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:34:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:34:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:34:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:34:50,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 13:34:50,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 183 transitions, 3483 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-13 13:34:50,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:50,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 13:34:50,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:50,869 INFO L130 PetriNetUnfolder]: 888/1636 cut-off events. [2022-12-13 13:34:50,870 INFO L131 PetriNetUnfolder]: For 29442/29478 co-relation queries the response was YES. [2022-12-13 13:34:50,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12598 conditions, 1636 events. 888/1636 cut-off events. For 29442/29478 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9286 event pairs, 113 based on Foata normal form. 39/1569 useless extension candidates. Maximal degree in co-relation 12408. Up to 1365 conditions per place. [2022-12-13 13:34:50,881 INFO L137 encePairwiseOnDemand]: 16/35 looper letters, 169 selfloop transitions, 42 changer transitions 1/213 dead transitions. [2022-12-13 13:34:50,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 213 transitions, 4325 flow [2022-12-13 13:34:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:34:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:34:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-13 13:34:50,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3047619047619048 [2022-12-13 13:34:50,882 INFO L175 Difference]: Start difference. First operand has 138 places, 183 transitions, 3483 flow. Second operand 6 states and 64 transitions. [2022-12-13 13:34:50,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 213 transitions, 4325 flow [2022-12-13 13:34:50,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 213 transitions, 4178 flow, removed 39 selfloop flow, removed 10 redundant places. [2022-12-13 13:34:50,980 INFO L231 Difference]: Finished difference. Result has 136 places, 192 transitions, 3646 flow [2022-12-13 13:34:50,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3348, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3646, PETRI_PLACES=136, PETRI_TRANSITIONS=192} [2022-12-13 13:34:50,980 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 115 predicate places. [2022-12-13 13:34:50,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:50,980 INFO L89 Accepts]: Start accepts. Operand has 136 places, 192 transitions, 3646 flow [2022-12-13 13:34:50,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:50,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:50,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 192 transitions, 3646 flow [2022-12-13 13:34:50,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 192 transitions, 3646 flow [2022-12-13 13:34:51,046 INFO L130 PetriNetUnfolder]: 232/663 cut-off events. [2022-12-13 13:34:51,046 INFO L131 PetriNetUnfolder]: For 9417/9480 co-relation queries the response was YES. [2022-12-13 13:34:51,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4217 conditions, 663 events. 232/663 cut-off events. For 9417/9480 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4376 event pairs, 2 based on Foata normal form. 29/636 useless extension candidates. Maximal degree in co-relation 4089. Up to 281 conditions per place. [2022-12-13 13:34:51,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 192 transitions, 3646 flow [2022-12-13 13:34:51,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 13:34:51,219 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:34:51,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-13 13:34:51,220 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 192 transitions, 3652 flow [2022-12-13 13:34:51,220 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-13 13:34:51,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:34:51,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:34:51,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 13:34:51,220 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-13 13:34:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:34:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2090172334, now seen corresponding path program 1 times [2022-12-13 13:34:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:34:51,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310052196] [2022-12-13 13:34:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:34:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:51,728 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-13 13:34:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:34:51,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310052196] [2022-12-13 13:34:51,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310052196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:34:51,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463112731] [2022-12-13 13:34:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:34:51,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:34:51,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:34:51,730 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-13 13:34:51,731 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-13 13:34:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:34:51,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:34:51,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:34:51,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:34:51,926 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-13 13:34:51,950 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-13 13:34:51,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:34:51,977 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2460 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2460) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-12-13 13:34:51,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:34:51,985 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-13 13:34:51,988 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-13 13:34:52,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-13 13:34:52,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463112731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:34:52,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:34:52,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 13:34:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75152141] [2022-12-13 13:34:52,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:34:52,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:34:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:34:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:34:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=146, Unknown=1, NotChecked=24, Total=210 [2022-12-13 13:34:52,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 13:34:52,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 192 transitions, 3652 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-13 13:34:52,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:34:52,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 13:34:52,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:34:52,547 INFO L130 PetriNetUnfolder]: 988/1803 cut-off events. [2022-12-13 13:34:52,547 INFO L131 PetriNetUnfolder]: For 30314/30367 co-relation queries the response was YES. [2022-12-13 13:34:52,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12989 conditions, 1803 events. 988/1803 cut-off events. For 30314/30367 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10493 event pairs, 201 based on Foata normal form. 48/1732 useless extension candidates. Maximal degree in co-relation 12670. Up to 1455 conditions per place. [2022-12-13 13:34:52,561 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 185 selfloop transitions, 53 changer transitions 1/240 dead transitions. [2022-12-13 13:34:52,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 240 transitions, 4655 flow [2022-12-13 13:34:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:34:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:34:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-13 13:34:52,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.277992277992278 [2022-12-13 13:34:52,562 INFO L175 Difference]: Start difference. First operand has 135 places, 192 transitions, 3652 flow. Second operand 7 states and 72 transitions. [2022-12-13 13:34:52,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 240 transitions, 4655 flow [2022-12-13 13:34:52,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 240 transitions, 4563 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 13:34:52,626 INFO L231 Difference]: Finished difference. Result has 139 places, 206 transitions, 3992 flow [2022-12-13 13:34:52,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3568, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3992, PETRI_PLACES=139, PETRI_TRANSITIONS=206} [2022-12-13 13:34:52,626 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-13 13:34:52,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:34:52,626 INFO L89 Accepts]: Start accepts. Operand has 139 places, 206 transitions, 3992 flow [2022-12-13 13:34:52,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:34:52,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:34:52,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 206 transitions, 3992 flow [2022-12-13 13:34:52,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 206 transitions, 3992 flow [2022-12-13 13:34:52,701 INFO L130 PetriNetUnfolder]: 260/727 cut-off events. [2022-12-13 13:34:52,701 INFO L131 PetriNetUnfolder]: For 10468/10513 co-relation queries the response was YES. [2022-12-13 13:34:52,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 727 events. 260/727 cut-off events. For 10468/10513 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4952 event pairs, 2 based on Foata normal form. 26/692 useless extension candidates. Maximal degree in co-relation 4629. Up to 318 conditions per place. [2022-12-13 13:34:52,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 206 transitions, 3992 flow [2022-12-13 13:34:52,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 13:35:00,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:35:00,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8253 [2022-12-13 13:35:00,879 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 206 transitions, 4034 flow [2022-12-13 13:35:00,879 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-13 13:35:00,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:00,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:00,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-13 13:35:01,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:01,085 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-13 13:35:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1355642904, now seen corresponding path program 1 times [2022-12-13 13:35:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:01,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295409652] [2022-12-13 13:35:01,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:01,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:01,587 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-13 13:35:01,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:01,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295409652] [2022-12-13 13:35:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295409652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060520915] [2022-12-13 13:35:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:01,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:01,589 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-13 13:35:01,590 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-13 13:35:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:01,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 13:35:01,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:01,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:01,772 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-13 13:35:01,801 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-13 13:35:01,839 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-13 13:35:01,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:01,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:01,906 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-13 13:35:01,910 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-13 13:35:01,912 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-13 13:35:01,946 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-13 13:35:01,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060520915] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:01,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:01,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:35:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778079591] [2022-12-13 13:35:01,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:01,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:35:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:01,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:35:01,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:35:01,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 13:35:01,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 206 transitions, 4034 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-13 13:35:01,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:01,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 13:35:01,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:02,569 INFO L130 PetriNetUnfolder]: 1015/1875 cut-off events. [2022-12-13 13:35:02,569 INFO L131 PetriNetUnfolder]: For 32062/32146 co-relation queries the response was YES. [2022-12-13 13:35:02,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13771 conditions, 1875 events. 1015/1875 cut-off events. For 32062/32146 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11216 event pairs, 197 based on Foata normal form. 65/1820 useless extension candidates. Maximal degree in co-relation 13467. Up to 1723 conditions per place. [2022-12-13 13:35:02,582 INFO L137 encePairwiseOnDemand]: 11/38 looper letters, 185 selfloop transitions, 47 changer transitions 13/246 dead transitions. [2022-12-13 13:35:02,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 246 transitions, 4941 flow [2022-12-13 13:35:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:35:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:35:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-12-13 13:35:02,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23684210526315788 [2022-12-13 13:35:02,583 INFO L175 Difference]: Start difference. First operand has 138 places, 206 transitions, 4034 flow. Second operand 10 states and 90 transitions. [2022-12-13 13:35:02,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 246 transitions, 4941 flow [2022-12-13 13:35:02,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 246 transitions, 4866 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:02,665 INFO L231 Difference]: Finished difference. Result has 150 places, 217 transitions, 4369 flow [2022-12-13 13:35:02,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3961, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4369, PETRI_PLACES=150, PETRI_TRANSITIONS=217} [2022-12-13 13:35:02,666 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2022-12-13 13:35:02,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:02,666 INFO L89 Accepts]: Start accepts. Operand has 150 places, 217 transitions, 4369 flow [2022-12-13 13:35:02,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:02,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:02,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 217 transitions, 4369 flow [2022-12-13 13:35:02,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 217 transitions, 4369 flow [2022-12-13 13:35:02,761 INFO L130 PetriNetUnfolder]: 264/746 cut-off events. [2022-12-13 13:35:02,761 INFO L131 PetriNetUnfolder]: For 11898/11959 co-relation queries the response was YES. [2022-12-13 13:35:02,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 746 events. 264/746 cut-off events. For 11898/11959 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5128 event pairs, 2 based on Foata normal form. 30/714 useless extension candidates. Maximal degree in co-relation 4854. Up to 324 conditions per place. [2022-12-13 13:35:02,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 217 transitions, 4369 flow [2022-12-13 13:35:02,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-13 13:35:02,772 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-13 13:35:02,869 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-13 13:35:02,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:35:02,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-13 13:35:02,967 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 216 transitions, 4367 flow [2022-12-13 13:35:02,967 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-13 13:35:02,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:02,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:02,988 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-13 13:35:03,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:03,172 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-13 13:35:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash -326765632, now seen corresponding path program 1 times [2022-12-13 13:35:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:03,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692606983] [2022-12-13 13:35:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:03,578 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-13 13:35:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692606983] [2022-12-13 13:35:03,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692606983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:03,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:03,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:35:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561374097] [2022-12-13 13:35:03,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:03,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:35:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:35:03,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:35:03,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 13:35:03,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 216 transitions, 4367 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-13 13:35:03,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:03,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 13:35:03,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:04,043 INFO L130 PetriNetUnfolder]: 1070/1959 cut-off events. [2022-12-13 13:35:04,043 INFO L131 PetriNetUnfolder]: For 34372/34444 co-relation queries the response was YES. [2022-12-13 13:35:04,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14467 conditions, 1959 events. 1070/1959 cut-off events. For 34372/34444 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11581 event pairs, 108 based on Foata normal form. 59/1888 useless extension candidates. Maximal degree in co-relation 14308. Up to 1414 conditions per place. [2022-12-13 13:35:04,056 INFO L137 encePairwiseOnDemand]: 11/40 looper letters, 159 selfloop transitions, 81 changer transitions 0/241 dead transitions. [2022-12-13 13:35:04,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 241 transitions, 5115 flow [2022-12-13 13:35:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 13:35:04,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.335 [2022-12-13 13:35:04,057 INFO L175 Difference]: Start difference. First operand has 147 places, 216 transitions, 4367 flow. Second operand 5 states and 67 transitions. [2022-12-13 13:35:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 241 transitions, 5115 flow [2022-12-13 13:35:04,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 241 transitions, 5041 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:04,138 INFO L231 Difference]: Finished difference. Result has 149 places, 225 transitions, 4737 flow [2022-12-13 13:35:04,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4293, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4737, PETRI_PLACES=149, PETRI_TRANSITIONS=225} [2022-12-13 13:35:04,139 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-13 13:35:04,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:04,139 INFO L89 Accepts]: Start accepts. Operand has 149 places, 225 transitions, 4737 flow [2022-12-13 13:35:04,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:04,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:04,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 225 transitions, 4737 flow [2022-12-13 13:35:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 225 transitions, 4737 flow [2022-12-13 13:35:04,223 INFO L130 PetriNetUnfolder]: 280/788 cut-off events. [2022-12-13 13:35:04,224 INFO L131 PetriNetUnfolder]: For 13959/14036 co-relation queries the response was YES. [2022-12-13 13:35:04,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 788 events. 280/788 cut-off events. For 13959/14036 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5482 event pairs, 2 based on Foata normal form. 39/760 useless extension candidates. Maximal degree in co-relation 5184. Up to 338 conditions per place. [2022-12-13 13:35:04,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 225 transitions, 4737 flow [2022-12-13 13:35:04,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-13 13:35:04,232 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:04,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 13:35:04,232 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 225 transitions, 4737 flow [2022-12-13 13:35:04,232 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-13 13:35:04,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:04,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:04,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 13:35:04,232 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-13 13:35:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -450570884, now seen corresponding path program 1 times [2022-12-13 13:35:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:04,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537052598] [2022-12-13 13:35:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:04,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-13 13:35:04,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537052598] [2022-12-13 13:35:04,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537052598] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:04,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460258013] [2022-12-13 13:35:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:04,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:04,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:04,753 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-13 13:35:04,756 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-13 13:35:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:04,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:35:04,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:04,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:04,983 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-13 13:35:05,013 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-13 13:35:05,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:05,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:05,068 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-13 13:35:05,070 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-13 13:35:05,090 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-13 13:35:05,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460258013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:05,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:05,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 13:35:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846808839] [2022-12-13 13:35:05,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:05,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:35:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:35:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=171, Unknown=1, NotChecked=0, Total=210 [2022-12-13 13:35:05,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 13:35:05,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 225 transitions, 4737 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-13 13:35:05,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:05,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 13:35:05,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:05,824 INFO L130 PetriNetUnfolder]: 1112/2021 cut-off events. [2022-12-13 13:35:05,824 INFO L131 PetriNetUnfolder]: For 40559/40670 co-relation queries the response was YES. [2022-12-13 13:35:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15368 conditions, 2021 events. 1112/2021 cut-off events. For 40559/40670 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11941 event pairs, 165 based on Foata normal form. 79/1963 useless extension candidates. Maximal degree in co-relation 15040. Up to 1437 conditions per place. [2022-12-13 13:35:05,840 INFO L137 encePairwiseOnDemand]: 14/40 looper letters, 177 selfloop transitions, 84 changer transitions 0/262 dead transitions. [2022-12-13 13:35:05,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 262 transitions, 5605 flow [2022-12-13 13:35:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:35:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 13:35:05,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-13 13:35:05,841 INFO L175 Difference]: Start difference. First operand has 149 places, 225 transitions, 4737 flow. Second operand 7 states and 77 transitions. [2022-12-13 13:35:05,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 262 transitions, 5605 flow [2022-12-13 13:35:05,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 262 transitions, 5510 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 13:35:05,941 INFO L231 Difference]: Finished difference. Result has 155 places, 233 transitions, 5051 flow [2022-12-13 13:35:05,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4642, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5051, PETRI_PLACES=155, PETRI_TRANSITIONS=233} [2022-12-13 13:35:05,941 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 134 predicate places. [2022-12-13 13:35:05,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:05,941 INFO L89 Accepts]: Start accepts. Operand has 155 places, 233 transitions, 5051 flow [2022-12-13 13:35:05,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:05,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:05,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 233 transitions, 5051 flow [2022-12-13 13:35:05,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 233 transitions, 5051 flow [2022-12-13 13:35:06,034 INFO L130 PetriNetUnfolder]: 292/812 cut-off events. [2022-12-13 13:35:06,034 INFO L131 PetriNetUnfolder]: For 15299/15363 co-relation queries the response was YES. [2022-12-13 13:35:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 812 events. 292/812 cut-off events. For 15299/15363 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5651 event pairs, 2 based on Foata normal form. 31/775 useless extension candidates. Maximal degree in co-relation 5560. Up to 356 conditions per place. [2022-12-13 13:35:06,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 233 transitions, 5051 flow [2022-12-13 13:35:06,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 802 [2022-12-13 13:35:06,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:06,044 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 13:35:06,044 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 233 transitions, 5051 flow [2022-12-13 13:35:06,044 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-13 13:35:06,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:06,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:06,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-13 13:35:06,245 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,SelfDestructingSolverStorable73 [2022-12-13 13:35:06,245 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-13 13:35:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -563104435, now seen corresponding path program 1 times [2022-12-13 13:35:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:06,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623461154] [2022-12-13 13:35:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:06,905 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-13 13:35:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:06,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623461154] [2022-12-13 13:35:06,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623461154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:06,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795917980] [2022-12-13 13:35:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:06,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:06,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:06,906 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-13 13:35:06,907 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-13 13:35:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:07,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 13:35:07,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:07,236 INFO L321 Elim1Store]: treesize reduction 113, result has 8.1 percent of original size [2022-12-13 13:35:07,236 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 69 treesize of output 25 [2022-12-13 13:35:07,261 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-13 13:35:07,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:07,364 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-13 13:35:07,365 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 108 [2022-12-13 13:35:07,433 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-13 13:35:07,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795917980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:07,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:07,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 13:35:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117996847] [2022-12-13 13:35:07,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:07,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:35:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:07,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:35:07,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:35:07,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 13:35:07,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 233 transitions, 5051 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-13 13:35:07,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:07,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 13:35:07,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:08,296 INFO L130 PetriNetUnfolder]: 1121/2038 cut-off events. [2022-12-13 13:35:08,296 INFO L131 PetriNetUnfolder]: For 42646/42728 co-relation queries the response was YES. [2022-12-13 13:35:08,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15983 conditions, 2038 events. 1121/2038 cut-off events. For 42646/42728 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12148 event pairs, 259 based on Foata normal form. 51/1955 useless extension candidates. Maximal degree in co-relation 15653. Up to 1930 conditions per place. [2022-12-13 13:35:08,311 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 205 selfloop transitions, 41 changer transitions 10/257 dead transitions. [2022-12-13 13:35:08,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 257 transitions, 5732 flow [2022-12-13 13:35:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:35:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:35:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-12-13 13:35:08,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 13:35:08,312 INFO L175 Difference]: Start difference. First operand has 155 places, 233 transitions, 5051 flow. Second operand 9 states and 78 transitions. [2022-12-13 13:35:08,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 257 transitions, 5732 flow [2022-12-13 13:35:08,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 257 transitions, 5599 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:08,412 INFO L231 Difference]: Finished difference. Result has 159 places, 237 transitions, 5068 flow [2022-12-13 13:35:08,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4913, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5068, PETRI_PLACES=159, PETRI_TRANSITIONS=237} [2022-12-13 13:35:08,412 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 138 predicate places. [2022-12-13 13:35:08,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:08,412 INFO L89 Accepts]: Start accepts. Operand has 159 places, 237 transitions, 5068 flow [2022-12-13 13:35:08,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:08,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:08,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 237 transitions, 5068 flow [2022-12-13 13:35:08,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 237 transitions, 5068 flow [2022-12-13 13:35:08,505 INFO L130 PetriNetUnfolder]: 295/815 cut-off events. [2022-12-13 13:35:08,505 INFO L131 PetriNetUnfolder]: For 15619/15692 co-relation queries the response was YES. [2022-12-13 13:35:08,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 815 events. 295/815 cut-off events. For 15619/15692 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5701 event pairs, 2 based on Foata normal form. 36/788 useless extension candidates. Maximal degree in co-relation 5592. Up to 348 conditions per place. [2022-12-13 13:35:08,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 237 transitions, 5068 flow [2022-12-13 13:35:08,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-13 13:35:08,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_644| v_~q~0.base_447))) (let ((.cse4 (select .cse1 (+ (* 4 v_~q_front~0_782) v_~q~0.offset_446))) (.cse3 (+ 3 v_~q_back~0_929)) (.cse2 (* v_~q_back~0_929 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_419| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_419|) (not (= (ite (and (< v_~q_front~0_782 (+ v_~q_back~0_929 1)) (<= 0 v_~q_front~0_782) (< v_~q_front~0_782 v_~n~0_449)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_460| 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_929))) (and (<= 0 .cse0) (< .cse0 v_~n~0_449))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_446 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_419| (ite (and (< v_~q_front~0_780 (+ v_~n~0_449 1)) (<= 1 v_~q_front~0_780) (< v_~q_front~0_780 .cse3)) 1 0)) (not (= .cse4 0)) (= (+ .cse4 v_~s~0_730 |v_thread2Thread1of1ForFork1_~j~0#1_460|) v_~s~0_728) (= (select .cse1 (+ (- 4) v_~q~0.offset_446 (* 4 v_~q_front~0_780))) |v_thread2Thread1of1ForFork1_~j~0#1_460|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_467| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467|) (= |v_thread1Thread1of1ForFork0_~i~0#1_485| 3) (= v_~q_back~0_927 .cse3) (= v_~q_front~0_780 (+ 2 v_~q_front~0_782)) (< 2 v_~N~0_355) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_467| (ite (= 1 (select .cse1 (+ .cse2 8 v_~q~0.offset_446))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467| 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_446)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_929, #memory_int=|v_#memory_int_644|, ~N~0=v_~N~0_355, ~q~0.base=v_~q~0.base_447, ~n~0=v_~n~0_449, ~q~0.offset=v_~q~0.offset_446, ~s~0=v_~s~0_730, ~q_front~0=v_~q_front~0_782} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_460|, ~q_back~0=v_~q_back~0_927, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_419|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_419|, ~N~0=v_~N~0_355, ~q~0.base=v_~q~0.base_447, ~q~0.offset=v_~q~0.offset_446, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_419|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_419|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_467|, 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_485|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467|, #memory_int=|v_#memory_int_644|, ~n~0=v_~n~0_449, ~s~0=v_~s~0_728, ~q_front~0=v_~q_front~0_780} 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-13 13:35:08,525 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,525 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,525 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,525 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,525 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,525 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,906 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,907 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,907 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,907 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,907 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:08,907 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:09,280 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:35:09,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 868 [2022-12-13 13:35:09,280 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 237 transitions, 5118 flow [2022-12-13 13:35:09,280 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-13 13:35:09,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:09,280 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:09,287 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-13 13:35:09,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:09,481 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-13 13:35:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1206253253, now seen corresponding path program 1 times [2022-12-13 13:35:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:09,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830462532] [2022-12-13 13:35:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:09,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:10,310 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-13 13:35:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830462532] [2022-12-13 13:35:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830462532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573428856] [2022-12-13 13:35:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:10,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:10,312 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-13 13:35:10,313 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-13 13:35:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:10,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 13:35:10,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:10,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:10,507 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-13 13:35:10,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:10,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 46 treesize of output 12 [2022-12-13 13:35:10,616 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-13 13:35:10,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:10,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:10,724 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-13 13:35:10,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:10,738 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-13 13:35:10,903 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-13 13:35:10,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573428856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:10,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:10,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:35:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131876960] [2022-12-13 13:35:10,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:10,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:35:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:35:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:35:10,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 13:35:10,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 237 transitions, 5118 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-13 13:35:10,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:10,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 13:35:10,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:11,757 INFO L130 PetriNetUnfolder]: 1184/2188 cut-off events. [2022-12-13 13:35:11,757 INFO L131 PetriNetUnfolder]: For 48599/48687 co-relation queries the response was YES. [2022-12-13 13:35:11,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17259 conditions, 2188 events. 1184/2188 cut-off events. For 48599/48687 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13448 event pairs, 319 based on Foata normal form. 47/2118 useless extension candidates. Maximal degree in co-relation 16928. Up to 1936 conditions per place. [2022-12-13 13:35:11,773 INFO L137 encePairwiseOnDemand]: 20/42 looper letters, 242 selfloop transitions, 64 changer transitions 7/314 dead transitions. [2022-12-13 13:35:11,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 314 transitions, 6501 flow [2022-12-13 13:35:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:35:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:35:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-12-13 13:35:11,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20386904761904762 [2022-12-13 13:35:11,774 INFO L175 Difference]: Start difference. First operand has 157 places, 237 transitions, 5118 flow. Second operand 16 states and 137 transitions. [2022-12-13 13:35:11,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 314 transitions, 6501 flow [2022-12-13 13:35:11,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 314 transitions, 6350 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:11,893 INFO L231 Difference]: Finished difference. Result has 176 places, 266 transitions, 5668 flow [2022-12-13 13:35:11,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4967, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5668, PETRI_PLACES=176, PETRI_TRANSITIONS=266} [2022-12-13 13:35:11,894 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 155 predicate places. [2022-12-13 13:35:11,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:11,894 INFO L89 Accepts]: Start accepts. Operand has 176 places, 266 transitions, 5668 flow [2022-12-13 13:35:11,895 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:11,895 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:11,895 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 266 transitions, 5668 flow [2022-12-13 13:35:11,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 266 transitions, 5668 flow [2022-12-13 13:35:12,011 INFO L130 PetriNetUnfolder]: 306/888 cut-off events. [2022-12-13 13:35:12,011 INFO L131 PetriNetUnfolder]: For 16985/17069 co-relation queries the response was YES. [2022-12-13 13:35:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6265 conditions, 888 events. 306/888 cut-off events. For 16985/17069 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6505 event pairs, 5 based on Foata normal form. 41/867 useless extension candidates. Maximal degree in co-relation 6109. Up to 351 conditions per place. [2022-12-13 13:35:12,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 266 transitions, 5668 flow [2022-12-13 13:35:12,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 942 [2022-12-13 13:35:12,024 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,024 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,103 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,103 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:12,276 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,277 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,349 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,349 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,427 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,428 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,569 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,569 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:12,713 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:35:12,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 819 [2022-12-13 13:35:12,713 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 263 transitions, 5670 flow [2022-12-13 13:35:12,713 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-13 13:35:12,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:12,714 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:12,720 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-13 13:35:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:12,914 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-13 13:35:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1111304255, now seen corresponding path program 2 times [2022-12-13 13:35:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:12,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838296074] [2022-12-13 13:35:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:13,865 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-13 13:35:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838296074] [2022-12-13 13:35:13,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838296074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799213007] [2022-12-13 13:35:13,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:35:13,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:13,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:13,866 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-13 13:35:13,868 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-13 13:35:14,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:35:14,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:35:14,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 13:35:14,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:14,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:14,094 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-13 13:35:14,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:14,159 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-13 13:35:14,201 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-13 13:35:14,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:14,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:14,318 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-13 13:35:14,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:14,331 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-13 13:35:14,492 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-13 13:35:14,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799213007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:14,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:14,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:35:14,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311373257] [2022-12-13 13:35:14,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:14,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:35:14,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:35:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:35:14,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 13:35:14,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 263 transitions, 5670 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-13 13:35:14,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:14,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 13:35:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:15,600 INFO L130 PetriNetUnfolder]: 1273/2384 cut-off events. [2022-12-13 13:35:15,600 INFO L131 PetriNetUnfolder]: For 53164/53245 co-relation queries the response was YES. [2022-12-13 13:35:15,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19136 conditions, 2384 events. 1273/2384 cut-off events. For 53164/53245 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15259 event pairs, 214 based on Foata normal form. 78/2347 useless extension candidates. Maximal degree in co-relation 18790. Up to 1875 conditions per place. [2022-12-13 13:35:15,620 INFO L137 encePairwiseOnDemand]: 11/46 looper letters, 218 selfloop transitions, 113 changer transitions 22/354 dead transitions. [2022-12-13 13:35:15,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 354 transitions, 7380 flow [2022-12-13 13:35:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:35:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:35:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 149 transitions. [2022-12-13 13:35:15,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17048054919908467 [2022-12-13 13:35:15,621 INFO L175 Difference]: Start difference. First operand has 172 places, 263 transitions, 5670 flow. Second operand 19 states and 149 transitions. [2022-12-13 13:35:15,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 354 transitions, 7380 flow [2022-12-13 13:35:15,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 354 transitions, 7117 flow, removed 121 selfloop flow, removed 3 redundant places. [2022-12-13 13:35:15,781 INFO L231 Difference]: Finished difference. Result has 195 places, 292 transitions, 6371 flow [2022-12-13 13:35:15,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5425, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6371, PETRI_PLACES=195, PETRI_TRANSITIONS=292} [2022-12-13 13:35:15,782 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2022-12-13 13:35:15,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:15,782 INFO L89 Accepts]: Start accepts. Operand has 195 places, 292 transitions, 6371 flow [2022-12-13 13:35:15,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:15,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:15,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 292 transitions, 6371 flow [2022-12-13 13:35:15,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 292 transitions, 6371 flow [2022-12-13 13:35:15,896 INFO L130 PetriNetUnfolder]: 312/931 cut-off events. [2022-12-13 13:35:15,896 INFO L131 PetriNetUnfolder]: For 19721/19802 co-relation queries the response was YES. [2022-12-13 13:35:15,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 931 events. 312/931 cut-off events. For 19721/19802 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7061 event pairs, 5 based on Foata normal form. 43/948 useless extension candidates. Maximal degree in co-relation 6696. Up to 367 conditions per place. [2022-12-13 13:35:15,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 292 transitions, 6371 flow [2022-12-13 13:35:15,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-13 13:35:15,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:16,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:16,200 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,200 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,200 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,201 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,201 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,201 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,493 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,494 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,494 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,494 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,494 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,494 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:16,780 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:35:16,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 999 [2022-12-13 13:35:16,781 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 291 transitions, 6398 flow [2022-12-13 13:35:16,781 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-13 13:35:16,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:16,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:16,786 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-13 13:35:16,986 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,SelfDestructingSolverStorable76 [2022-12-13 13:35:16,986 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-13 13:35:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -245885455, now seen corresponding path program 1 times [2022-12-13 13:35:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617395611] [2022-12-13 13:35:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:17,034 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-13 13:35:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617395611] [2022-12-13 13:35:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617395611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:17,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:17,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737331824] [2022-12-13 13:35:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:17,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 13:35:17,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 291 transitions, 6398 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-13 13:35:17,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:17,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 13:35:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:17,630 INFO L130 PetriNetUnfolder]: 1687/3150 cut-off events. [2022-12-13 13:35:17,630 INFO L131 PetriNetUnfolder]: For 75547/75632 co-relation queries the response was YES. [2022-12-13 13:35:17,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25922 conditions, 3150 events. 1687/3150 cut-off events. For 75547/75632 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 21090 event pairs, 195 based on Foata normal form. 40/3155 useless extension candidates. Maximal degree in co-relation 25572. Up to 1629 conditions per place. [2022-12-13 13:35:17,658 INFO L137 encePairwiseOnDemand]: 21/48 looper letters, 188 selfloop transitions, 180 changer transitions 10/379 dead transitions. [2022-12-13 13:35:17,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 379 transitions, 8743 flow [2022-12-13 13:35:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 13:35:17,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-13 13:35:17,659 INFO L175 Difference]: Start difference. First operand has 192 places, 291 transitions, 6398 flow. Second operand 5 states and 82 transitions. [2022-12-13 13:35:17,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 379 transitions, 8743 flow [2022-12-13 13:35:17,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 379 transitions, 8500 flow, removed 93 selfloop flow, removed 8 redundant places. [2022-12-13 13:35:17,953 INFO L231 Difference]: Finished difference. Result has 191 places, 336 transitions, 7924 flow [2022-12-13 13:35:17,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6175, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7924, PETRI_PLACES=191, PETRI_TRANSITIONS=336} [2022-12-13 13:35:17,954 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-13 13:35:17,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:17,954 INFO L89 Accepts]: Start accepts. Operand has 191 places, 336 transitions, 7924 flow [2022-12-13 13:35:17,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:17,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:17,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 336 transitions, 7924 flow [2022-12-13 13:35:17,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 336 transitions, 7924 flow [2022-12-13 13:35:18,124 INFO L130 PetriNetUnfolder]: 425/1237 cut-off events. [2022-12-13 13:35:18,124 INFO L131 PetriNetUnfolder]: For 28687/28849 co-relation queries the response was YES. [2022-12-13 13:35:18,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10079 conditions, 1237 events. 425/1237 cut-off events. For 28687/28849 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9833 event pairs, 2 based on Foata normal form. 55/1264 useless extension candidates. Maximal degree in co-relation 9905. Up to 510 conditions per place. [2022-12-13 13:35:18,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 336 transitions, 7924 flow [2022-12-13 13:35:18,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 1190 [2022-12-13 13:35:18,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] L47-4-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_711| v_~q~0.base_487))) (and (not (< |v_thread1Thread1of1ForFork0_~i~0#1_523| v_~N~0_379)) (= |v_thread1Thread1of1ForFork0_#res#1.base_198| 0) (= (select .cse0 (+ (* 4 v_~q_front~0_879) (- 4) v_~q~0.offset_486)) |v_thread2Thread1of1ForFork1_~j~0#1_533|) (not (= (+ v_~s~0_834 |v_thread2Thread1of1ForFork1_~j~0#1_533|) v_~s~0_832)) (= (+ v_~q_back~0_1001 1) v_~q_back~0_1000) (= (+ 2 v_~q_front~0_881) v_~q_front~0_879) (not (= (ite (and (< v_~q_front~0_881 v_~q_back~0_1000) (< v_~q_front~0_881 v_~n~0_483) (<= 0 v_~q_front~0_881)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1001 v_~n~0_483) (<= 0 v_~q_back~0_1001)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_119| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_198| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_486| (ite (and (< v_~q_front~0_879 (+ v_~n~0_483 1)) (<= 1 v_~q_front~0_879) (< v_~q_front~0_879 (+ v_~q_back~0_1000 1))) 1 0)) (= (+ (select .cse0 (+ (* 4 v_~q_front~0_881) v_~q~0.offset_486)) v_~s~0_834 |v_thread2Thread1of1ForFork1_~j~0#1_533|) v_~s~0_832) (= |v_thread2Thread1of1ForFork1_~j~0#1_533| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_486| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_486|) (= |v_thread2Thread1of1ForFork1_#res#1.base_119| 0) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1001 4) v_~q~0.offset_486)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507|))) InVars {~q_back~0=v_~q_back~0_1001, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_523|, #memory_int=|v_#memory_int_711|, ~N~0=v_~N~0_379, ~q~0.base=v_~q~0.base_487, ~n~0=v_~n~0_483, ~q~0.offset=v_~q~0.offset_486, ~s~0=v_~s~0_834, ~q_front~0=v_~q_front~0_881} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_533|, ~q_back~0=v_~q_back~0_1000, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_198|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_216|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_486|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_486|, ~N~0=v_~N~0_379, ~q~0.base=v_~q~0.base_487, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_486|, ~q~0.offset=v_~q~0.offset_486, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_486|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_119|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_523|, #memory_int=|v_#memory_int_711|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|, ~n~0=v_~n~0_483, ~s~0=v_~s~0_832, ~q_front~0=v_~q_front~0_879, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_198|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, 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, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] and [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (= v_~N~0_In_5 v_~s~0_In_3)) 1 0))) InVars {~N~0=v_~N~0_In_5, ~s~0=v_~s~0_In_3} OutVars{~N~0=v_~N~0_In_5, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ~s~0=v_~s~0_In_3} 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-13 13:35:18,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:18,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:18,612 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:35:18,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 659 [2022-12-13 13:35:18,613 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 335 transitions, 7936 flow [2022-12-13 13:35:18,613 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-13 13:35:18,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:18,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:18,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 13:35:18,613 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-13 13:35:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1788576010, now seen corresponding path program 1 times [2022-12-13 13:35:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:18,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263781604] [2022-12-13 13:35:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:19,748 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-13 13:35:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:19,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263781604] [2022-12-13 13:35:19,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263781604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:19,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:19,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:19,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009483069] [2022-12-13 13:35:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:19,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:35:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:19,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:35:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:35:19,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 13:35:19,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 335 transitions, 7936 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-13 13:35:19,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:19,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 13:35:19,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:20,472 INFO L130 PetriNetUnfolder]: 1654/3080 cut-off events. [2022-12-13 13:35:20,472 INFO L131 PetriNetUnfolder]: For 80667/80750 co-relation queries the response was YES. [2022-12-13 13:35:20,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27742 conditions, 3080 events. 1654/3080 cut-off events. For 80667/80750 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 20369 event pairs, 581 based on Foata normal form. 53/3098 useless extension candidates. Maximal degree in co-relation 27347. Up to 2975 conditions per place. [2022-12-13 13:35:20,501 INFO L137 encePairwiseOnDemand]: 24/46 looper letters, 297 selfloop transitions, 41 changer transitions 5/344 dead transitions. [2022-12-13 13:35:20,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 344 transitions, 8628 flow [2022-12-13 13:35:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:35:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:35:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 13:35:20,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2572463768115942 [2022-12-13 13:35:20,503 INFO L175 Difference]: Start difference. First operand has 187 places, 335 transitions, 7936 flow. Second operand 6 states and 71 transitions. [2022-12-13 13:35:20,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 344 transitions, 8628 flow [2022-12-13 13:35:20,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 344 transitions, 8443 flow, removed 74 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:20,820 INFO L231 Difference]: Finished difference. Result has 187 places, 332 transitions, 7785 flow [2022-12-13 13:35:20,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7724, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7785, PETRI_PLACES=187, PETRI_TRANSITIONS=332} [2022-12-13 13:35:20,820 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-13 13:35:20,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:20,820 INFO L89 Accepts]: Start accepts. Operand has 187 places, 332 transitions, 7785 flow [2022-12-13 13:35:20,822 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:20,822 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:20,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 332 transitions, 7785 flow [2022-12-13 13:35:20,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 332 transitions, 7785 flow [2022-12-13 13:35:20,987 INFO L130 PetriNetUnfolder]: 420/1227 cut-off events. [2022-12-13 13:35:20,987 INFO L131 PetriNetUnfolder]: For 27027/27146 co-relation queries the response was YES. [2022-12-13 13:35:20,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9537 conditions, 1227 events. 420/1227 cut-off events. For 27027/27146 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9709 event pairs, 2 based on Foata normal form. 53/1252 useless extension candidates. Maximal degree in co-relation 9365. Up to 502 conditions per place. [2022-12-13 13:35:21,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 332 transitions, 7785 flow [2022-12-13 13:35:21,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 13:35:21,002 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:21,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-13 13:35:21,002 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 332 transitions, 7785 flow [2022-12-13 13:35:21,003 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-13 13:35:21,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:21,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 13:35:21,003 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-13 13:35:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1277838269, now seen corresponding path program 1 times [2022-12-13 13:35:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:21,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823204033] [2022-12-13 13:35:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:21,737 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-13 13:35:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:21,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823204033] [2022-12-13 13:35:21,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823204033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:21,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435381835] [2022-12-13 13:35:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:21,739 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-13 13:35:21,742 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-13 13:35:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:21,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:35:21,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:21,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:21,950 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-13 13:35:22,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:22,001 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-13 13:35:22,038 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-13 13:35:22,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:22,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:22,154 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-13 13:35:22,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:22,165 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-13 13:35:22,334 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-13 13:35:22,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435381835] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:22,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:22,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:35:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575185532] [2022-12-13 13:35:22,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:22,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:35:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:35:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:35:22,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-13 13:35:22,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 332 transitions, 7785 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-13 13:35:22,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:22,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-13 13:35:22,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:23,472 INFO L130 PetriNetUnfolder]: 1672/3111 cut-off events. [2022-12-13 13:35:23,472 INFO L131 PetriNetUnfolder]: For 74439/74517 co-relation queries the response was YES. [2022-12-13 13:35:23,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26973 conditions, 3111 events. 1672/3111 cut-off events. For 74439/74517 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20708 event pairs, 374 based on Foata normal form. 74/3151 useless extension candidates. Maximal degree in co-relation 26528. Up to 2972 conditions per place. [2022-12-13 13:35:23,499 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 301 selfloop transitions, 52 changer transitions 7/361 dead transitions. [2022-12-13 13:35:23,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 361 transitions, 8774 flow [2022-12-13 13:35:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:35:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:35:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-12-13 13:35:23,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18801652892561985 [2022-12-13 13:35:23,500 INFO L175 Difference]: Start difference. First operand has 185 places, 332 transitions, 7785 flow. Second operand 11 states and 91 transitions. [2022-12-13 13:35:23,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 361 transitions, 8774 flow [2022-12-13 13:35:23,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 361 transitions, 8716 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:35:23,779 INFO L231 Difference]: Finished difference. Result has 196 places, 338 transitions, 7983 flow [2022-12-13 13:35:23,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7727, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7983, PETRI_PLACES=196, PETRI_TRANSITIONS=338} [2022-12-13 13:35:23,780 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 175 predicate places. [2022-12-13 13:35:23,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:23,780 INFO L89 Accepts]: Start accepts. Operand has 196 places, 338 transitions, 7983 flow [2022-12-13 13:35:23,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:23,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:23,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 338 transitions, 7983 flow [2022-12-13 13:35:23,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 338 transitions, 7983 flow [2022-12-13 13:35:23,950 INFO L130 PetriNetUnfolder]: 423/1244 cut-off events. [2022-12-13 13:35:23,950 INFO L131 PetriNetUnfolder]: For 27991/28093 co-relation queries the response was YES. [2022-12-13 13:35:23,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 1244 events. 423/1244 cut-off events. For 27991/28093 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9947 event pairs, 2 based on Foata normal form. 46/1262 useless extension candidates. Maximal degree in co-relation 9614. Up to 508 conditions per place. [2022-12-13 13:35:23,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 338 transitions, 7983 flow [2022-12-13 13:35:23,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-13 13:35:23,969 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_681| v_~q~0.base_463))) (let ((.cse3 (* 4 v_~q_front~0_811)) (.cse2 (* v_~q_back~0_957 4)) (.cse0 (select .cse1 (+ (* 4 v_~q_front~0_813) v_~q~0.offset_462)))) (and (not (= .cse0 0)) (= (+ 3 v_~q_front~0_813) v_~q_front~0_811) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_487| 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_462 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| 3) (< 2 v_~N~0_367) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487| (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_462)) 1) 1 0)) (= (select .cse1 (+ .cse3 (- 4) v_~q~0.offset_462)) |v_thread2Thread1of1ForFork1_~j~0#1_485|) (not (= (ite (let ((.cse4 (+ 2 v_~q_back~0_957))) (and (<= 0 .cse4) (< .cse4 v_~n~0_459))) 1 0) 0)) (= (+ .cse0 (select .cse1 (+ .cse3 v_~q~0.offset_462 (- 8))) v_~s~0_762 |v_thread2Thread1of1ForFork1_~j~0#1_485|) v_~s~0_760) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_440| (ite (and (<= 1 v_~q_front~0_811) (< v_~q_front~0_811 (+ v_~n~0_459 1)) (< v_~q_front~0_811 (+ v_~q_back~0_956 1))) 1 0)) (= (+ 3 v_~q_back~0_957) v_~q_back~0_956) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_462)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_487|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_440| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_440|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_485| 0)) (not (= (ite (and (<= 0 v_~q_front~0_813) (< v_~q_front~0_813 v_~n~0_459) (< v_~q_front~0_813 (+ v_~q_back~0_957 1))) 1 0) 0)) (not (= v_~s~0_760 (+ .cse0 v_~s~0_762 |v_thread2Thread1of1ForFork1_~j~0#1_485|)))))) InVars {~q_back~0=v_~q_back~0_957, #memory_int=|v_#memory_int_681|, ~N~0=v_~N~0_367, ~q~0.base=v_~q~0.base_463, ~n~0=v_~n~0_459, ~q~0.offset=v_~q~0.offset_462, ~s~0=v_~s~0_762, ~q_front~0=v_~q_front~0_813} 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_440|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_440|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_346|, ~N~0=v_~N~0_367, ~q~0.base=v_~q~0.base_463, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_440|, ~q~0.offset=v_~q~0.offset_462, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_440|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_350|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_346|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_681|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_487|, ~n~0=v_~n~0_459, ~s~0=v_~s~0_760, ~q_front~0=v_~q_front~0_811} 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-13 13:35:24,415 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-13 13:35:24,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:24,648 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:24,649 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:24,649 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:24,649 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:25,525 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-13 13:35:25,619 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-13 13:35:25,712 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:35:25,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1932 [2022-12-13 13:35:25,712 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 334 transitions, 8032 flow [2022-12-13 13:35:25,712 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-13 13:35:25,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:25,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:25,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-13 13:35:25,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-13 13:35:25,913 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-13 13:35:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash 150393299, now seen corresponding path program 1 times [2022-12-13 13:35:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:25,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565813414] [2022-12-13 13:35:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:26,774 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-13 13:35:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565813414] [2022-12-13 13:35:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565813414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862937683] [2022-12-13 13:35:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:26,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:26,786 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-13 13:35:26,787 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-13 13:35:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:26,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 13:35:26,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:26,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:26,987 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-13 13:35:27,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:27,045 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-13 13:35:27,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-13 13:35:27,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:27,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:27,174 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-13 13:35:27,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:27,188 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-13 13:35:27,337 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-13 13:35:27,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862937683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:27,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:27,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:35:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968842281] [2022-12-13 13:35:27,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:27,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:35:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:35:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:35:27,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 13:35:27,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 334 transitions, 8032 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-13 13:35:27,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:27,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 13:35:27,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:28,469 INFO L130 PetriNetUnfolder]: 1676/3118 cut-off events. [2022-12-13 13:35:28,470 INFO L131 PetriNetUnfolder]: For 77637/77697 co-relation queries the response was YES. [2022-12-13 13:35:28,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27325 conditions, 3118 events. 1676/3118 cut-off events. For 77637/77697 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20652 event pairs, 380 based on Foata normal form. 60/3144 useless extension candidates. Maximal degree in co-relation 27018. Up to 2975 conditions per place. [2022-12-13 13:35:28,500 INFO L137 encePairwiseOnDemand]: 17/50 looper letters, 301 selfloop transitions, 58 changer transitions 12/372 dead transitions. [2022-12-13 13:35:28,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 372 transitions, 9119 flow [2022-12-13 13:35:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:35:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:35:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2022-12-13 13:35:28,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18 [2022-12-13 13:35:28,501 INFO L175 Difference]: Start difference. First operand has 191 places, 334 transitions, 8032 flow. Second operand 13 states and 117 transitions. [2022-12-13 13:35:28,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 372 transitions, 9119 flow [2022-12-13 13:35:28,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 372 transitions, 8820 flow, removed 78 selfloop flow, removed 10 redundant places. [2022-12-13 13:35:28,801 INFO L231 Difference]: Finished difference. Result has 193 places, 339 transitions, 8019 flow [2022-12-13 13:35:28,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7773, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8019, PETRI_PLACES=193, PETRI_TRANSITIONS=339} [2022-12-13 13:35:28,801 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 172 predicate places. [2022-12-13 13:35:28,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:28,801 INFO L89 Accepts]: Start accepts. Operand has 193 places, 339 transitions, 8019 flow [2022-12-13 13:35:28,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:28,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:28,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 339 transitions, 8019 flow [2022-12-13 13:35:28,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 339 transitions, 8019 flow [2022-12-13 13:35:28,967 INFO L130 PetriNetUnfolder]: 425/1237 cut-off events. [2022-12-13 13:35:28,967 INFO L131 PetriNetUnfolder]: For 26760/26860 co-relation queries the response was YES. [2022-12-13 13:35:28,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9709 conditions, 1237 events. 425/1237 cut-off events. For 26760/26860 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9790 event pairs, 2 based on Foata normal form. 45/1253 useless extension candidates. Maximal degree in co-relation 9532. Up to 506 conditions per place. [2022-12-13 13:35:28,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 339 transitions, 8019 flow [2022-12-13 13:35:28,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 1192 [2022-12-13 13:35:28,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:29,139 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,140 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,140 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,140 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,140 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,140 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_725| v_~q~0.base_495))) (let ((.cse2 (+ v_~q_back~0_1023 4)) (.cse5 (* 4 v_~q_front~0_893)) (.cse1 (* v_~q_back~0_1023 4)) (.cse4 (select .cse0 (+ v_~q~0.offset_494 (* 4 v_~q_front~0_894))))) (and (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_494)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_519| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_519|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_496| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_496|) (= .cse2 v_~q_back~0_1021) (< |v_thread1Thread1of1ForFork0_~i~0#1_535| (+ v_~N~0_387 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_519| 0)) (not (= (ite (let ((.cse3 (+ 3 v_~q_back~0_1023))) (and (<= 0 .cse3) (< .cse3 v_~n~0_491))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_519| (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_494)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_544| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_496| (ite (and (< v_~q_front~0_893 (+ v_~n~0_491 1)) (< v_~q_front~0_893 .cse2) (<= 1 v_~q_front~0_893)) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_894) (< v_~q_front~0_894 (+ v_~q_back~0_1023 1)) (< v_~q_front~0_894 v_~n~0_491)) 1 0) 0)) (not (= (+ .cse4 v_~s~0_849 |v_thread2Thread1of1ForFork1_~j~0#1_544|) v_~s~0_848)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_494 4)) 1) 1 0) 0)) (= (+ 3 v_~q_front~0_894) v_~q_front~0_893) (= |v_thread1Thread1of1ForFork0_~i~0#1_535| 4) (= (select .cse0 (+ .cse5 (- 4) v_~q~0.offset_494)) |v_thread2Thread1of1ForFork1_~j~0#1_544|) (= (+ (select .cse0 (+ .cse5 v_~q~0.offset_494 (- 8))) .cse4 v_~s~0_849 |v_thread2Thread1of1ForFork1_~j~0#1_544|) v_~s~0_848) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_494)) 1) 1 0) 0)) (not (= .cse4 0))))) InVars {~q_back~0=v_~q_back~0_1023, #memory_int=|v_#memory_int_725|, ~N~0=v_~N~0_387, ~q~0.base=v_~q~0.base_495, ~n~0=v_~n~0_491, ~q~0.offset=v_~q~0.offset_494, ~s~0=v_~s~0_849, ~q_front~0=v_~q_front~0_894} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_544|, ~q_back~0=v_~q_back~0_1021, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_496|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_359|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_496|, ~N~0=v_~N~0_387, ~q~0.base=v_~q~0.base_495, ~q~0.offset=v_~q~0.offset_494, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_496|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_496|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_519|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_363|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_359|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_535|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_519|, #memory_int=|v_#memory_int_725|, ~n~0=v_~n~0_491, ~s~0=v_~s~0_848, ~q_front~0=v_~q_front~0_893} 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-13 13:35:29,629 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,630 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,630 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,630 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,630 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:29,630 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,100 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,100 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,100 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,101 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,101 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,101 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:30,780 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:35:30,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1980 [2022-12-13 13:35:30,781 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 338 transitions, 8082 flow [2022-12-13 13:35:30,781 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-13 13:35:30,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:30,781 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:30,786 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-13 13:35:30,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:30,981 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-13 13:35:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1954715425, now seen corresponding path program 1 times [2022-12-13 13:35:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310113707] [2022-12-13 13:35:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:31,726 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-13 13:35:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310113707] [2022-12-13 13:35:31,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310113707] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137986101] [2022-12-13 13:35:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:31,728 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-13 13:35:31,730 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-13 13:35:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:31,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 13:35:31,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:31,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:31,950 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-13 13:35:32,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:32,020 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-13 13:35:32,041 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-13 13:35:32,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:32,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:32,149 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-13 13:35:32,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:32,156 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-13 13:35:32,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:32,161 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-13 13:35:32,215 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-13 13:35:32,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137986101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:32,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:32,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:35:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666773965] [2022-12-13 13:35:32,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:32,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:35:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:35:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:35:32,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-13 13:35:32,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 338 transitions, 8082 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-13 13:35:32,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:32,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-13 13:35:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:33,491 INFO L130 PetriNetUnfolder]: 1696/3164 cut-off events. [2022-12-13 13:35:33,491 INFO L131 PetriNetUnfolder]: For 79183/79276 co-relation queries the response was YES. [2022-12-13 13:35:33,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27769 conditions, 3164 events. 1696/3164 cut-off events. For 79183/79276 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 21202 event pairs, 375 based on Foata normal form. 75/3202 useless extension candidates. Maximal degree in co-relation 27371. Up to 2925 conditions per place. [2022-12-13 13:35:33,520 INFO L137 encePairwiseOnDemand]: 23/52 looper letters, 325 selfloop transitions, 68 changer transitions 16/410 dead transitions. [2022-12-13 13:35:33,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 410 transitions, 9542 flow [2022-12-13 13:35:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:35:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:35:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 158 transitions. [2022-12-13 13:35:33,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16880341880341881 [2022-12-13 13:35:33,522 INFO L175 Difference]: Start difference. First operand has 190 places, 338 transitions, 8082 flow. Second operand 18 states and 158 transitions. [2022-12-13 13:35:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 410 transitions, 9542 flow [2022-12-13 13:35:33,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 410 transitions, 9302 flow, removed 33 selfloop flow, removed 8 redundant places. [2022-12-13 13:35:33,778 INFO L231 Difference]: Finished difference. Result has 208 places, 350 transitions, 8315 flow [2022-12-13 13:35:33,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=7842, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8315, PETRI_PLACES=208, PETRI_TRANSITIONS=350} [2022-12-13 13:35:33,778 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 187 predicate places. [2022-12-13 13:35:33,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:33,778 INFO L89 Accepts]: Start accepts. Operand has 208 places, 350 transitions, 8315 flow [2022-12-13 13:35:33,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:33,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:33,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 350 transitions, 8315 flow [2022-12-13 13:35:33,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 350 transitions, 8315 flow [2022-12-13 13:35:33,953 INFO L130 PetriNetUnfolder]: 428/1249 cut-off events. [2022-12-13 13:35:33,954 INFO L131 PetriNetUnfolder]: For 27723/27853 co-relation queries the response was YES. [2022-12-13 13:35:33,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 1249 events. 428/1249 cut-off events. For 27723/27853 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9963 event pairs, 2 based on Foata normal form. 54/1275 useless extension candidates. Maximal degree in co-relation 9852. Up to 512 conditions per place. [2022-12-13 13:35:33,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 350 transitions, 8315 flow [2022-12-13 13:35:33,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-13 13:35:33,977 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:33,977 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,054 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,054 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,135 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,136 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,213 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,213 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_733| v_~q~0.base_503))) (let ((.cse0 (select .cse1 (+ (* 4 v_~q_front~0_910) v_~q~0.offset_502))) (.cse2 (* v_~q_back~0_1043 4)) (.cse3 (+ v_~n~0_499 1))) (and (= (+ 2 v_~q_front~0_910) v_~q_front~0_909) (= (+ .cse0 v_~s~0_865 |v_thread2Thread1of1ForFork1_~j~0#1_552|) v_~s~0_864) (= |v_thread1Thread1of1ForFork0_#res#1.offset_210| 0) (= v_~q_back~0_1041 (+ 5 v_~q_back~0_1043)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_552| 0)) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_502)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_210| 0) (not (= .cse0 0)) (= (select .cse1 (+ (- 4) v_~q~0.offset_502 (* 4 v_~q_front~0_909))) |v_thread2Thread1of1ForFork1_~j~0#1_552|) (not (= (ite (and (< v_~q_front~0_910 (+ v_~q_back~0_1043 1)) (< v_~q_front~0_910 v_~n~0_499) (<= 0 v_~q_front~0_910)) 1 0) 0)) (not (= 0 (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_502)) 1) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_549| 4) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_502 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_504| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_504|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_502)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_531| 0)) (not (= (ite (and (< v_~q_back~0_1041 .cse3) (<= 1 v_~q_back~0_1041)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_549| (+ v_~N~0_395 1)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_549| v_~N~0_395)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_531| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_531|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_531| (ite (= (select .cse1 (+ (* v_~q_back~0_1041 4) (- 4) v_~q~0.offset_502)) 0) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_504| (ite (and (< v_~q_front~0_909 (+ 3 v_~q_back~0_1043)) (<= 1 v_~q_front~0_909) (< v_~q_front~0_909 .cse3)) 1 0))))) InVars {~q_back~0=v_~q_back~0_1043, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_395, ~q~0.base=v_~q~0.base_503, ~n~0=v_~n~0_499, ~q~0.offset=v_~q~0.offset_502, ~s~0=v_~s~0_865, ~q_front~0=v_~q_front~0_910} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_552|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_210|, ~q_back~0=v_~q_back~0_1041, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_228|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_504|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_369|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_504|, ~N~0=v_~N~0_395, ~q~0.base=v_~q~0.base_503, ~q~0.offset=v_~q~0.offset_502, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_504|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_504|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_531|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_373|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_369|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_549|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_531|, #memory_int=|v_#memory_int_733|, ~n~0=v_~n~0_499, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_210|, ~s~0=v_~s~0_864, ~q_front~0=v_~q_front~0_909} 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 [792] L65-2-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_757| v_~q~0.base_523)) (.cse3 (* 4 v_~q_front~0_969))) (let ((.cse1 (select .cse2 (+ .cse3 v_~q~0.offset_522)))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_592| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_542| (ite (let ((.cse0 (+ 1 v_~q_front~0_969))) (and (< .cse0 v_~n~0_519) (< .cse0 v_~q_back~0_1088) (<= 0 .cse0))) 1 0)) (not (= (ite (and (< v_~q_front~0_969 v_~n~0_519) (< v_~q_front~0_969 v_~q_back~0_1088) (<= 0 v_~q_front~0_969)) 1 0) 0)) (not (= 0 .cse1)) (= (+ v_~s~0_928 |v_thread2Thread1of1ForFork1_~j~0#1_592| .cse1) v_~s~0_926) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_542| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_542|) (= (select .cse2 (+ .cse3 v_~q~0.offset_522 4)) |v_thread2Thread1of1ForFork1_~j~0#1_592|) (= (+ 2 v_~q_front~0_969) v_~q_front~0_967) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_542| 0))))) InVars {~q_back~0=v_~q_back~0_1088, #memory_int=|v_#memory_int_757|, ~q~0.base=v_~q~0.base_523, ~n~0=v_~n~0_519, ~q~0.offset=v_~q~0.offset_522, ~s~0=v_~s~0_928, ~q_front~0=v_~q_front~0_969} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_542|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_592|, ~q_back~0=v_~q_back~0_1088, #memory_int=|v_#memory_int_757|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_542|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_542|, ~q~0.base=v_~q~0.base_523, ~n~0=v_~n~0_519, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_542|, ~q~0.offset=v_~q~0.offset_522, ~s~0=v_~s~0_926, ~q_front~0=v_~q_front~0_967} 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-13 13:35:34,913 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,914 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:35,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:35:35,336 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:35,337 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:36,064 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 13:35:36,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2287 [2022-12-13 13:35:36,065 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 344 transitions, 8210 flow [2022-12-13 13:35:36,065 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-13 13:35:36,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:36,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:36,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-13 13:35:36,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:36,270 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-13 13:35:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2095419526, now seen corresponding path program 1 times [2022-12-13 13:35:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:36,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367698478] [2022-12-13 13:35:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:36,686 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-13 13:35:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:36,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367698478] [2022-12-13 13:35:36,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367698478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:36,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:36,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157901917] [2022-12-13 13:35:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:36,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:35:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:35:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:35:36,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-13 13:35:36,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 344 transitions, 8210 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-13 13:35:36,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:36,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-13 13:35:36,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:37,475 INFO L130 PetriNetUnfolder]: 1663/3088 cut-off events. [2022-12-13 13:35:37,475 INFO L131 PetriNetUnfolder]: For 77908/77961 co-relation queries the response was YES. [2022-12-13 13:35:37,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27201 conditions, 3088 events. 1663/3088 cut-off events. For 77908/77961 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 20466 event pairs, 427 based on Foata normal form. 41/3095 useless extension candidates. Maximal degree in co-relation 27046. Up to 3026 conditions per place. [2022-12-13 13:35:37,502 INFO L137 encePairwiseOnDemand]: 38/55 looper letters, 330 selfloop transitions, 17 changer transitions 10/358 dead transitions. [2022-12-13 13:35:37,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 358 transitions, 8953 flow [2022-12-13 13:35:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:35:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:35:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-13 13:35:37,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23636363636363636 [2022-12-13 13:35:37,503 INFO L175 Difference]: Start difference. First operand has 199 places, 344 transitions, 8210 flow. Second operand 6 states and 78 transitions. [2022-12-13 13:35:37,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 358 transitions, 8953 flow [2022-12-13 13:35:37,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 358 transitions, 8759 flow, removed 83 selfloop flow, removed 7 redundant places. [2022-12-13 13:35:37,778 INFO L231 Difference]: Finished difference. Result has 200 places, 343 transitions, 7992 flow [2022-12-13 13:35:37,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=7938, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7992, PETRI_PLACES=200, PETRI_TRANSITIONS=343} [2022-12-13 13:35:37,778 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 179 predicate places. [2022-12-13 13:35:37,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:37,778 INFO L89 Accepts]: Start accepts. Operand has 200 places, 343 transitions, 7992 flow [2022-12-13 13:35:37,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:37,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:37,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 343 transitions, 7992 flow [2022-12-13 13:35:37,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 343 transitions, 7992 flow [2022-12-13 13:35:37,937 INFO L130 PetriNetUnfolder]: 427/1241 cut-off events. [2022-12-13 13:35:37,937 INFO L131 PetriNetUnfolder]: For 26444/26544 co-relation queries the response was YES. [2022-12-13 13:35:37,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 1241 events. 427/1241 cut-off events. For 26444/26544 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9878 event pairs, 2 based on Foata normal form. 44/1257 useless extension candidates. Maximal degree in co-relation 9587. Up to 512 conditions per place. [2022-12-13 13:35:37,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 343 transitions, 7992 flow [2022-12-13 13:35:37,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 1200 [2022-12-13 13:35:37,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_745| v_~q~0.base_513)) (.cse3 (* 4 v_~q_front~0_933))) (let ((.cse1 (* v_~q_back~0_1070 4)) (.cse2 (select .cse0 (+ v_~q~0.offset_512 .cse3 (- 8)))) (.cse4 (select .cse0 (+ (- 12) v_~q~0.offset_512 .cse3))) (.cse6 (select .cse0 (+ (* 4 v_~q_front~0_935) v_~q~0.offset_512)))) (and (not (= (ite (= (select .cse0 (+ v_~q~0.offset_512 .cse1)) 1) 1 0) 0)) (not (= .cse2 0)) (= (+ 4 v_~q_front~0_935) v_~q_front~0_933) (= (select .cse0 (+ (- 4) v_~q~0.offset_512 .cse3)) |v_thread2Thread1of1ForFork1_~j~0#1_567|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_512 .cse1 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_518| (ite (and (<= 1 v_~q_front~0_933) (< v_~q_front~0_933 (+ v_~q_back~0_1069 1)) (< v_~q_front~0_933 (+ v_~n~0_509 1))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_567| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_549| (ite (= (select .cse0 (+ 12 v_~q~0.offset_512 .cse1)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_549| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549|) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_512 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_569| 4) (not (= .cse4 0)) (not (= (ite (let ((.cse5 (+ 3 v_~q_back~0_1070))) (and (< .cse5 v_~n~0_509) (<= 0 .cse5))) 1 0) 0)) (= (+ v_~q_back~0_1070 4) v_~q_back~0_1069) (< |v_thread1Thread1of1ForFork0_~i~0#1_569| (+ v_~N~0_405 1)) (not (= 0 .cse6)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_518| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_518|) (not (= (ite (and (< v_~q_front~0_935 (+ v_~q_back~0_1070 1)) (< v_~q_front~0_935 v_~n~0_509) (<= 0 v_~q_front~0_935)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549| 0)) (= v_~s~0_890 (+ .cse2 .cse4 v_~s~0_892 |v_thread2Thread1of1ForFork1_~j~0#1_567| .cse6))))) InVars {~q_back~0=v_~q_back~0_1070, #memory_int=|v_#memory_int_745|, ~N~0=v_~N~0_405, ~q~0.base=v_~q~0.base_513, ~n~0=v_~n~0_509, ~q~0.offset=v_~q~0.offset_512, ~s~0=v_~s~0_892, ~q_front~0=v_~q_front~0_935} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_567|, ~q_back~0=v_~q_back~0_1069, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_518|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_518|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_382|, ~N~0=v_~N~0_405, ~q~0.base=v_~q~0.base_513, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_518|, ~q~0.offset=v_~q~0.offset_512, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_518|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_549|, 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_569|, #memory_int=|v_#memory_int_745|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_549|, ~n~0=v_~n~0_509, ~s~0=v_~s~0_890, ~q_front~0=v_~q_front~0_933} 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-13 13:35:38,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:35:38,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 695 [2022-12-13 13:35:38,473 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 342 transitions, 7984 flow [2022-12-13 13:35:38,473 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-13 13:35:38,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:38,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:38,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 13:35:38,473 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-13 13:35:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2047699992, now seen corresponding path program 1 times [2022-12-13 13:35:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:38,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845157880] [2022-12-13 13:35:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:38,546 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-13 13:35:38,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:38,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845157880] [2022-12-13 13:35:38,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845157880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:38,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777126041] [2022-12-13 13:35:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:38,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:38,549 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-13 13:35:38,549 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-13 13:35:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:38,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:35:38,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:38,742 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-13 13:35:38,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:35:38,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777126041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:38,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:35:38,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 13:35:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284087706] [2022-12-13 13:35:38,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:38,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:35:38,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 54 [2022-12-13 13:35:38,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 342 transitions, 7984 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-13 13:35:38,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:38,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 54 [2022-12-13 13:35:38,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:39,402 INFO L130 PetriNetUnfolder]: 1793/3315 cut-off events. [2022-12-13 13:35:39,403 INFO L131 PetriNetUnfolder]: For 80331/80407 co-relation queries the response was YES. [2022-12-13 13:35:39,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29016 conditions, 3315 events. 1793/3315 cut-off events. For 80331/80407 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22045 event pairs, 148 based on Foata normal form. 82/3363 useless extension candidates. Maximal degree in co-relation 28873. Up to 1669 conditions per place. [2022-12-13 13:35:39,434 INFO L137 encePairwiseOnDemand]: 23/54 looper letters, 191 selfloop transitions, 203 changer transitions 13/408 dead transitions. [2022-12-13 13:35:39,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 408 transitions, 9968 flow [2022-12-13 13:35:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 13:35:39,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-13 13:35:39,435 INFO L175 Difference]: Start difference. First operand has 196 places, 342 transitions, 7984 flow. Second operand 5 states and 87 transitions. [2022-12-13 13:35:39,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 408 transitions, 9968 flow [2022-12-13 13:35:39,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 408 transitions, 9910 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 13:35:39,728 INFO L231 Difference]: Finished difference. Result has 197 places, 362 transitions, 9194 flow [2022-12-13 13:35:39,729 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7930, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9194, PETRI_PLACES=197, PETRI_TRANSITIONS=362} [2022-12-13 13:35:39,729 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 176 predicate places. [2022-12-13 13:35:39,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:39,729 INFO L89 Accepts]: Start accepts. Operand has 197 places, 362 transitions, 9194 flow [2022-12-13 13:35:39,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:39,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:39,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 362 transitions, 9194 flow [2022-12-13 13:35:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 362 transitions, 9194 flow [2022-12-13 13:35:39,911 INFO L130 PetriNetUnfolder]: 460/1318 cut-off events. [2022-12-13 13:35:39,911 INFO L131 PetriNetUnfolder]: For 32150/32297 co-relation queries the response was YES. [2022-12-13 13:35:39,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11491 conditions, 1318 events. 460/1318 cut-off events. For 32150/32297 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10490 event pairs, 2 based on Foata normal form. 49/1340 useless extension candidates. Maximal degree in co-relation 11398. Up to 563 conditions per place. [2022-12-13 13:35:39,926 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 362 transitions, 9194 flow [2022-12-13 13:35:39,926 INFO L226 LiptonReduction]: Number of co-enabled transitions 1248 [2022-12-13 13:35:39,927 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:39,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 13:35:39,928 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 362 transitions, 9194 flow [2022-12-13 13:35:39,928 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-13 13:35:39,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:39,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:39,935 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-13 13:35:40,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:40,129 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-13 13:35:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:40,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1859764270, now seen corresponding path program 1 times [2022-12-13 13:35:40,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:40,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866598351] [2022-12-13 13:35:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:40,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:40,585 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-13 13:35:40,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:40,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866598351] [2022-12-13 13:35:40,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866598351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:40,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396293013] [2022-12-13 13:35:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:40,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:40,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:40,587 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-13 13:35:40,587 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-13 13:35:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:40,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 13:35:40,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:40,992 INFO L321 Elim1Store]: treesize reduction 335, result has 4.6 percent of original size [2022-12-13 13:35:40,992 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 113 treesize of output 39 [2022-12-13 13:35:41,014 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-13 13:35:41,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:41,190 INFO L321 Elim1Store]: treesize reduction 140, result has 58.9 percent of original size [2022-12-13 13:35:41,190 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 242 [2022-12-13 13:35:41,304 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-13 13:35:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396293013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:41,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 13:35:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895492881] [2022-12-13 13:35:41,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:41,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:35:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:35:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:35:41,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 13:35:41,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 362 transitions, 9194 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-13 13:35:41,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:41,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 13:35:41,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:42,649 INFO L130 PetriNetUnfolder]: 2104/3928 cut-off events. [2022-12-13 13:35:42,649 INFO L131 PetriNetUnfolder]: For 109310/109386 co-relation queries the response was YES. [2022-12-13 13:35:42,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37986 conditions, 3928 events. 2104/3928 cut-off events. For 109310/109386 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27370 event pairs, 484 based on Foata normal form. 65/3959 useless extension candidates. Maximal degree in co-relation 37877. Up to 2531 conditions per place. [2022-12-13 13:35:42,686 INFO L137 encePairwiseOnDemand]: 26/48 looper letters, 427 selfloop transitions, 43 changer transitions 11/482 dead transitions. [2022-12-13 13:35:42,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 482 transitions, 12530 flow [2022-12-13 13:35:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:35:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:35:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-12-13 13:35:42,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20265151515151514 [2022-12-13 13:35:42,687 INFO L175 Difference]: Start difference. First operand has 194 places, 362 transitions, 9194 flow. Second operand 11 states and 107 transitions. [2022-12-13 13:35:42,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 482 transitions, 12530 flow [2022-12-13 13:35:43,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 482 transitions, 12370 flow, removed 49 selfloop flow, removed 5 redundant places. [2022-12-13 13:35:43,150 INFO L231 Difference]: Finished difference. Result has 202 places, 367 transitions, 9282 flow [2022-12-13 13:35:43,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9072, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9282, PETRI_PLACES=202, PETRI_TRANSITIONS=367} [2022-12-13 13:35:43,151 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 181 predicate places. [2022-12-13 13:35:43,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:43,151 INFO L89 Accepts]: Start accepts. Operand has 202 places, 367 transitions, 9282 flow [2022-12-13 13:35:43,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:43,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:43,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 367 transitions, 9282 flow [2022-12-13 13:35:43,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 367 transitions, 9282 flow [2022-12-13 13:35:43,369 INFO L130 PetriNetUnfolder]: 537/1566 cut-off events. [2022-12-13 13:35:43,369 INFO L131 PetriNetUnfolder]: For 37168/37342 co-relation queries the response was YES. [2022-12-13 13:35:43,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13748 conditions, 1566 events. 537/1566 cut-off events. For 37168/37342 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 13213 event pairs, 2 based on Foata normal form. 57/1594 useless extension candidates. Maximal degree in co-relation 13535. Up to 674 conditions per place. [2022-12-13 13:35:43,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 367 transitions, 9282 flow [2022-12-13 13:35:43,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-13 13:35:43,389 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,389 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,389 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,389 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,661 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,662 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,662 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,662 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,662 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:43,662 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,409 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,409 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,409 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,409 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,409 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,410 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [800] $Ultimate##0-->L47-4: Formula: (let ((.cse3 (* 4 v_~q_front~0_999)) (.cse1 (select |v_#memory_int_769| v_~q~0.base_535))) (let ((.cse0 (select .cse1 (+ (* v_~q_front~0_1000 4) v_~q~0.offset_534))) (.cse4 (select .cse1 (+ .cse3 (- 12) v_~q~0.offset_534))) (.cse5 (+ 5 v_~q_back~0_1110)) (.cse2 (* v_~q_back~0_1110 4)) (.cse6 (select .cse1 (+ .cse3 v_~q~0.offset_534 (- 8))))) (and (not (= .cse0 0)) (not (= (ite (= (select .cse1 (+ 8 v_~q~0.offset_534 .cse2)) 1) 1 0) 0)) (= (select .cse1 (+ .cse3 (- 4) v_~q~0.offset_534)) |v_thread2Thread1of1ForFork1_~j~0#1_612|) (not (= (ite (and (< v_~q_front~0_1000 (+ v_~q_back~0_1110 1)) (< v_~q_front~0_1000 v_~n~0_531) (<= 0 v_~q_front~0_1000)) 1 0) 0)) (not (= .cse4 0)) (= (+ v_~q_front~0_1000 4) v_~q_front~0_999) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_562| (ite (and (<= 1 v_~q_front~0_999) (< v_~q_front~0_999 (+ v_~n~0_531 1)) (< v_~q_front~0_999 .cse5)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_566|) (= |v_thread1Thread1of1ForFork0_~i~0#1_583| 5) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_534 .cse2 4)) 1) 1 0) 0)) (= (+ .cse0 .cse6 .cse4 v_~s~0_959 |v_thread2Thread1of1ForFork1_~j~0#1_612|) v_~s~0_958) (not (= (ite (let ((.cse7 (+ v_~q_back~0_1110 4))) (and (< .cse7 v_~n~0_531) (<= 0 .cse7))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_562| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_562|) (= .cse5 v_~q_back~0_1108) (= (ite (= (select .cse1 (+ 16 v_~q~0.offset_534 .cse2)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566|) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_534 .cse2)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_583| (+ v_~N~0_417 1)) (not (= (ite (= (select .cse1 (+ 12 v_~q~0.offset_534 .cse2)) 1) 1 0) 0)) (not (= .cse6 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_612| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_566| 0))))) InVars {~q_back~0=v_~q_back~0_1110, #memory_int=|v_#memory_int_769|, ~N~0=v_~N~0_417, ~q~0.base=v_~q~0.base_535, ~n~0=v_~n~0_531, ~q~0.offset=v_~q~0.offset_534, ~s~0=v_~s~0_959, ~q_front~0=v_~q_front~0_1000} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_612|, ~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_562|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_392|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_562|, ~N~0=v_~N~0_417, ~q~0.base=v_~q~0.base_535, ~q~0.offset=v_~q~0.offset_534, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_562|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_562|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566|, 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_583|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_566|, #memory_int=|v_#memory_int_769|, ~n~0=v_~n~0_531, ~s~0=v_~s~0_958, ~q_front~0=v_~q_front~0_999} 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-13 13:35:44,974 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,974 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,974 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,974 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,974 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:44,974 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:45,618 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:45,619 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:45,619 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:45,619 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:45,619 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:45,619 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:46,311 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:35:46,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3161 [2022-12-13 13:35:46,312 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 367 transitions, 9426 flow [2022-12-13 13:35:46,312 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-13 13:35:46,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:46,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:46,333 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-13 13:35:46,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:46,517 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-13 13:35:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash 291351891, now seen corresponding path program 1 times [2022-12-13 13:35:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:46,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85865099] [2022-12-13 13:35:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:46,858 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-13 13:35:46,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:46,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85865099] [2022-12-13 13:35:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85865099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:46,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:35:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979336258] [2022-12-13 13:35:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:35:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:35:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:46,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-13 13:35:46,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 367 transitions, 9426 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-13 13:35:46,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:46,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-13 13:35:46,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:47,727 INFO L130 PetriNetUnfolder]: 2098/3922 cut-off events. [2022-12-13 13:35:47,727 INFO L131 PetriNetUnfolder]: For 105145/105208 co-relation queries the response was YES. [2022-12-13 13:35:47,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37885 conditions, 3922 events. 2098/3922 cut-off events. For 105145/105208 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27340 event pairs, 553 based on Foata normal form. 45/3931 useless extension candidates. Maximal degree in co-relation 37313. Up to 3858 conditions per place. [2022-12-13 13:35:47,761 INFO L137 encePairwiseOnDemand]: 33/52 looper letters, 351 selfloop transitions, 20 changer transitions 7/379 dead transitions. [2022-12-13 13:35:47,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 379 transitions, 10294 flow [2022-12-13 13:35:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-13 13:35:47,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27307692307692305 [2022-12-13 13:35:47,762 INFO L175 Difference]: Start difference. First operand has 200 places, 367 transitions, 9426 flow. Second operand 5 states and 71 transitions. [2022-12-13 13:35:47,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 379 transitions, 10294 flow [2022-12-13 13:35:48,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 379 transitions, 10069 flow, removed 71 selfloop flow, removed 6 redundant places. [2022-12-13 13:35:48,220 INFO L231 Difference]: Finished difference. Result has 200 places, 367 transitions, 9237 flow [2022-12-13 13:35:48,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=9201, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9237, PETRI_PLACES=200, PETRI_TRANSITIONS=367} [2022-12-13 13:35:48,221 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 179 predicate places. [2022-12-13 13:35:48,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:48,221 INFO L89 Accepts]: Start accepts. Operand has 200 places, 367 transitions, 9237 flow [2022-12-13 13:35:48,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:48,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:48,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 367 transitions, 9237 flow [2022-12-13 13:35:48,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 367 transitions, 9237 flow [2022-12-13 13:35:48,478 INFO L130 PetriNetUnfolder]: 535/1559 cut-off events. [2022-12-13 13:35:48,478 INFO L131 PetriNetUnfolder]: For 35760/35900 co-relation queries the response was YES. [2022-12-13 13:35:48,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13687 conditions, 1559 events. 535/1559 cut-off events. For 35760/35900 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13115 event pairs, 0 based on Foata normal form. 43/1571 useless extension candidates. Maximal degree in co-relation 13546. Up to 672 conditions per place. [2022-12-13 13:35:48,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 367 transitions, 9237 flow [2022-12-13 13:35:48,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-13 13:35:48,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_780| v_~q~0.base_545)) (.cse7 (* v_~q_front~0_1020 4))) (let ((.cse4 (select .cse2 (+ .cse7 v_~q~0.offset_544 4))) (.cse1 (select .cse2 (+ .cse7 v_~q~0.offset_544))) (.cse5 (select .cse2 (+ .cse7 8 v_~q~0.offset_544))) (.cse3 (* v_~q_back~0_1143 4))) (and (= (+ v_~q_front~0_1020 5) v_~q_front~0_1018) (not (= (ite (let ((.cse0 (+ v_~q_back~0_1143 4))) (and (<= 0 .cse0) (< .cse0 v_~n~0_541))) 1 0) 0)) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572|) (not (= 0 (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_544 4)) 1) 1 0))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_623| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_607| 5) (not (= .cse4 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589|) (not (= .cse5 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_544)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572| (ite (let ((.cse6 (+ v_~q_front~0_1020 4))) (and (< .cse6 v_~n~0_541) (< .cse6 v_~q_back~0_1142) (<= 0 .cse6))) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_607| (+ v_~N~0_427 1)) (not (= (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_544)) 1) 1 0) 0)) (not (= (+ .cse4 .cse1 .cse5 v_~s~0_978 |v_thread2Thread1of1ForFork1_~j~0#1_623|) v_~s~0_976)) (= (+ .cse4 .cse1 (select .cse2 (+ .cse7 12 v_~q~0.offset_544)) .cse5 v_~s~0_978 |v_thread2Thread1of1ForFork1_~j~0#1_623|) v_~s~0_976) (= (select .cse2 (+ 16 .cse7 v_~q~0.offset_544)) |v_thread2Thread1of1ForFork1_~j~0#1_623|) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_544)) 1) 1 0) 0)) (= (ite (= (select .cse2 (+ .cse3 16 v_~q~0.offset_544)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_589|) (not (= (ite (and (< v_~q_front~0_1020 v_~n~0_541) (< v_~q_front~0_1020 (+ v_~q_back~0_1143 1)) (<= 0 v_~q_front~0_1020)) 1 0) 0)) (= (+ 5 v_~q_back~0_1143) v_~q_back~0_1142) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589| 0))))) InVars {~q_back~0=v_~q_back~0_1143, #memory_int=|v_#memory_int_780|, ~N~0=v_~N~0_427, ~q~0.base=v_~q~0.base_545, ~n~0=v_~n~0_541, ~q~0.offset=v_~q~0.offset_544, ~s~0=v_~s~0_978, ~q_front~0=v_~q_front~0_1020} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_623|, ~q_back~0=v_~q_back~0_1142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_572|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_412|, ~N~0=v_~N~0_427, ~q~0.base=v_~q~0.base_545, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_572|, ~q~0.offset=v_~q~0.offset_544, 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_589|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_416|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_412|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_607|, #memory_int=|v_#memory_int_780|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_589|, ~n~0=v_~n~0_541, ~s~0=v_~s~0_976, ~q_front~0=v_~q_front~0_1018} 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-13 13:35:49,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:35:49,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 945 [2022-12-13 13:35:49,166 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 366 transitions, 9227 flow [2022-12-13 13:35:49,166 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-13 13:35:49,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:49,166 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:49,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 13:35:49,166 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-13 13:35:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 293823835, now seen corresponding path program 1 times [2022-12-13 13:35:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:49,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274155727] [2022-12-13 13:35:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:49,213 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-13 13:35:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274155727] [2022-12-13 13:35:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274155727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:49,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:35:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133799199] [2022-12-13 13:35:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:49,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:35:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:35:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:35:49,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 13:35:49,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 366 transitions, 9227 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:49,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:49,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 13:35:49,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:50,037 INFO L130 PetriNetUnfolder]: 2109/3934 cut-off events. [2022-12-13 13:35:50,038 INFO L131 PetriNetUnfolder]: For 110547/110608 co-relation queries the response was YES. [2022-12-13 13:35:50,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37765 conditions, 3934 events. 2109/3934 cut-off events. For 110547/110608 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 27538 event pairs, 711 based on Foata normal form. 23/3923 useless extension candidates. Maximal degree in co-relation 37449. Up to 3443 conditions per place. [2022-12-13 13:35:50,076 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 342 selfloop transitions, 51 changer transitions 0/394 dead transitions. [2022-12-13 13:35:50,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 394 transitions, 10391 flow [2022-12-13 13:35:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:35:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:35:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 13:35:50,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41830065359477125 [2022-12-13 13:35:50,077 INFO L175 Difference]: Start difference. First operand has 197 places, 366 transitions, 9227 flow. Second operand 3 states and 64 transitions. [2022-12-13 13:35:50,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 394 transitions, 10391 flow [2022-12-13 13:35:50,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 394 transitions, 10337 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 13:35:50,445 INFO L231 Difference]: Finished difference. Result has 195 places, 371 transitions, 9432 flow [2022-12-13 13:35:50,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=9095, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=9432, PETRI_PLACES=195, PETRI_TRANSITIONS=371} [2022-12-13 13:35:50,446 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2022-12-13 13:35:50,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:50,446 INFO L89 Accepts]: Start accepts. Operand has 195 places, 371 transitions, 9432 flow [2022-12-13 13:35:50,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:50,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:50,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 371 transitions, 9432 flow [2022-12-13 13:35:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 371 transitions, 9432 flow [2022-12-13 13:35:50,682 INFO L130 PetriNetUnfolder]: 541/1576 cut-off events. [2022-12-13 13:35:50,682 INFO L131 PetriNetUnfolder]: For 36866/37010 co-relation queries the response was YES. [2022-12-13 13:35:50,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13853 conditions, 1576 events. 541/1576 cut-off events. For 36866/37010 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13357 event pairs, 2 based on Foata normal form. 47/1595 useless extension candidates. Maximal degree in co-relation 13647. Up to 679 conditions per place. [2022-12-13 13:35:50,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 371 transitions, 9432 flow [2022-12-13 13:35:50,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-13 13:35:50,700 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:50,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-13 13:35:50,700 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 371 transitions, 9432 flow [2022-12-13 13:35:50,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:50,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:50,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:50,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 13:35:50,701 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-13 13:35:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1175219676, now seen corresponding path program 1 times [2022-12-13 13:35:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820980389] [2022-12-13 13:35:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:50,752 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-13 13:35:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:50,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820980389] [2022-12-13 13:35:50,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820980389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:50,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:50,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:35:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383798675] [2022-12-13 13:35:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:50,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:50,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 13:35:50,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 371 transitions, 9432 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-13 13:35:50,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:50,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 13:35:50,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:51,627 INFO L130 PetriNetUnfolder]: 2080/3895 cut-off events. [2022-12-13 13:35:51,627 INFO L131 PetriNetUnfolder]: For 110588/110641 co-relation queries the response was YES. [2022-12-13 13:35:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37679 conditions, 3895 events. 2080/3895 cut-off events. For 110588/110641 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27252 event pairs, 709 based on Foata normal form. 34/3895 useless extension candidates. Maximal degree in co-relation 37174. Up to 3407 conditions per place. [2022-12-13 13:35:51,660 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 332 selfloop transitions, 47 changer transitions 7/387 dead transitions. [2022-12-13 13:35:51,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 387 transitions, 10330 flow [2022-12-13 13:35:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 13:35:51,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2938775510204082 [2022-12-13 13:35:51,661 INFO L175 Difference]: Start difference. First operand has 195 places, 371 transitions, 9432 flow. Second operand 5 states and 72 transitions. [2022-12-13 13:35:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 387 transitions, 10330 flow [2022-12-13 13:35:51,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 387 transitions, 10279 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:51,968 INFO L231 Difference]: Finished difference. Result has 200 places, 361 transitions, 9246 flow [2022-12-13 13:35:51,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9278, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9246, PETRI_PLACES=200, PETRI_TRANSITIONS=361} [2022-12-13 13:35:51,969 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 179 predicate places. [2022-12-13 13:35:51,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:51,969 INFO L89 Accepts]: Start accepts. Operand has 200 places, 361 transitions, 9246 flow [2022-12-13 13:35:51,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:51,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:51,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 361 transitions, 9246 flow [2022-12-13 13:35:51,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 361 transitions, 9246 flow [2022-12-13 13:35:52,180 INFO L130 PetriNetUnfolder]: 530/1555 cut-off events. [2022-12-13 13:35:52,180 INFO L131 PetriNetUnfolder]: For 36989/37133 co-relation queries the response was YES. [2022-12-13 13:35:52,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13647 conditions, 1555 events. 530/1555 cut-off events. For 36989/37133 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13178 event pairs, 2 based on Foata normal form. 47/1573 useless extension candidates. Maximal degree in co-relation 13467. Up to 664 conditions per place. [2022-12-13 13:35:52,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 361 transitions, 9246 flow [2022-12-13 13:35:52,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-13 13:35:52,200 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:52,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-13 13:35:52,201 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 361 transitions, 9246 flow [2022-12-13 13:35:52,201 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-13 13:35:52,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:52,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:52,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 13:35:52,201 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-13 13:35:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 998547690, now seen corresponding path program 1 times [2022-12-13 13:35:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:52,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062099596] [2022-12-13 13:35:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:52,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-13 13:35:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:52,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062099596] [2022-12-13 13:35:52,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062099596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:52,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975369694] [2022-12-13 13:35:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:52,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:52,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:52,705 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-13 13:35:52,708 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-13 13:35:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:52,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 13:35:52,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:52,935 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-13 13:35:52,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:52,952 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:35:52,953 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-13 13:35:52,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-13 13:35:52,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975369694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:52,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:52,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-13 13:35:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50863650] [2022-12-13 13:35:52,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:52,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:35:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:35:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:35:52,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 13:35:52,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 361 transitions, 9246 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-13 13:35:52,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:52,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 13:35:52,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:54,321 INFO L130 PetriNetUnfolder]: 2273/4270 cut-off events. [2022-12-13 13:35:54,321 INFO L131 PetriNetUnfolder]: For 136429/136501 co-relation queries the response was YES. [2022-12-13 13:35:54,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41174 conditions, 4270 events. 2273/4270 cut-off events. For 136429/136501 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 30285 event pairs, 120 based on Foata normal form. 183/4419 useless extension candidates. Maximal degree in co-relation 40817. Up to 1752 conditions per place. [2022-12-13 13:35:54,362 INFO L137 encePairwiseOnDemand]: 12/47 looper letters, 162 selfloop transitions, 303 changer transitions 10/476 dead transitions. [2022-12-13 13:35:54,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 476 transitions, 11652 flow [2022-12-13 13:35:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:35:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:35:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 170 transitions. [2022-12-13 13:35:54,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22606382978723405 [2022-12-13 13:35:54,363 INFO L175 Difference]: Start difference. First operand has 197 places, 361 transitions, 9246 flow. Second operand 16 states and 170 transitions. [2022-12-13 13:35:54,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 476 transitions, 11652 flow [2022-12-13 13:35:54,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 476 transitions, 11524 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 13:35:54,738 INFO L231 Difference]: Finished difference. Result has 211 places, 396 transitions, 10747 flow [2022-12-13 13:35:54,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9104, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10747, PETRI_PLACES=211, PETRI_TRANSITIONS=396} [2022-12-13 13:35:54,739 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-13 13:35:54,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:54,739 INFO L89 Accepts]: Start accepts. Operand has 211 places, 396 transitions, 10747 flow [2022-12-13 13:35:54,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:54,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:54,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 396 transitions, 10747 flow [2022-12-13 13:35:54,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 396 transitions, 10747 flow [2022-12-13 13:35:54,984 INFO L130 PetriNetUnfolder]: 578/1723 cut-off events. [2022-12-13 13:35:54,984 INFO L131 PetriNetUnfolder]: For 42175/42230 co-relation queries the response was YES. [2022-12-13 13:35:54,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15884 conditions, 1723 events. 578/1723 cut-off events. For 42175/42230 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14760 event pairs, 2 based on Foata normal form. 24/1724 useless extension candidates. Maximal degree in co-relation 15659. Up to 766 conditions per place. [2022-12-13 13:35:55,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 396 transitions, 10747 flow [2022-12-13 13:35:55,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 1350 [2022-12-13 13:35:55,007 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:55,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-13 13:35:55,008 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 396 transitions, 10747 flow [2022-12-13 13:35:55,008 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-13 13:35:55,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:55,008 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:55,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-13 13:35:55,215 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,SelfDestructingSolverStorable88 [2022-12-13 13:35:55,215 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-13 13:35:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1542813038, now seen corresponding path program 1 times [2022-12-13 13:35:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326093811] [2022-12-13 13:35:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:56,174 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-13 13:35:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326093811] [2022-12-13 13:35:56,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326093811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387878248] [2022-12-13 13:35:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:56,176 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-13 13:35:56,177 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-13 13:35:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:56,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 13:35:56,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:56,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:56,393 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-13 13:35:56,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:56,532 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-13 13:35:56,558 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-13 13:35:56,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:56,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:56,693 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-13 13:35:56,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:56,703 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-13 13:35:56,832 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-13 13:35:56,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387878248] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:56,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:56,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:35:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424740751] [2022-12-13 13:35:56,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:35:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:35:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:35:56,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 13:35:56,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 396 transitions, 10747 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-13 13:35:56,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:56,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 13:35:56,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:58,434 INFO L130 PetriNetUnfolder]: 2319/4420 cut-off events. [2022-12-13 13:35:58,434 INFO L131 PetriNetUnfolder]: For 138658/138696 co-relation queries the response was YES. [2022-12-13 13:35:58,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45317 conditions, 4420 events. 2319/4420 cut-off events. For 138658/138696 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 31905 event pairs, 436 based on Foata normal form. 46/4434 useless extension candidates. Maximal degree in co-relation 44757. Up to 4003 conditions per place. [2022-12-13 13:35:58,476 INFO L137 encePairwiseOnDemand]: 14/45 looper letters, 349 selfloop transitions, 108 changer transitions 4/462 dead transitions. [2022-12-13 13:35:58,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 462 transitions, 12541 flow [2022-12-13 13:35:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:35:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:35:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2022-12-13 13:35:58,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18194444444444444 [2022-12-13 13:35:58,477 INFO L175 Difference]: Start difference. First operand has 209 places, 396 transitions, 10747 flow. Second operand 16 states and 131 transitions. [2022-12-13 13:35:58,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 462 transitions, 12541 flow [2022-12-13 13:35:59,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 462 transitions, 11039 flow, removed 378 selfloop flow, removed 14 redundant places. [2022-12-13 13:35:59,211 INFO L231 Difference]: Finished difference. Result has 218 places, 422 transitions, 10279 flow [2022-12-13 13:35:59,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=9289, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10279, PETRI_PLACES=218, PETRI_TRANSITIONS=422} [2022-12-13 13:35:59,211 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 197 predicate places. [2022-12-13 13:35:59,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:59,211 INFO L89 Accepts]: Start accepts. Operand has 218 places, 422 transitions, 10279 flow [2022-12-13 13:35:59,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:59,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:59,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 422 transitions, 10279 flow [2022-12-13 13:35:59,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 422 transitions, 10279 flow [2022-12-13 13:35:59,471 INFO L130 PetriNetUnfolder]: 577/1768 cut-off events. [2022-12-13 13:35:59,471 INFO L131 PetriNetUnfolder]: For 35628/35682 co-relation queries the response was YES. [2022-12-13 13:35:59,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14731 conditions, 1768 events. 577/1768 cut-off events. For 35628/35682 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15551 event pairs, 3 based on Foata normal form. 24/1751 useless extension candidates. Maximal degree in co-relation 14517. Up to 650 conditions per place. [2022-12-13 13:35:59,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 422 transitions, 10279 flow [2022-12-13 13:35:59,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-13 13:35:59,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:59,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 288 [2022-12-13 13:35:59,499 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 422 transitions, 10279 flow [2022-12-13 13:35:59,499 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-13 13:35:59,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:59,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:59,504 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-13 13:35:59,699 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,SelfDestructingSolverStorable89 [2022-12-13 13:35:59,700 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-13 13:35:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -84544148, now seen corresponding path program 1 times [2022-12-13 13:35:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:59,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947452384] [2022-12-13 13:35:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:00,800 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-13 13:36:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947452384] [2022-12-13 13:36:00,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947452384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743633731] [2022-12-13 13:36:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:00,802 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-13 13:36:00,802 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-13 13:36:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:00,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 13:36:00,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:01,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:01,097 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-13 13:36:01,135 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-13 13:36:01,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:01,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:01,253 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-13 13:36:01,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-13 13:36:01,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743633731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:01,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:01,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:36:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654578137] [2022-12-13 13:36:01,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:01,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:36:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:36:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:36:01,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 13:36:01,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 422 transitions, 10279 flow. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 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-13 13:36:01,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:01,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 13:36:01,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:03,369 INFO L130 PetriNetUnfolder]: 2471/4798 cut-off events. [2022-12-13 13:36:03,369 INFO L131 PetriNetUnfolder]: For 126040/126075 co-relation queries the response was YES. [2022-12-13 13:36:03,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44314 conditions, 4798 events. 2471/4798 cut-off events. For 126040/126075 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 35891 event pairs, 456 based on Foata normal form. 17/4747 useless extension candidates. Maximal degree in co-relation 43681. Up to 3307 conditions per place. [2022-12-13 13:36:03,421 INFO L137 encePairwiseOnDemand]: 17/45 looper letters, 340 selfloop transitions, 232 changer transitions 22/595 dead transitions. [2022-12-13 13:36:03,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 595 transitions, 14737 flow [2022-12-13 13:36:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:36:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 13:36:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 159 transitions. [2022-12-13 13:36:03,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16825396825396827 [2022-12-13 13:36:03,422 INFO L175 Difference]: Start difference. First operand has 218 places, 422 transitions, 10279 flow. Second operand 21 states and 159 transitions. [2022-12-13 13:36:03,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 595 transitions, 14737 flow [2022-12-13 13:36:03,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 595 transitions, 14442 flow, removed 106 selfloop flow, removed 7 redundant places. [2022-12-13 13:36:03,936 INFO L231 Difference]: Finished difference. Result has 237 places, 530 transitions, 13624 flow [2022-12-13 13:36:03,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=10000, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13624, PETRI_PLACES=237, PETRI_TRANSITIONS=530} [2022-12-13 13:36:03,936 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 216 predicate places. [2022-12-13 13:36:03,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:03,936 INFO L89 Accepts]: Start accepts. Operand has 237 places, 530 transitions, 13624 flow [2022-12-13 13:36:03,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:03,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:03,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 530 transitions, 13624 flow [2022-12-13 13:36:03,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 530 transitions, 13624 flow [2022-12-13 13:36:04,241 INFO L130 PetriNetUnfolder]: 588/1935 cut-off events. [2022-12-13 13:36:04,241 INFO L131 PetriNetUnfolder]: For 44773/44903 co-relation queries the response was YES. [2022-12-13 13:36:04,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16737 conditions, 1935 events. 588/1935 cut-off events. For 44773/44903 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18004 event pairs, 1 based on Foata normal form. 42/1975 useless extension candidates. Maximal degree in co-relation 16484. Up to 660 conditions per place. [2022-12-13 13:36:04,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 530 transitions, 13624 flow [2022-12-13 13:36:04,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 1768 [2022-12-13 13:36:04,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_727| v_~q~0.base_497))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_523| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1028 4) v_~q~0.offset_496)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_523|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| (ite (and (< v_~q_front~0_898 v_~q_back~0_1028) (< v_~q_front~0_898 v_~n~0_493) (<= 0 v_~q_front~0_898)) 1 0)) (= v_~q_back~0_1027 (+ v_~q_back~0_1028 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|) (not (= (ite (and (<= 0 v_~q_back~0_1028) (< v_~q_back~0_1028 v_~n~0_493)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_540| 1) |v_thread1Thread1of1ForFork0_~i~0#1_539|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_546| 0)) (= (+ v_~s~0_853 |v_thread2Thread1of1ForFork1_~j~0#1_546|) v_~s~0_852) (< |v_thread1Thread1of1ForFork0_~i~0#1_540| v_~N~0_389) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523| 0)) (= (select .cse0 (+ v_~q~0.offset_496 (* 4 v_~q_front~0_898))) |v_thread2Thread1of1ForFork1_~j~0#1_546|) (= (+ 1 v_~q_front~0_898) v_~q_front~0_897))) InVars {~q_back~0=v_~q_back~0_1028, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_540|, #memory_int=|v_#memory_int_727|, ~N~0=v_~N~0_389, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_493, ~q~0.offset=v_~q~0.offset_496, ~s~0=v_~s~0_853, ~q_front~0=v_~q_front~0_898} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_546|, ~q_back~0=v_~q_back~0_1027, 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_363|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_498|, ~N~0=v_~N~0_389, ~q~0.base=v_~q~0.base_497, ~q~0.offset=v_~q~0.offset_496, 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_523|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_367|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_363|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_539|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523|, #memory_int=|v_#memory_int_727|, ~n~0=v_~n~0_493, ~s~0=v_~s~0_852, ~q_front~0=v_~q_front~0_897} 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-13 13:36:04,270 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,270 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,270 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,270 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,270 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,270 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,489 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,489 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,489 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,489 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,489 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,489 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_743 4)) (.cse2 (+ v_~q_back~0_743 1)) (.cse0 (select |v_#memory_int_534| v_~q~0.base_370))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_371| (+ v_~N~0_289 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= (+ 1 v_~q_front~0_579) v_~q_front~0_578) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_375)) 1 0))) (= (ite (and (<= 0 v_~q_front~0_579) (< v_~q_front~0_579 v_~n~0_375) (< v_~q_front~0_579 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|) (= |v_thread1Thread1of1ForFork0_~i~0#1_371| 2) (= (+ v_~s~0_519 |v_thread2Thread1of1ForFork1_~j~0#1_324|) v_~s~0_518) (= (select .cse0 (+ (* 4 v_~q_front~0_579) v_~q~0.offset_369)) |v_thread2Thread1of1ForFork1_~j~0#1_324|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (= (+ 2 v_~q_back~0_743) v_~q_back~0_741) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_324| 0)))) InVars {~q_back~0=v_~q_back~0_743, #memory_int=|v_#memory_int_534|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~n~0=v_~n~0_375, ~q~0.offset=v_~q~0.offset_369, ~s~0=v_~s~0_519, ~q_front~0=v_~q_front~0_579} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_324|, ~q_back~0=v_~q_back~0_741, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_244|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_293|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~q~0.offset=v_~q~0.offset_369, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_293|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_248|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_244|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|, #memory_int=|v_#memory_int_534|, ~n~0=v_~n~0_375, ~s~0=v_~s~0_518, ~q_front~0=v_~q_front~0_578} 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 [771] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_727| v_~q~0.base_497))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_523| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1028 4) v_~q~0.offset_496)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_523|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| (ite (and (< v_~q_front~0_898 v_~q_back~0_1028) (< v_~q_front~0_898 v_~n~0_493) (<= 0 v_~q_front~0_898)) 1 0)) (= v_~q_back~0_1027 (+ v_~q_back~0_1028 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|) (not (= (ite (and (<= 0 v_~q_back~0_1028) (< v_~q_back~0_1028 v_~n~0_493)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_540| 1) |v_thread1Thread1of1ForFork0_~i~0#1_539|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_546| 0)) (= (+ v_~s~0_853 |v_thread2Thread1of1ForFork1_~j~0#1_546|) v_~s~0_852) (< |v_thread1Thread1of1ForFork0_~i~0#1_540| v_~N~0_389) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523| 0)) (= (select .cse0 (+ v_~q~0.offset_496 (* 4 v_~q_front~0_898))) |v_thread2Thread1of1ForFork1_~j~0#1_546|) (= (+ 1 v_~q_front~0_898) v_~q_front~0_897))) InVars {~q_back~0=v_~q_back~0_1028, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_540|, #memory_int=|v_#memory_int_727|, ~N~0=v_~N~0_389, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_493, ~q~0.offset=v_~q~0.offset_496, ~s~0=v_~s~0_853, ~q_front~0=v_~q_front~0_898} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_546|, ~q_back~0=v_~q_back~0_1027, 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_363|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_498|, ~N~0=v_~N~0_389, ~q~0.base=v_~q~0.base_497, ~q~0.offset=v_~q~0.offset_496, 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_523|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_367|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_363|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_539|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523|, #memory_int=|v_#memory_int_727|, ~n~0=v_~n~0_493, ~s~0=v_~s~0_852, ~q_front~0=v_~q_front~0_897} 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] [2022-12-13 13:36:04,714 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,714 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,714 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:04,714 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,075 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,075 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,076 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,076 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,357 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-13 13:36:05,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_794| v_~q~0.base_555))) (let ((.cse2 (+ v_~n~0_551 1)) (.cse3 (select .cse0 (+ (* v_~q_front~0_1060 4) v_~q~0.offset_554))) (.cse1 (* v_~q_back~0_1183 4))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_638| 3) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_554 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_653| 0)) (not (= (ite (and (<= 1 v_~q_back~0_1181) (< v_~q_back~0_1181 .cse2)) 1 0) 0)) (= (+ 3 v_~q_back~0_1183) v_~q_back~0_1181) (not (= .cse3 0)) (= (select .cse0 (+ (- 4) v_~q~0.offset_554 (* v_~q_front~0_1058 4))) |v_thread2Thread1of1ForFork1_~j~0#1_653|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_599| (ite (and (<= 1 v_~q_front~0_1058) (< v_~q_front~0_1058 v_~q_back~0_1181) (< v_~q_front~0_1058 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_599| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_599|) (not (= (ite (and (< v_~q_front~0_1060 v_~n~0_551) (<= 0 v_~q_front~0_1060) (< v_~q_front~0_1060 (+ v_~q_back~0_1183 1))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_638| (+ v_~N~0_437 1)) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_554 (* v_~q_back~0_1181 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_617|) (= (+ .cse3 v_~s~0_1019 |v_thread2Thread1of1ForFork1_~j~0#1_653|) v_~s~0_1017) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_554)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_617| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_617|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_617| 0)) (= v_~q_front~0_1058 (+ v_~q_front~0_1060 2))))) InVars {~q_back~0=v_~q_back~0_1183, #memory_int=|v_#memory_int_794|, ~N~0=v_~N~0_437, ~q~0.base=v_~q~0.base_555, ~n~0=v_~n~0_551, ~q~0.offset=v_~q~0.offset_554, ~s~0=v_~s~0_1019, ~q_front~0=v_~q_front~0_1060} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_653|, ~q_back~0=v_~q_back~0_1181, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_599|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_437|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_599|, ~N~0=v_~N~0_437, ~q~0.base=v_~q~0.base_555, ~q~0.offset=v_~q~0.offset_554, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_599|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_599|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_617|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_441|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_437|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_638|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_617|, #memory_int=|v_#memory_int_794|, ~n~0=v_~n~0_551, ~s~0=v_~s~0_1017, ~q_front~0=v_~q_front~0_1058} 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-13 13:36:05,454 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,454 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,454 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,454 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,455 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,455 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,855 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,855 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,855 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,855 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,855 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:05,855 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:06,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_743 4)) (.cse2 (+ v_~q_back~0_743 1)) (.cse0 (select |v_#memory_int_534| v_~q~0.base_370))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_371| (+ v_~N~0_289 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= (+ 1 v_~q_front~0_579) v_~q_front~0_578) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_375)) 1 0))) (= (ite (and (<= 0 v_~q_front~0_579) (< v_~q_front~0_579 v_~n~0_375) (< v_~q_front~0_579 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|) (= |v_thread1Thread1of1ForFork0_~i~0#1_371| 2) (= (+ v_~s~0_519 |v_thread2Thread1of1ForFork1_~j~0#1_324|) v_~s~0_518) (= (select .cse0 (+ (* 4 v_~q_front~0_579) v_~q~0.offset_369)) |v_thread2Thread1of1ForFork1_~j~0#1_324|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (= (+ 2 v_~q_back~0_743) v_~q_back~0_741) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_324| 0)))) InVars {~q_back~0=v_~q_back~0_743, #memory_int=|v_#memory_int_534|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~n~0=v_~n~0_375, ~q~0.offset=v_~q~0.offset_369, ~s~0=v_~s~0_519, ~q_front~0=v_~q_front~0_579} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_324|, ~q_back~0=v_~q_back~0_741, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_244|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_293|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~q~0.offset=v_~q~0.offset_369, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_293|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_248|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_244|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|, #memory_int=|v_#memory_int_534|, ~n~0=v_~n~0_375, ~s~0=v_~s~0_518, ~q_front~0=v_~q_front~0_578} 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 [814] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_790| v_~q~0.base_551)) (.cse3 (* v_~q_front~0_1050 4))) (let ((.cse2 (select .cse1 (+ .cse3 v_~q~0.offset_550)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_593| (ite (let ((.cse0 (+ v_~q_front~0_1050 1))) (and (< .cse0 v_~n~0_547) (< .cse0 v_~q_back~0_1171) (<= 0 .cse0))) 1 0)) (= v_~q_front~0_1048 (+ v_~q_front~0_1050 2)) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1172 4) v_~q~0.offset_550)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_611|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_611| 0)) (not (= (ite (and (< v_~q_back~0_1172 v_~n~0_547) (<= 0 v_~q_back~0_1172)) 1 0) 0)) (= (+ v_~q_back~0_1172 1) v_~q_back~0_1171) (not (= (ite (and (< v_~q_front~0_1050 v_~q_back~0_1172) (<= 0 v_~q_front~0_1050) (< v_~q_front~0_1050 v_~n~0_547)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_647| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_611| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_611|) (= (+ .cse2 v_~s~0_1009 |v_thread2Thread1of1ForFork1_~j~0#1_647|) v_~s~0_1007) (= (select .cse1 (+ .cse3 v_~q~0.offset_550 4)) |v_thread2Thread1of1ForFork1_~j~0#1_647|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_629| 1) |v_thread1Thread1of1ForFork0_~i~0#1_628|) (< |v_thread1Thread1of1ForFork0_~i~0#1_629| v_~N~0_433) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_593| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_593|) (not (= .cse2 0))))) InVars {~q_back~0=v_~q_back~0_1172, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_629|, #memory_int=|v_#memory_int_790|, ~N~0=v_~N~0_433, ~q~0.base=v_~q~0.base_551, ~n~0=v_~n~0_547, ~q~0.offset=v_~q~0.offset_550, ~s~0=v_~s~0_1009, ~q_front~0=v_~q_front~0_1050} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_647|, ~q_back~0=v_~q_back~0_1171, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_593|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_593|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_431|, ~N~0=v_~N~0_433, ~q~0.base=v_~q~0.base_551, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_593|, ~q~0.offset=v_~q~0.offset_550, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_593|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_611|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_435|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_431|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_628|, #memory_int=|v_#memory_int_790|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_611|, ~n~0=v_~n~0_547, ~s~0=v_~s~0_1007, ~q_front~0=v_~q_front~0_1048} 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] [2022-12-13 13:36:06,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_743 4)) (.cse2 (+ v_~q_back~0_743 1)) (.cse0 (select |v_#memory_int_534| v_~q~0.base_370))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_371| (+ v_~N~0_289 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= (+ 1 v_~q_front~0_579) v_~q_front~0_578) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_375)) 1 0))) (= (ite (and (<= 0 v_~q_front~0_579) (< v_~q_front~0_579 v_~n~0_375) (< v_~q_front~0_579 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|) (= |v_thread1Thread1of1ForFork0_~i~0#1_371| 2) (= (+ v_~s~0_519 |v_thread2Thread1of1ForFork1_~j~0#1_324|) v_~s~0_518) (= (select .cse0 (+ (* 4 v_~q_front~0_579) v_~q~0.offset_369)) |v_thread2Thread1of1ForFork1_~j~0#1_324|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (= (+ 2 v_~q_back~0_743) v_~q_back~0_741) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_324| 0)))) InVars {~q_back~0=v_~q_back~0_743, #memory_int=|v_#memory_int_534|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~n~0=v_~n~0_375, ~q~0.offset=v_~q~0.offset_369, ~s~0=v_~s~0_519, ~q_front~0=v_~q_front~0_579} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_324|, ~q_back~0=v_~q_back~0_741, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_244|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_293|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~q~0.offset=v_~q~0.offset_369, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_293|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_248|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_244|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|, #memory_int=|v_#memory_int_534|, ~n~0=v_~n~0_375, ~s~0=v_~s~0_518, ~q_front~0=v_~q_front~0_578} 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 [816] L65-2-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_792| v_~q~0.base_553)) (.cse2 (* v_~q_back~0_1177 4))) (and (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_634| 1) v_~N~0_435) (= (+ v_~s~0_1014 |v_thread2Thread1of1ForFork1_~j~0#1_651|) v_~s~0_1013) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_597| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_597|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_651| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_597| (ite (and (< v_~q_front~0_1055 v_~n~0_549) (<= 0 v_~q_front~0_1055) (< v_~q_front~0_1055 v_~q_back~0_1177)) 1 0)) (not (= (ite (let ((.cse0 (+ v_~q_back~0_1177 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_549))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_613| (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_552 4)) 1) 1 0)) (= (select .cse1 (+ (* v_~q_front~0_1055 4) v_~q~0.offset_552)) |v_thread2Thread1of1ForFork1_~j~0#1_651|) (= (+ 2 v_~q_back~0_1177) v_~q_back~0_1175) (= |v_thread1Thread1of1ForFork0_~i~0#1_632| (+ |v_thread1Thread1of1ForFork0_~i~0#1_634| 2)) (not (= (ite (= 1 (select .cse1 (+ .cse2 v_~q~0.offset_552))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_597| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_613| 0)) (= v_~q_front~0_1054 (+ v_~q_front~0_1055 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_613| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_613|))) InVars {~q_back~0=v_~q_back~0_1177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_634|, #memory_int=|v_#memory_int_792|, ~N~0=v_~N~0_435, ~q~0.base=v_~q~0.base_553, ~n~0=v_~n~0_549, ~q~0.offset=v_~q~0.offset_552, ~s~0=v_~s~0_1014, ~q_front~0=v_~q_front~0_1055} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_651|, ~q_back~0=v_~q_back~0_1175, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_597|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_433|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_597|, ~N~0=v_~N~0_435, ~q~0.base=v_~q~0.base_553, ~q~0.offset=v_~q~0.offset_552, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_597|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_597|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_613|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_437|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_433|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_632|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_613|, #memory_int=|v_#memory_int_792|, ~n~0=v_~n~0_549, ~s~0=v_~s~0_1013, ~q_front~0=v_~q_front~0_1054} 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] [2022-12-13 13:36:06,753 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:06,753 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:06,754 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:06,754 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,193 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,193 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,194 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,194 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_743 4)) (.cse2 (+ v_~q_back~0_743 1)) (.cse0 (select |v_#memory_int_534| v_~q~0.base_370))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_371| (+ v_~N~0_289 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_369 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (= (+ 1 v_~q_front~0_579) v_~q_front~0_578) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_375)) 1 0))) (= (ite (and (<= 0 v_~q_front~0_579) (< v_~q_front~0_579 v_~n~0_375) (< v_~q_front~0_579 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|) (= |v_thread1Thread1of1ForFork0_~i~0#1_371| 2) (= (+ v_~s~0_519 |v_thread2Thread1of1ForFork1_~j~0#1_324|) v_~s~0_518) (= (select .cse0 (+ (* 4 v_~q_front~0_579) v_~q~0.offset_369)) |v_thread2Thread1of1ForFork1_~j~0#1_324|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (= (+ 2 v_~q_back~0_743) v_~q_back~0_741) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_324| 0)))) InVars {~q_back~0=v_~q_back~0_743, #memory_int=|v_#memory_int_534|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~n~0=v_~n~0_375, ~q~0.offset=v_~q~0.offset_369, ~s~0=v_~s~0_519, ~q_front~0=v_~q_front~0_579} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_324|, ~q_back~0=v_~q_back~0_741, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_244|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_293|, ~N~0=v_~N~0_289, ~q~0.base=v_~q~0.base_370, ~q~0.offset=v_~q~0.offset_369, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_293|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_248|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_244|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_352|, #memory_int=|v_#memory_int_534|, ~n~0=v_~n~0_375, ~s~0=v_~s~0_518, ~q_front~0=v_~q_front~0_578} 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 [771] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_727| v_~q~0.base_497))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_523| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1028 4) v_~q~0.offset_496)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_523|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| (ite (and (< v_~q_front~0_898 v_~q_back~0_1028) (< v_~q_front~0_898 v_~n~0_493) (<= 0 v_~q_front~0_898)) 1 0)) (= v_~q_back~0_1027 (+ v_~q_back~0_1028 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|) (not (= (ite (and (<= 0 v_~q_back~0_1028) (< v_~q_back~0_1028 v_~n~0_493)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_540| 1) |v_thread1Thread1of1ForFork0_~i~0#1_539|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_546| 0)) (= (+ v_~s~0_853 |v_thread2Thread1of1ForFork1_~j~0#1_546|) v_~s~0_852) (< |v_thread1Thread1of1ForFork0_~i~0#1_540| v_~N~0_389) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523| 0)) (= (select .cse0 (+ v_~q~0.offset_496 (* 4 v_~q_front~0_898))) |v_thread2Thread1of1ForFork1_~j~0#1_546|) (= (+ 1 v_~q_front~0_898) v_~q_front~0_897))) InVars {~q_back~0=v_~q_back~0_1028, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_540|, #memory_int=|v_#memory_int_727|, ~N~0=v_~N~0_389, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_493, ~q~0.offset=v_~q~0.offset_496, ~s~0=v_~s~0_853, ~q_front~0=v_~q_front~0_898} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_546|, ~q_back~0=v_~q_back~0_1027, 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_363|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_498|, ~N~0=v_~N~0_389, ~q~0.base=v_~q~0.base_497, ~q~0.offset=v_~q~0.offset_496, 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_523|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_367|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_363|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_539|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_523|, #memory_int=|v_#memory_int_727|, ~n~0=v_~n~0_493, ~s~0=v_~s~0_852, ~q_front~0=v_~q_front~0_897} 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] [2022-12-13 13:36:07,450 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,451 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,451 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,451 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,857 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,857 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,857 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,857 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,857 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:07,857 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_502| v_~q~0.base_346))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_268| 0)) (= v_~q_back~0_667 (+ v_~q_back~0_668 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_320| v_~N~0_265) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|) (= (+ v_~s~0_443 |v_thread2Thread1of1ForFork1_~j~0#1_268|) v_~s~0_442) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_302| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_302|) (= (ite (= (select .cse0 (+ v_~q~0.offset_345 (* v_~q_back~0_668 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_302|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| (ite (and (< v_~q_front~0_508 v_~q_back~0_667) (<= 0 v_~q_front~0_508) (< v_~q_front~0_508 v_~n~0_351)) 1 0)) (= (+ 1 v_~q_front~0_508) v_~q_front~0_507) (not (= (ite (and (<= 0 v_~q_back~0_668) (< v_~q_back~0_668 v_~n~0_351)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_302| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_319| (+ |v_thread1Thread1of1ForFork0_~i~0#1_320| 1)) (= (select .cse0 (+ (* 4 v_~q_front~0_508) v_~q~0.offset_345)) |v_thread2Thread1of1ForFork1_~j~0#1_268|))) InVars {~q_back~0=v_~q_back~0_668, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_320|, #memory_int=|v_#memory_int_502|, ~N~0=v_~N~0_265, ~q~0.base=v_~q~0.base_346, ~n~0=v_~n~0_351, ~q~0.offset=v_~q~0.offset_345, ~s~0=v_~s~0_443, ~q_front~0=v_~q_front~0_508} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_268|, ~q_back~0=v_~q_back~0_667, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_243|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_204|, ~N~0=v_~N~0_265, ~q~0.base=v_~q~0.base_346, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_243|, ~q~0.offset=v_~q~0.offset_345, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_302|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_208|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_204|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_319|, #memory_int=|v_#memory_int_502|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_302|, ~n~0=v_~n~0_351, ~s~0=v_~s~0_442, ~q_front~0=v_~q_front~0_507} 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-13 13:36:08,181 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,181 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,181 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,181 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,181 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,181 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:08,402 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-13 13:36:08,493 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-13 13:36:08,601 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-13 13:36:08,696 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 13:36:08,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4761 [2022-12-13 13:36:08,697 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 528 transitions, 13920 flow [2022-12-13 13:36:08,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 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-13 13:36:08,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:08,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:08,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-13 13:36:08,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:08,898 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-13 13:36:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash 950058531, now seen corresponding path program 1 times [2022-12-13 13:36:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:08,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822066823] [2022-12-13 13:36:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:10,249 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-13 13:36:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:10,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822066823] [2022-12-13 13:36:10,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822066823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:10,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509681339] [2022-12-13 13:36:10,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:10,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:10,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:10,251 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-13 13:36:10,252 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-13 13:36:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:10,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 13:36:10,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:10,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:10,502 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-13 13:36:10,532 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-13 13:36:10,572 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-13 13:36:10,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:10,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:10,643 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-13 13:36:10,646 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-13 13:36:10,648 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-13 13:36:10,710 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-13 13:36:10,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509681339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:10,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2022-12-13 13:36:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95871905] [2022-12-13 13:36:10,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:10,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:36:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:36:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:36:10,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-13 13:36:10,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 528 transitions, 13920 flow. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:10,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:10,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-13 13:36:10,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:12,529 INFO L130 PetriNetUnfolder]: 2457/4801 cut-off events. [2022-12-13 13:36:12,529 INFO L131 PetriNetUnfolder]: For 147326/147417 co-relation queries the response was YES. [2022-12-13 13:36:12,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47099 conditions, 4801 events. 2457/4801 cut-off events. For 147326/147417 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 36233 event pairs, 687 based on Foata normal form. 38/4839 useless extension candidates. Maximal degree in co-relation 46327. Up to 4582 conditions per place. [2022-12-13 13:36:12,580 INFO L137 encePairwiseOnDemand]: 15/57 looper letters, 489 selfloop transitions, 70 changer transitions 21/581 dead transitions. [2022-12-13 13:36:12,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 581 transitions, 15604 flow [2022-12-13 13:36:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:36:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:36:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-12-13 13:36:12,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14963880288957687 [2022-12-13 13:36:12,582 INFO L175 Difference]: Start difference. First operand has 231 places, 528 transitions, 13920 flow. Second operand 17 states and 145 transitions. [2022-12-13 13:36:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 581 transitions, 15604 flow [2022-12-13 13:36:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 581 transitions, 15203 flow, removed 175 selfloop flow, removed 7 redundant places. [2022-12-13 13:36:13,239 INFO L231 Difference]: Finished difference. Result has 246 places, 533 transitions, 13796 flow [2022-12-13 13:36:13,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=13523, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=13796, PETRI_PLACES=246, PETRI_TRANSITIONS=533} [2022-12-13 13:36:13,240 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 225 predicate places. [2022-12-13 13:36:13,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:13,240 INFO L89 Accepts]: Start accepts. Operand has 246 places, 533 transitions, 13796 flow [2022-12-13 13:36:13,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:13,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:13,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 533 transitions, 13796 flow [2022-12-13 13:36:13,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 533 transitions, 13796 flow [2022-12-13 13:36:13,552 INFO L130 PetriNetUnfolder]: 592/1945 cut-off events. [2022-12-13 13:36:13,553 INFO L131 PetriNetUnfolder]: For 47023/47162 co-relation queries the response was YES. [2022-12-13 13:36:13,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16939 conditions, 1945 events. 592/1945 cut-off events. For 47023/47162 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18050 event pairs, 1 based on Foata normal form. 48/1992 useless extension candidates. Maximal degree in co-relation 16677. Up to 667 conditions per place. [2022-12-13 13:36:13,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 533 transitions, 13796 flow [2022-12-13 13:36:13,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 1770 [2022-12-13 13:36:13,712 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-13 13:36:13,810 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-13 13:36:13,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_676| v_~q~0.base_461))) (and (= (+ v_~q_back~0_947 1) v_~q_back~0_946) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_479| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_801) v_~q~0.offset_460)) |v_thread2Thread1of1ForFork1_~j~0#1_474|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431| (ite (and (< v_~q_front~0_801 v_~q_back~0_947) (< v_~q_front~0_801 v_~n~0_457) (<= 0 v_~q_front~0_801)) 1 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_947 4) v_~q~0.offset_460)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_479|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|) (= v_~q_front~0_800 (+ 1 v_~q_front~0_801)) (= |v_thread1Thread1of1ForFork0_~i~0#1_497| (+ |v_thread1Thread1of1ForFork0_~i~0#1_498| 1)) (= (+ v_~s~0_749 |v_thread2Thread1of1ForFork1_~j~0#1_474|) v_~s~0_748) (not (= (ite (and (< v_~q_back~0_947 v_~n~0_457) (<= 0 v_~q_back~0_947)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_498| v_~N~0_365) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_479| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_479|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_474| 0)))) InVars {~q_back~0=v_~q_back~0_947, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_498|, #memory_int=|v_#memory_int_676|, ~N~0=v_~N~0_365, ~q~0.base=v_~q~0.base_461, ~n~0=v_~n~0_457, ~q~0.offset=v_~q~0.offset_460, ~s~0=v_~s~0_749, ~q_front~0=v_~q_front~0_801} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_474|, ~q_back~0=v_~q_back~0_946, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_340|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_431|, ~N~0=v_~N~0_365, ~q~0.base=v_~q~0.base_461, ~q~0.offset=v_~q~0.offset_460, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_431|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_431|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_479|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_344|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_340|, 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_479|, #memory_int=|v_#memory_int_676|, ~n~0=v_~n~0_457, ~s~0=v_~s~0_748, ~q_front~0=v_~q_front~0_800} 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 [839] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_820| v_~q~0.base_581))) (and (= (ite (= (select .cse0 (+ v_~q~0.offset_580 (* v_~q_back~0_1252 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_661|) (not (= (ite (and (<= 0 v_~q_back~0_1252) (< v_~q_back~0_1252 v_~n~0_577)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_637| (ite (and (< v_~q_front~0_1123 v_~q_back~0_1252) (< v_~q_front~0_1123 v_~n~0_577) (<= 0 v_~q_front~0_1123)) 1 0)) (= (select .cse0 (+ (* v_~q_front~0_1123 4) v_~q~0.offset_580)) |v_thread2Thread1of1ForFork1_~j~0#1_691|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_661| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_661|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_637| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_691| 0)) (= v_~q_front~0_1122 (+ v_~q_front~0_1123 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_637| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_637|) (= (+ v_~s~0_1082 |v_thread2Thread1of1ForFork1_~j~0#1_691|) v_~s~0_1081) (< |v_thread1Thread1of1ForFork0_~i~0#1_693| v_~N~0_463) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_693| 1) |v_thread1Thread1of1ForFork0_~i~0#1_692|) (= (+ v_~q_back~0_1252 1) v_~q_back~0_1251) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_661| 0)))) InVars {~q_back~0=v_~q_back~0_1252, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_693|, #memory_int=|v_#memory_int_820|, ~N~0=v_~N~0_463, ~q~0.base=v_~q~0.base_581, ~n~0=v_~n~0_577, ~q~0.offset=v_~q~0.offset_580, ~s~0=v_~s~0_1082, ~q_front~0=v_~q_front~0_1123} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_691|, ~q_back~0=v_~q_back~0_1251, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_637|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_481|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_637|, ~N~0=v_~N~0_463, ~q~0.base=v_~q~0.base_581, ~q~0.offset=v_~q~0.offset_580, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_637|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_637|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_661|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_485|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_481|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_692|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_661|, #memory_int=|v_#memory_int_820|, ~n~0=v_~n~0_577, ~s~0=v_~s~0_1081, ~q_front~0=v_~q_front~0_1122} 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] [2022-12-13 13:36:13,924 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:13,924 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:13,924 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:13,924 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:13,924 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:13,924 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,234 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,235 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,235 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,235 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,235 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,235 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:14,453 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:36:14,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1213 [2022-12-13 13:36:14,453 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 531 transitions, 13820 flow [2022-12-13 13:36:14,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:14,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:14,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:14,460 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-13 13:36:14,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:14,654 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-13 13:36:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash 382725774, now seen corresponding path program 1 times [2022-12-13 13:36:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:14,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22570752] [2022-12-13 13:36:14,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:14,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:15,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-13 13:36:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22570752] [2022-12-13 13:36:15,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22570752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151532088] [2022-12-13 13:36:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:15,701 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-13 13:36:15,701 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-13 13:36:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:15,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:36:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:15,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:15,991 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-13 13:36:16,010 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-13 13:36:16,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:16,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:16,092 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-13 13:36:16,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-13 13:36:16,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151532088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:16,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:16,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-13 13:36:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487590814] [2022-12-13 13:36:16,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:16,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:36:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:36:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:36:16,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 60 [2022-12-13 13:36:16,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 531 transitions, 13820 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-13 13:36:16,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:16,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 60 [2022-12-13 13:36:16,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:17,725 INFO L130 PetriNetUnfolder]: 2440/4742 cut-off events. [2022-12-13 13:36:17,725 INFO L131 PetriNetUnfolder]: For 139513/139644 co-relation queries the response was YES. [2022-12-13 13:36:17,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46343 conditions, 4742 events. 2440/4742 cut-off events. For 139513/139644 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 35541 event pairs, 587 based on Foata normal form. 53/4795 useless extension candidates. Maximal degree in co-relation 45749. Up to 4603 conditions per place. [2022-12-13 13:36:17,777 INFO L137 encePairwiseOnDemand]: 25/60 looper letters, 482 selfloop transitions, 49 changer transitions 15/547 dead transitions. [2022-12-13 13:36:17,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 547 transitions, 14957 flow [2022-12-13 13:36:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:36:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:36:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-12-13 13:36:17,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17962962962962964 [2022-12-13 13:36:17,778 INFO L175 Difference]: Start difference. First operand has 237 places, 531 transitions, 13820 flow. Second operand 9 states and 97 transitions. [2022-12-13 13:36:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 547 transitions, 14957 flow [2022-12-13 13:36:18,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 547 transitions, 14738 flow, removed 41 selfloop flow, removed 11 redundant places. [2022-12-13 13:36:18,332 INFO L231 Difference]: Finished difference. Result has 231 places, 523 transitions, 13518 flow [2022-12-13 13:36:18,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=13585, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13518, PETRI_PLACES=231, PETRI_TRANSITIONS=523} [2022-12-13 13:36:18,332 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 210 predicate places. [2022-12-13 13:36:18,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:18,333 INFO L89 Accepts]: Start accepts. Operand has 231 places, 523 transitions, 13518 flow [2022-12-13 13:36:18,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:18,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:18,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 523 transitions, 13518 flow [2022-12-13 13:36:18,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 523 transitions, 13518 flow [2022-12-13 13:36:18,641 INFO L130 PetriNetUnfolder]: 592/1926 cut-off events. [2022-12-13 13:36:18,641 INFO L131 PetriNetUnfolder]: For 46112/46320 co-relation queries the response was YES. [2022-12-13 13:36:18,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16489 conditions, 1926 events. 592/1926 cut-off events. For 46112/46320 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 17821 event pairs, 1 based on Foata normal form. 65/1989 useless extension candidates. Maximal degree in co-relation 16249. Up to 658 conditions per place. [2022-12-13 13:36:18,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 523 transitions, 13518 flow [2022-12-13 13:36:18,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 1746 [2022-12-13 13:36:18,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [823] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_800| v_~q~0.base_561)) (.cse5 (* v_~q_front~0_1074 4))) (let ((.cse3 (* v_~q_back~0_1198 4)) (.cse0 (select .cse2 (+ .cse5 v_~q~0.offset_560 4))) (.cse1 (select .cse2 (+ .cse5 v_~q~0.offset_560)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_607| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_607|) (= (+ .cse0 v_~s~0_1033 .cse1 |v_thread2Thread1of1ForFork1_~j~0#1_661|) v_~s~0_1031) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_560)) 1) 1 0) 0)) (= (+ 3 v_~q_back~0_1198) v_~q_back~0_1197) (= |v_thread1Thread1of1ForFork0_~i~0#1_650| 3) (< |v_thread1Thread1of1ForFork0_~i~0#1_650| (+ v_~N~0_443 1)) (= (ite (= (select .cse2 (+ (* v_~q_back~0_1197 4) (- 4) v_~q~0.offset_560)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_627|) (not (= (ite (and (<= 0 v_~q_front~0_1074) (< v_~q_front~0_1074 (+ v_~q_back~0_1198 1)) (< v_~q_front~0_1074 v_~n~0_557)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_560 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_627| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_627|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_627| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_607| (ite (let ((.cse4 (+ v_~q_front~0_1074 2))) (and (< .cse4 v_~n~0_557) (< .cse4 v_~q_back~0_1197) (<= 0 .cse4))) 1 0)) (= (select .cse2 (+ .cse5 8 v_~q~0.offset_560)) |v_thread2Thread1of1ForFork1_~j~0#1_661|) (not (= .cse0 0)) (not (= (ite (and (< v_~q_back~0_1197 (+ v_~n~0_557 1)) (<= 1 v_~q_back~0_1197)) 1 0) 0)) (= v_~q_front~0_1072 (+ v_~q_front~0_1074 3)) (not (= .cse1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_661| 0))))) InVars {~q_back~0=v_~q_back~0_1198, #memory_int=|v_#memory_int_800|, ~N~0=v_~N~0_443, ~q~0.base=v_~q~0.base_561, ~n~0=v_~n~0_557, ~q~0.offset=v_~q~0.offset_560, ~s~0=v_~s~0_1033, ~q_front~0=v_~q_front~0_1074} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_661|, ~q_back~0=v_~q_back~0_1197, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_607|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_607|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_447|, ~N~0=v_~N~0_443, ~q~0.base=v_~q~0.base_561, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_607|, ~q~0.offset=v_~q~0.offset_560, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_607|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_627|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_451|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_447|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_650|, #memory_int=|v_#memory_int_800|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_627|, ~n~0=v_~n~0_557, ~s~0=v_~s~0_1031, ~q_front~0=v_~q_front~0_1072} 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-13 13:36:19,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_804| v_~q~0.base_565)) (.cse4 (* v_~q_front~0_1084 4))) (let ((.cse3 (* v_~q_back~0_1209 4)) (.cse2 (select .cse1 (+ v_~q~0.offset_564 4 .cse4))) (.cse5 (select .cse1 (+ v_~q~0.offset_564 .cse4)))) (and (= v_~q_front~0_1082 (+ v_~q_front~0_1084 3)) (= |v_thread1Thread1of1ForFork0_~i~0#1_656| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_613| (ite (let ((.cse0 (+ v_~q_front~0_1084 2))) (and (<= 0 .cse0) (< .cse0 v_~q_back~0_1207) (< .cse0 v_~n~0_561))) 1 0)) (= (ite (= (select .cse1 (+ (- 4) v_~q~0.offset_564 (* v_~q_back~0_1207 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633|) (not (= .cse2 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_633| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633|) (< 2 v_~N~0_447) (= (+ 3 v_~q_back~0_1209) v_~q_back~0_1207) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_564 .cse3)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_1084 (+ v_~q_back~0_1209 1)) (< v_~q_front~0_1084 v_~n~0_561) (<= 0 v_~q_front~0_1084)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1207 (+ v_~n~0_561 1)) (<= 1 v_~q_back~0_1207)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_667| 0)) (= (select .cse1 (+ 8 v_~q~0.offset_564 .cse4)) |v_thread2Thread1of1ForFork1_~j~0#1_667|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_613| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_613|) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_564 4 .cse3)) 1) 1 0) 0)) (= v_~s~0_1041 (+ .cse5 .cse2 v_~s~0_1043 |v_thread2Thread1of1ForFork1_~j~0#1_667|)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633| 0)) (not (= .cse5 0))))) InVars {~q_back~0=v_~q_back~0_1209, #memory_int=|v_#memory_int_804|, ~N~0=v_~N~0_447, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_561, ~q~0.offset=v_~q~0.offset_564, ~s~0=v_~s~0_1043, ~q_front~0=v_~q_front~0_1084} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_667|, ~q_back~0=v_~q_back~0_1207, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_613|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_613|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_453|, ~N~0=v_~N~0_447, ~q~0.base=v_~q~0.base_565, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_613|, ~q~0.offset=v_~q~0.offset_564, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_613|, 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_457|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_453|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_656|, #memory_int=|v_#memory_int_804|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_633|, ~n~0=v_~n~0_561, ~s~0=v_~s~0_1041, ~q_front~0=v_~q_front~0_1082} 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-13 13:36:19,101 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:19,101 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:19,102 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:19,102 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:19,102 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:19,102 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:19,540 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-13 13:36:19,641 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:36:19,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1310 [2022-12-13 13:36:19,642 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 520 transitions, 13480 flow [2022-12-13 13:36:19,642 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-13 13:36:19,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:19,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:19,648 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-13 13:36:19,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:19,843 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-13 13:36:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 953032209, now seen corresponding path program 1 times [2022-12-13 13:36:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:19,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630447911] [2022-12-13 13:36:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:20,332 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-13 13:36:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:20,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630447911] [2022-12-13 13:36:20,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630447911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:36:20,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:36:20,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:36:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070044929] [2022-12-13 13:36:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:36:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:36:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:36:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:36:20,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 58 [2022-12-13 13:36:20,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 520 transitions, 13480 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-13 13:36:20,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:20,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 58 [2022-12-13 13:36:20,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:21,674 INFO L130 PetriNetUnfolder]: 2550/4921 cut-off events. [2022-12-13 13:36:21,674 INFO L131 PetriNetUnfolder]: For 150226/150347 co-relation queries the response was YES. [2022-12-13 13:36:21,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47526 conditions, 4921 events. 2550/4921 cut-off events. For 150226/150347 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 36573 event pairs, 341 based on Foata normal form. 39/4960 useless extension candidates. Maximal degree in co-relation 46954. Up to 4078 conditions per place. [2022-12-13 13:36:21,726 INFO L137 encePairwiseOnDemand]: 21/58 looper letters, 433 selfloop transitions, 148 changer transitions 0/582 dead transitions. [2022-12-13 13:36:21,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 582 transitions, 15715 flow [2022-12-13 13:36:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:36:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:36:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 13:36:21,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296551724137931 [2022-12-13 13:36:21,727 INFO L175 Difference]: Start difference. First operand has 222 places, 520 transitions, 13480 flow. Second operand 5 states and 86 transitions. [2022-12-13 13:36:21,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 582 transitions, 15715 flow [2022-12-13 13:36:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 582 transitions, 15537 flow, removed 38 selfloop flow, removed 8 redundant places. [2022-12-13 13:36:22,331 INFO L231 Difference]: Finished difference. Result has 219 places, 544 transitions, 14386 flow [2022-12-13 13:36:22,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=13322, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14386, PETRI_PLACES=219, PETRI_TRANSITIONS=544} [2022-12-13 13:36:22,331 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 198 predicate places. [2022-12-13 13:36:22,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:22,331 INFO L89 Accepts]: Start accepts. Operand has 219 places, 544 transitions, 14386 flow [2022-12-13 13:36:22,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:22,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:22,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 544 transitions, 14386 flow [2022-12-13 13:36:22,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 544 transitions, 14386 flow [2022-12-13 13:36:22,654 INFO L130 PetriNetUnfolder]: 625/2023 cut-off events. [2022-12-13 13:36:22,654 INFO L131 PetriNetUnfolder]: For 50442/50638 co-relation queries the response was YES. [2022-12-13 13:36:22,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17271 conditions, 2023 events. 625/2023 cut-off events. For 50442/50638 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 18806 event pairs, 1 based on Foata normal form. 73/2095 useless extension candidates. Maximal degree in co-relation 17043. Up to 681 conditions per place. [2022-12-13 13:36:22,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 544 transitions, 14386 flow [2022-12-13 13:36:22,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 1832 [2022-12-13 13:36:22,683 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:36:22,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 353 [2022-12-13 13:36:22,684 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 544 transitions, 14386 flow [2022-12-13 13:36:22,684 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-13 13:36:22,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:22,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:22,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 13:36:22,684 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-13 13:36:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 721513519, now seen corresponding path program 1 times [2022-12-13 13:36:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:22,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346328394] [2022-12-13 13:36:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:23,658 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-13 13:36:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346328394] [2022-12-13 13:36:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346328394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141322417] [2022-12-13 13:36:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:23,660 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-13 13:36:23,660 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-13 13:36:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:23,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:36:23,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:23,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:23,998 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-13 13:36:24,016 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-13 13:36:24,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:24,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:24,140 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-13 13:36:24,243 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-13 13:36:24,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141322417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:24,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:24,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-13 13:36:24,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97056559] [2022-12-13 13:36:24,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:24,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:36:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:36:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:36:24,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 58 [2022-12-13 13:36:24,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 544 transitions, 14386 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-13 13:36:24,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:24,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 58 [2022-12-13 13:36:24,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:25,843 INFO L130 PetriNetUnfolder]: 2556/4934 cut-off events. [2022-12-13 13:36:25,843 INFO L131 PetriNetUnfolder]: For 151882/151922 co-relation queries the response was YES. [2022-12-13 13:36:25,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48273 conditions, 4934 events. 2556/4934 cut-off events. For 151882/151922 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 36903 event pairs, 931 based on Foata normal form. 21/4955 useless extension candidates. Maximal degree in co-relation 47713. Up to 4806 conditions per place. [2022-12-13 13:36:25,891 INFO L137 encePairwiseOnDemand]: 24/58 looper letters, 500 selfloop transitions, 52 changer transitions 11/564 dead transitions. [2022-12-13 13:36:25,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 564 transitions, 15659 flow [2022-12-13 13:36:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:36:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:36:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-13 13:36:25,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2025862068965517 [2022-12-13 13:36:25,892 INFO L175 Difference]: Start difference. First operand has 219 places, 544 transitions, 14386 flow. Second operand 8 states and 94 transitions. [2022-12-13 13:36:25,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 564 transitions, 15659 flow [2022-12-13 13:36:26,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 564 transitions, 15498 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 13:36:26,491 INFO L231 Difference]: Finished difference. Result has 225 places, 544 transitions, 14344 flow [2022-12-13 13:36:26,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=14225, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14344, PETRI_PLACES=225, PETRI_TRANSITIONS=544} [2022-12-13 13:36:26,491 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 204 predicate places. [2022-12-13 13:36:26,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:26,491 INFO L89 Accepts]: Start accepts. Operand has 225 places, 544 transitions, 14344 flow [2022-12-13 13:36:26,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:26,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:26,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 544 transitions, 14344 flow [2022-12-13 13:36:26,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 544 transitions, 14344 flow [2022-12-13 13:36:26,800 INFO L130 PetriNetUnfolder]: 626/2017 cut-off events. [2022-12-13 13:36:26,800 INFO L131 PetriNetUnfolder]: For 50195/50380 co-relation queries the response was YES. [2022-12-13 13:36:26,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17294 conditions, 2017 events. 626/2017 cut-off events. For 50195/50380 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 18704 event pairs, 1 based on Foata normal form. 61/2077 useless extension candidates. Maximal degree in co-relation 17059. Up to 685 conditions per place. [2022-12-13 13:36:26,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 544 transitions, 14344 flow [2022-12-13 13:36:26,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-13 13:36:26,828 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:36:26,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-13 13:36:26,828 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 544 transitions, 14344 flow [2022-12-13 13:36:26,828 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-13 13:36:26,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:26,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:26,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:27,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:27,029 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-13 13:36:27,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 848140664, now seen corresponding path program 1 times [2022-12-13 13:36:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:27,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163872935] [2022-12-13 13:36:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:27,955 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-13 13:36:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:27,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163872935] [2022-12-13 13:36:27,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163872935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:27,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819982926] [2022-12-13 13:36:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:27,957 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-13 13:36:27,957 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-13 13:36:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:28,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 13:36:28,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:28,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:28,192 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-13 13:36:28,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:28,282 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-13 13:36:28,306 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-13 13:36:28,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:28,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:28,443 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 222 treesize of output 264 [2022-12-13 13:36:28,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:28,468 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 140 treesize of output 166 [2022-12-13 13:36:29,197 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-13 13:36:29,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819982926] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:29,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:29,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:36:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382669520] [2022-12-13 13:36:29,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:29,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:36:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:29,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:36:29,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:36:29,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 58 [2022-12-13 13:36:29,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 544 transitions, 14344 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-13 13:36:29,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:29,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 58 [2022-12-13 13:36:29,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:31,075 INFO L130 PetriNetUnfolder]: 2573/4960 cut-off events. [2022-12-13 13:36:31,075 INFO L131 PetriNetUnfolder]: For 148930/148992 co-relation queries the response was YES. [2022-12-13 13:36:31,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48456 conditions, 4960 events. 2573/4960 cut-off events. For 148930/148992 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 37250 event pairs, 543 based on Foata normal form. 54/5014 useless extension candidates. Maximal degree in co-relation 47889. Up to 4815 conditions per place. [2022-12-13 13:36:31,123 INFO L137 encePairwiseOnDemand]: 18/58 looper letters, 499 selfloop transitions, 56 changer transitions 14/570 dead transitions. [2022-12-13 13:36:31,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 570 transitions, 15790 flow [2022-12-13 13:36:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:36:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:36:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 13:36:31,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18199233716475097 [2022-12-13 13:36:31,125 INFO L175 Difference]: Start difference. First operand has 223 places, 544 transitions, 14344 flow. Second operand 9 states and 95 transitions. [2022-12-13 13:36:31,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 570 transitions, 15790 flow [2022-12-13 13:36:31,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 570 transitions, 15681 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 13:36:31,818 INFO L231 Difference]: Finished difference. Result has 230 places, 548 transitions, 14471 flow [2022-12-13 13:36:31,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=14239, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14471, PETRI_PLACES=230, PETRI_TRANSITIONS=548} [2022-12-13 13:36:31,819 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 209 predicate places. [2022-12-13 13:36:31,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:31,819 INFO L89 Accepts]: Start accepts. Operand has 230 places, 548 transitions, 14471 flow [2022-12-13 13:36:31,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:31,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:31,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 548 transitions, 14471 flow [2022-12-13 13:36:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 548 transitions, 14471 flow [2022-12-13 13:36:32,136 INFO L130 PetriNetUnfolder]: 628/2021 cut-off events. [2022-12-13 13:36:32,136 INFO L131 PetriNetUnfolder]: For 50563/50746 co-relation queries the response was YES. [2022-12-13 13:36:32,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17367 conditions, 2021 events. 628/2021 cut-off events. For 50563/50746 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 18803 event pairs, 1 based on Foata normal form. 58/2078 useless extension candidates. Maximal degree in co-relation 17136. Up to 685 conditions per place. [2022-12-13 13:36:32,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 548 transitions, 14471 flow [2022-12-13 13:36:32,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 1836 [2022-12-13 13:36:37,742 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:37,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5924 [2022-12-13 13:36:37,743 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 548 transitions, 14501 flow [2022-12-13 13:36:37,743 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-13 13:36:37,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:37,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:37,748 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-13 13:36:37,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:37,944 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-13 13:36:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 853002239, now seen corresponding path program 2 times [2022-12-13 13:36:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:37,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832894838] [2022-12-13 13:36:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:38,922 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-13 13:36:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:38,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832894838] [2022-12-13 13:36:38,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832894838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:38,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333878834] [2022-12-13 13:36:38,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:36:38,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:38,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:38,924 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-13 13:36:38,925 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-13 13:36:39,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:36:39,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:36:39,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 13:36:39,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:39,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:39,288 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-13 13:36:39,324 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-13 13:36:39,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:39,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:39,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 153 treesize of output 255 [2022-12-13 13:36:39,510 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-13 13:36:39,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333878834] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:39,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:39,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-13 13:36:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841225090] [2022-12-13 13:36:39,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:39,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:36:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:36:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:36:39,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 58 [2022-12-13 13:36:39,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 548 transitions, 14501 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-13 13:36:39,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:39,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 58 [2022-12-13 13:36:39,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:41,070 INFO L130 PetriNetUnfolder]: 2556/4930 cut-off events. [2022-12-13 13:36:41,070 INFO L131 PetriNetUnfolder]: For 152349/152678 co-relation queries the response was YES. [2022-12-13 13:36:41,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48249 conditions, 4930 events. 2556/4930 cut-off events. For 152349/152678 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 36830 event pairs, 630 based on Foata normal form. 71/5001 useless extension candidates. Maximal degree in co-relation 47612. Up to 4812 conditions per place. [2022-12-13 13:36:41,128 INFO L137 encePairwiseOnDemand]: 23/58 looper letters, 505 selfloop transitions, 54 changer transitions 6/566 dead transitions. [2022-12-13 13:36:41,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 566 transitions, 15756 flow [2022-12-13 13:36:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:36:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:36:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-12-13 13:36:41,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18007662835249041 [2022-12-13 13:36:41,129 INFO L175 Difference]: Start difference. First operand has 228 places, 548 transitions, 14501 flow. Second operand 9 states and 94 transitions. [2022-12-13 13:36:41,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 566 transitions, 15756 flow [2022-12-13 13:36:41,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 566 transitions, 15614 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 13:36:41,753 INFO L231 Difference]: Finished difference. Result has 231 places, 549 transitions, 14502 flow [2022-12-13 13:36:41,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=14359, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14502, PETRI_PLACES=231, PETRI_TRANSITIONS=549} [2022-12-13 13:36:41,753 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 210 predicate places. [2022-12-13 13:36:41,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:41,754 INFO L89 Accepts]: Start accepts. Operand has 231 places, 549 transitions, 14502 flow [2022-12-13 13:36:41,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:41,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:41,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 549 transitions, 14502 flow [2022-12-13 13:36:41,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 549 transitions, 14502 flow [2022-12-13 13:36:42,061 INFO L130 PetriNetUnfolder]: 628/2022 cut-off events. [2022-12-13 13:36:42,061 INFO L131 PetriNetUnfolder]: For 50675/50934 co-relation queries the response was YES. [2022-12-13 13:36:42,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17361 conditions, 2022 events. 628/2022 cut-off events. For 50675/50934 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 18790 event pairs, 1 based on Foata normal form. 76/2097 useless extension candidates. Maximal degree in co-relation 17143. Up to 685 conditions per place. [2022-12-13 13:36:42,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 549 transitions, 14502 flow [2022-12-13 13:36:42,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 1838 [2022-12-13 13:36:42,090 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-13 13:36:42,185 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:42,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 432 [2022-12-13 13:36:42,186 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 548 transitions, 14482 flow [2022-12-13 13:36:42,186 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-13 13:36:42,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:42,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:42,191 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-13 13:36:42,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:42,392 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-13 13:36:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash 249989750, now seen corresponding path program 1 times [2022-12-13 13:36:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:42,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703167788] [2022-12-13 13:36:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:43,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-13 13:36:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703167788] [2022-12-13 13:36:43,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703167788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096197582] [2022-12-13 13:36:43,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:43,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:43,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:43,166 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-13 13:36:43,167 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-13 13:36:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:43,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:36:43,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:43,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:43,401 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-13 13:36:43,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:43,485 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-13 13:36:43,507 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-13 13:36:43,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:43,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:43,620 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-13 13:36:43,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:43,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 110 treesize of output 97 [2022-12-13 13:36:43,891 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-13 13:36:43,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096197582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:43,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:43,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:36:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528831456] [2022-12-13 13:36:43,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:43,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:36:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:36:43,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:36:43,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-13 13:36:43,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 548 transitions, 14482 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-13 13:36:43,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:43,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-13 13:36:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:45,681 INFO L130 PetriNetUnfolder]: 2593/4999 cut-off events. [2022-12-13 13:36:45,682 INFO L131 PetriNetUnfolder]: For 151531/151821 co-relation queries the response was YES. [2022-12-13 13:36:45,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48863 conditions, 4999 events. 2593/4999 cut-off events. For 151531/151821 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 37373 event pairs, 518 based on Foata normal form. 84/5083 useless extension candidates. Maximal degree in co-relation 48320. Up to 4810 conditions per place. [2022-12-13 13:36:45,729 INFO L137 encePairwiseOnDemand]: 15/59 looper letters, 494 selfloop transitions, 67 changer transitions 22/584 dead transitions. [2022-12-13 13:36:45,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 584 transitions, 16047 flow [2022-12-13 13:36:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:36:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:36:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-12-13 13:36:45,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1638418079096045 [2022-12-13 13:36:45,730 INFO L175 Difference]: Start difference. First operand has 229 places, 548 transitions, 14482 flow. Second operand 12 states and 116 transitions. [2022-12-13 13:36:45,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 584 transitions, 16047 flow [2022-12-13 13:36:46,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 584 transitions, 15903 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-13 13:36:46,368 INFO L231 Difference]: Finished difference. Result has 238 places, 553 transitions, 14643 flow [2022-12-13 13:36:46,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=14340, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14643, PETRI_PLACES=238, PETRI_TRANSITIONS=553} [2022-12-13 13:36:46,368 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2022-12-13 13:36:46,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:46,368 INFO L89 Accepts]: Start accepts. Operand has 238 places, 553 transitions, 14643 flow [2022-12-13 13:36:46,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:46,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:46,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 553 transitions, 14643 flow [2022-12-13 13:36:46,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 553 transitions, 14643 flow [2022-12-13 13:36:46,676 INFO L130 PetriNetUnfolder]: 631/2027 cut-off events. [2022-12-13 13:36:46,676 INFO L131 PetriNetUnfolder]: For 51490/51751 co-relation queries the response was YES. [2022-12-13 13:36:46,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17557 conditions, 2027 events. 631/2027 cut-off events. For 51490/51751 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 18792 event pairs, 1 based on Foata normal form. 79/2105 useless extension candidates. Maximal degree in co-relation 17406. Up to 685 conditions per place. [2022-12-13 13:36:46,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 553 transitions, 14643 flow [2022-12-13 13:36:46,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 1846 [2022-12-13 13:36:46,703 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:36:46,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-13 13:36:46,703 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 553 transitions, 14643 flow [2022-12-13 13:36:46,703 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-13 13:36:46,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:46,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:46,708 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-13 13:36:46,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-12-13 13:36:46,904 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-13 13:36:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1786827472, now seen corresponding path program 2 times [2022-12-13 13:36:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18672330] [2022-12-13 13:36:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:47,774 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-13 13:36:47,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:47,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18672330] [2022-12-13 13:36:47,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18672330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:47,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299159177] [2022-12-13 13:36:47,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:36:47,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:47,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:47,776 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-13 13:36:47,777 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-13 13:36:48,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:36:48,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:36:48,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 13:36:48,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:48,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 63 [2022-12-13 13:36:48,061 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-13 13:36:48,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:48,092 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-13 13:36:48,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:48,157 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-13 13:36:48,195 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-13 13:36:48,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:48,394 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-13 13:36:48,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299159177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:48,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:48,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:36:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766451892] [2022-12-13 13:36:48,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:48,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:36:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:48,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:36:48,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:36:48,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-13 13:36:48,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 553 transitions, 14643 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-13 13:36:48,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:48,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-13 13:36:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:50,336 INFO L130 PetriNetUnfolder]: 2575/4989 cut-off events. [2022-12-13 13:36:50,337 INFO L131 PetriNetUnfolder]: For 159687/159910 co-relation queries the response was YES. [2022-12-13 13:36:50,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48836 conditions, 4989 events. 2575/4989 cut-off events. For 159687/159910 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 37441 event pairs, 928 based on Foata normal form. 60/5049 useless extension candidates. Maximal degree in co-relation 48641. Up to 4808 conditions per place. [2022-12-13 13:36:50,389 INFO L137 encePairwiseOnDemand]: 15/59 looper letters, 504 selfloop transitions, 68 changer transitions 14/587 dead transitions. [2022-12-13 13:36:50,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 587 transitions, 16132 flow [2022-12-13 13:36:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:36:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:36:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2022-12-13 13:36:50,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15514993481095177 [2022-12-13 13:36:50,390 INFO L175 Difference]: Start difference. First operand has 234 places, 553 transitions, 14643 flow. Second operand 13 states and 119 transitions. [2022-12-13 13:36:50,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 587 transitions, 16132 flow [2022-12-13 13:36:50,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 587 transitions, 16058 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 13:36:50,950 INFO L231 Difference]: Finished difference. Result has 243 places, 556 transitions, 14804 flow [2022-12-13 13:36:50,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=14569, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14804, PETRI_PLACES=243, PETRI_TRANSITIONS=556} [2022-12-13 13:36:50,951 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 222 predicate places. [2022-12-13 13:36:50,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:50,951 INFO L89 Accepts]: Start accepts. Operand has 243 places, 556 transitions, 14804 flow [2022-12-13 13:36:50,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:50,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:50,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 556 transitions, 14804 flow [2022-12-13 13:36:50,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 556 transitions, 14804 flow [2022-12-13 13:36:51,305 INFO L130 PetriNetUnfolder]: 629/2032 cut-off events. [2022-12-13 13:36:51,305 INFO L131 PetriNetUnfolder]: For 52627/52900 co-relation queries the response was YES. [2022-12-13 13:36:51,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17596 conditions, 2032 events. 629/2032 cut-off events. For 52627/52900 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 18857 event pairs, 1 based on Foata normal form. 91/2122 useless extension candidates. Maximal degree in co-relation 17396. Up to 683 conditions per place. [2022-12-13 13:36:51,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 556 transitions, 14804 flow [2022-12-13 13:36:51,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-13 13:36:51,337 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-13 13:36:51,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:51,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-13 13:36:51,436 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 555 transitions, 14784 flow [2022-12-13 13:36:51,436 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-13 13:36:51,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:51,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:51,442 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-13 13:36:51,637 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,SelfDestructingSolverStorable98 [2022-12-13 13:36:51,637 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-13 13:36:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash -125277577, now seen corresponding path program 1 times [2022-12-13 13:36:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:51,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308621352] [2022-12-13 13:36:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:52,142 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-13 13:36:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:52,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308621352] [2022-12-13 13:36:52,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308621352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:52,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958660922] [2022-12-13 13:36:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:52,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:52,144 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-13 13:36:52,145 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-13 13:36:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:52,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:36:52,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:52,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:52,389 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-13 13:36:52,410 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-13 13:36:52,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:52,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:52,456 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-13 13:36:52,458 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-13 13:36:52,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-13 13:36:52,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958660922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:52,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:52,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 13:36:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786416604] [2022-12-13 13:36:52,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:52,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:36:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:36:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2022-12-13 13:36:52,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 60 [2022-12-13 13:36:52,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 555 transitions, 14784 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-13 13:36:52,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:52,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 60 [2022-12-13 13:36:52,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:54,050 INFO L130 PetriNetUnfolder]: 2661/5112 cut-off events. [2022-12-13 13:36:54,050 INFO L131 PetriNetUnfolder]: For 162526/162687 co-relation queries the response was YES. [2022-12-13 13:36:54,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50396 conditions, 5112 events. 2661/5112 cut-off events. For 162526/162687 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 38375 event pairs, 339 based on Foata normal form. 111/5223 useless extension candidates. Maximal degree in co-relation 49815. Up to 3864 conditions per place. [2022-12-13 13:36:54,106 INFO L137 encePairwiseOnDemand]: 18/60 looper letters, 411 selfloop transitions, 220 changer transitions 0/632 dead transitions. [2022-12-13 13:36:54,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 632 transitions, 17325 flow [2022-12-13 13:36:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:36:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:36:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-13 13:36:54,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-13 13:36:54,109 INFO L175 Difference]: Start difference. First operand has 240 places, 555 transitions, 14784 flow. Second operand 7 states and 98 transitions. [2022-12-13 13:36:54,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 632 transitions, 17325 flow [2022-12-13 13:36:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 632 transitions, 17121 flow, removed 22 selfloop flow, removed 13 redundant places. [2022-12-13 13:36:54,809 INFO L231 Difference]: Finished difference. Result has 235 places, 577 transitions, 15868 flow [2022-12-13 13:36:54,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=14580, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15868, PETRI_PLACES=235, PETRI_TRANSITIONS=577} [2022-12-13 13:36:54,809 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 214 predicate places. [2022-12-13 13:36:54,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:54,809 INFO L89 Accepts]: Start accepts. Operand has 235 places, 577 transitions, 15868 flow [2022-12-13 13:36:54,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:54,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:54,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 577 transitions, 15868 flow [2022-12-13 13:36:54,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 577 transitions, 15868 flow [2022-12-13 13:36:55,158 INFO L130 PetriNetUnfolder]: 653/2096 cut-off events. [2022-12-13 13:36:55,159 INFO L131 PetriNetUnfolder]: For 57145/57451 co-relation queries the response was YES. [2022-12-13 13:36:55,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18578 conditions, 2096 events. 653/2096 cut-off events. For 57145/57451 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19578 event pairs, 1 based on Foata normal form. 95/2190 useless extension candidates. Maximal degree in co-relation 18341. Up to 718 conditions per place. [2022-12-13 13:36:55,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 577 transitions, 15868 flow [2022-12-13 13:36:55,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 1946 [2022-12-13 13:36:55,189 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:36:55,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-13 13:36:55,190 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 577 transitions, 15868 flow [2022-12-13 13:36:55,190 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-13 13:36:55,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:55,190 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:55,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-12-13 13:36:55,390 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,SelfDestructingSolverStorable99 [2022-12-13 13:36:55,391 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-13 13:36:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash 249018210, now seen corresponding path program 1 times [2022-12-13 13:36:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:55,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219829399] [2022-12-13 13:36:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:55,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:56,156 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-13 13:36:56,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:56,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219829399] [2022-12-13 13:36:56,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219829399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:56,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251776327] [2022-12-13 13:36:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:56,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:56,158 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-13 13:36:56,158 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-13 13:36:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:56,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 13:36:56,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:56,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:56,401 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-13 13:36:56,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:56,483 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-13 13:36:56,500 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-13 13:36:56,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:56,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:56,619 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-13 13:36:56,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:56,631 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-13 13:36:56,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-13 13:36:56,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251776327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:56,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:56,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:36:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057608171] [2022-12-13 13:36:56,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:56,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:36:56,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:36:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:36:56,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 60 [2022-12-13 13:36:56,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 577 transitions, 15868 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-13 13:36:56,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:56,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 60 [2022-12-13 13:36:56,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:58,521 INFO L130 PetriNetUnfolder]: 2679/5156 cut-off events. [2022-12-13 13:36:58,521 INFO L131 PetriNetUnfolder]: For 169982/170036 co-relation queries the response was YES. [2022-12-13 13:36:58,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52244 conditions, 5156 events. 2679/5156 cut-off events. For 169982/170036 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 38827 event pairs, 618 based on Foata normal form. 47/5203 useless extension candidates. Maximal degree in co-relation 51674. Up to 4906 conditions per place. [2022-12-13 13:36:58,575 INFO L137 encePairwiseOnDemand]: 31/60 looper letters, 532 selfloop transitions, 80 changer transitions 4/617 dead transitions. [2022-12-13 13:36:58,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 617 transitions, 17565 flow [2022-12-13 13:36:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:36:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:36:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-12-13 13:36:58,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16805555555555557 [2022-12-13 13:36:58,576 INFO L175 Difference]: Start difference. First operand has 235 places, 577 transitions, 15868 flow. Second operand 12 states and 121 transitions. [2022-12-13 13:36:58,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 617 transitions, 17565 flow [2022-12-13 13:36:59,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 617 transitions, 17325 flow, removed 46 selfloop flow, removed 3 redundant places. [2022-12-13 13:36:59,185 INFO L231 Difference]: Finished difference. Result has 248 places, 587 transitions, 16143 flow [2022-12-13 13:36:59,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=15638, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16143, PETRI_PLACES=248, PETRI_TRANSITIONS=587} [2022-12-13 13:36:59,186 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 227 predicate places. [2022-12-13 13:36:59,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:59,186 INFO L89 Accepts]: Start accepts. Operand has 248 places, 587 transitions, 16143 flow [2022-12-13 13:36:59,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:59,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:59,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 587 transitions, 16143 flow [2022-12-13 13:36:59,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 587 transitions, 16143 flow [2022-12-13 13:36:59,574 INFO L130 PetriNetUnfolder]: 655/2104 cut-off events. [2022-12-13 13:36:59,574 INFO L131 PetriNetUnfolder]: For 57040/57296 co-relation queries the response was YES. [2022-12-13 13:36:59,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18842 conditions, 2104 events. 655/2104 cut-off events. For 57040/57296 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19726 event pairs, 1 based on Foata normal form. 73/2176 useless extension candidates. Maximal degree in co-relation 18590. Up to 728 conditions per place. [2022-12-13 13:36:59,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 587 transitions, 16143 flow [2022-12-13 13:36:59,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-13 13:36:59,617 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:59,617 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:59,694 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:59,695 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:59,834 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:59,834 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:59,977 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:36:59,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 791 [2022-12-13 13:36:59,977 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 585 transitions, 16131 flow [2022-12-13 13:36:59,977 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-13 13:36:59,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:59,977 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:59,987 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-13 13:37:00,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:00,184 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-13 13:37:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:00,184 INFO L85 PathProgramCache]: Analyzing trace with hash 895534324, now seen corresponding path program 2 times [2022-12-13 13:37:00,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314470613] [2022-12-13 13:37:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:01,041 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-13 13:37:01,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314470613] [2022-12-13 13:37:01,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314470613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:01,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177835549] [2022-12-13 13:37:01,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:37:01,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:01,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:01,043 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-13 13:37:01,043 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-13 13:37:01,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:37:01,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:37:01,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 13:37:01,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:01,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:01,436 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-13 13:37:01,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:01,498 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-13 13:37:01,535 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-13 13:37:01,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:01,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:01,642 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-13 13:37:01,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:01,652 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-13 13:37:01,846 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-13 13:37:01,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177835549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:01,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:01,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:37:01,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024468719] [2022-12-13 13:37:01,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:01,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:37:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:01,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:37:01,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:37:01,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 62 [2022-12-13 13:37:01,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 585 transitions, 16131 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-13 13:37:01,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:01,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 62 [2022-12-13 13:37:01,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:04,068 INFO L130 PetriNetUnfolder]: 2770/5391 cut-off events. [2022-12-13 13:37:04,068 INFO L131 PetriNetUnfolder]: For 176928/177007 co-relation queries the response was YES. [2022-12-13 13:37:04,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54595 conditions, 5391 events. 2770/5391 cut-off events. For 176928/177007 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41712 event pairs, 428 based on Foata normal form. 66/5457 useless extension candidates. Maximal degree in co-relation 53942. Up to 4586 conditions per place. [2022-12-13 13:37:04,124 INFO L137 encePairwiseOnDemand]: 15/62 looper letters, 490 selfloop transitions, 163 changer transitions 23/677 dead transitions. [2022-12-13 13:37:04,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 677 transitions, 18863 flow [2022-12-13 13:37:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:37:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:37:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 158 transitions. [2022-12-13 13:37:04,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14990512333965844 [2022-12-13 13:37:04,125 INFO L175 Difference]: Start difference. First operand has 246 places, 585 transitions, 16131 flow. Second operand 17 states and 158 transitions. [2022-12-13 13:37:04,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 677 transitions, 18863 flow [2022-12-13 13:37:04,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 677 transitions, 18685 flow, removed 71 selfloop flow, removed 3 redundant places. [2022-12-13 13:37:04,891 INFO L231 Difference]: Finished difference. Result has 265 places, 613 transitions, 17276 flow [2022-12-13 13:37:04,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=15957, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=17276, PETRI_PLACES=265, PETRI_TRANSITIONS=613} [2022-12-13 13:37:04,891 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 244 predicate places. [2022-12-13 13:37:04,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:04,891 INFO L89 Accepts]: Start accepts. Operand has 265 places, 613 transitions, 17276 flow [2022-12-13 13:37:04,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:04,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:04,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 613 transitions, 17276 flow [2022-12-13 13:37:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 613 transitions, 17276 flow [2022-12-13 13:37:05,315 INFO L130 PetriNetUnfolder]: 656/2151 cut-off events. [2022-12-13 13:37:05,315 INFO L131 PetriNetUnfolder]: For 62768/63066 co-relation queries the response was YES. [2022-12-13 13:37:05,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19835 conditions, 2151 events. 656/2151 cut-off events. For 62768/63066 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20516 event pairs, 1 based on Foata normal form. 88/2236 useless extension candidates. Maximal degree in co-relation 19577. Up to 732 conditions per place. [2022-12-13 13:37:05,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 613 transitions, 17276 flow [2022-12-13 13:37:05,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 2074 [2022-12-13 13:37:05,349 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-13 13:37:05,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:37:05,585 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:05,585 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:05,585 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:05,586 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:05,586 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:05,586 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:05,880 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:37:05,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-13 13:37:05,881 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 610 transitions, 17234 flow [2022-12-13 13:37:05,881 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-13 13:37:05,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:05,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:05,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-13 13:37:06,081 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,SelfDestructingSolverStorable101 [2022-12-13 13:37:06,082 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-13 13:37:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1879752067, now seen corresponding path program 1 times [2022-12-13 13:37:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:06,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351312898] [2022-12-13 13:37:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:06,138 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-13 13:37:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:06,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351312898] [2022-12-13 13:37:06,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351312898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:06,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:06,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:37:06,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734614936] [2022-12-13 13:37:06,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:37:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:06,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:37:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:37:06,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-13 13:37:06,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 610 transitions, 17234 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-13 13:37:06,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:06,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-13 13:37:06,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:07,829 INFO L130 PetriNetUnfolder]: 2984/5802 cut-off events. [2022-12-13 13:37:07,829 INFO L131 PetriNetUnfolder]: For 197465/197602 co-relation queries the response was YES. [2022-12-13 13:37:07,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59637 conditions, 5802 events. 2984/5802 cut-off events. For 197465/197602 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 44877 event pairs, 377 based on Foata normal form. 57/5859 useless extension candidates. Maximal degree in co-relation 59046. Up to 3029 conditions per place. [2022-12-13 13:37:07,888 INFO L137 encePairwiseOnDemand]: 29/64 looper letters, 340 selfloop transitions, 351 changer transitions 5/697 dead transitions. [2022-12-13 13:37:07,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 697 transitions, 20463 flow [2022-12-13 13:37:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:37:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:37:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 13:37:07,889 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.303125 [2022-12-13 13:37:07,889 INFO L175 Difference]: Start difference. First operand has 260 places, 610 transitions, 17234 flow. Second operand 5 states and 97 transitions. [2022-12-13 13:37:07,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 697 transitions, 20463 flow [2022-12-13 13:37:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 697 transitions, 20275 flow, removed 76 selfloop flow, removed 3 redundant places. [2022-12-13 13:37:08,736 INFO L231 Difference]: Finished difference. Result has 264 places, 656 transitions, 19567 flow [2022-12-13 13:37:08,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=17052, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=19567, PETRI_PLACES=264, PETRI_TRANSITIONS=656} [2022-12-13 13:37:08,737 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 243 predicate places. [2022-12-13 13:37:08,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:08,737 INFO L89 Accepts]: Start accepts. Operand has 264 places, 656 transitions, 19567 flow [2022-12-13 13:37:08,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:08,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:08,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 656 transitions, 19567 flow [2022-12-13 13:37:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 656 transitions, 19567 flow [2022-12-13 13:37:09,247 INFO L130 PetriNetUnfolder]: 722/2361 cut-off events. [2022-12-13 13:37:09,247 INFO L131 PetriNetUnfolder]: For 72823/73184 co-relation queries the response was YES. [2022-12-13 13:37:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23336 conditions, 2361 events. 722/2361 cut-off events. For 72823/73184 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22692 event pairs, 1 based on Foata normal form. 94/2451 useless extension candidates. Maximal degree in co-relation 23060. Up to 811 conditions per place. [2022-12-13 13:37:09,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 656 transitions, 19567 flow [2022-12-13 13:37:09,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 2184 [2022-12-13 13:37:09,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:37:09,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:37:09,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-13 13:37:09,381 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 655 transitions, 19559 flow [2022-12-13 13:37:09,381 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-13 13:37:09,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:09,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:09,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 13:37:09,381 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-13 13:37:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash -253867510, now seen corresponding path program 1 times [2022-12-13 13:37:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:09,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947606407] [2022-12-13 13:37:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:10,408 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-13 13:37:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:10,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947606407] [2022-12-13 13:37:10,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947606407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:10,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:10,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:37:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328545641] [2022-12-13 13:37:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:37:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:37:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:37:10,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-13 13:37:10,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 655 transitions, 19559 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-13 13:37:10,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:10,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-13 13:37:10,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:12,291 INFO L130 PetriNetUnfolder]: 2973/5776 cut-off events. [2022-12-13 13:37:12,291 INFO L131 PetriNetUnfolder]: For 212490/212530 co-relation queries the response was YES. [2022-12-13 13:37:12,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63549 conditions, 5776 events. 2973/5776 cut-off events. For 212490/212530 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 44726 event pairs, 753 based on Foata normal form. 36/5812 useless extension candidates. Maximal degree in co-relation 62904. Up to 5647 conditions per place. [2022-12-13 13:37:12,361 INFO L137 encePairwiseOnDemand]: 31/63 looper letters, 602 selfloop transitions, 57 changer transitions 5/665 dead transitions. [2022-12-13 13:37:12,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 665 transitions, 20916 flow [2022-12-13 13:37:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:37:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:37:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-13 13:37:12,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23544973544973544 [2022-12-13 13:37:12,362 INFO L175 Difference]: Start difference. First operand has 262 places, 655 transitions, 19559 flow. Second operand 6 states and 89 transitions. [2022-12-13 13:37:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 665 transitions, 20916 flow [2022-12-13 13:37:13,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 665 transitions, 20750 flow, removed 41 selfloop flow, removed 4 redundant places. [2022-12-13 13:37:13,321 INFO L231 Difference]: Finished difference. Result has 262 places, 653 transitions, 19480 flow [2022-12-13 13:37:13,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=19389, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19480, PETRI_PLACES=262, PETRI_TRANSITIONS=653} [2022-12-13 13:37:13,322 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 241 predicate places. [2022-12-13 13:37:13,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:13,322 INFO L89 Accepts]: Start accepts. Operand has 262 places, 653 transitions, 19480 flow [2022-12-13 13:37:13,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:13,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:13,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 653 transitions, 19480 flow [2022-12-13 13:37:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 653 transitions, 19480 flow [2022-12-13 13:37:13,768 INFO L130 PetriNetUnfolder]: 722/2352 cut-off events. [2022-12-13 13:37:13,768 INFO L131 PetriNetUnfolder]: For 71763/72096 co-relation queries the response was YES. [2022-12-13 13:37:13,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23166 conditions, 2352 events. 722/2352 cut-off events. For 71763/72096 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22619 event pairs, 1 based on Foata normal form. 86/2435 useless extension candidates. Maximal degree in co-relation 22891. Up to 811 conditions per place. [2022-12-13 13:37:13,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 653 transitions, 19480 flow [2022-12-13 13:37:13,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 2176 [2022-12-13 13:37:13,806 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:37:13,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-13 13:37:13,807 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 653 transitions, 19480 flow [2022-12-13 13:37:13,807 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-13 13:37:13,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:13,807 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:13,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 13:37:13,807 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-13 13:37:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -643276592, now seen corresponding path program 1 times [2022-12-13 13:37:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689191571] [2022-12-13 13:37:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,732 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-13 13:37:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689191571] [2022-12-13 13:37:14,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689191571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026638190] [2022-12-13 13:37:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:14,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:14,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:14,733 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-13 13:37:14,734 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-13 13:37:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 13:37:14,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:15,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:15,011 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-13 13:37:15,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:15,079 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-13 13:37:15,099 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-13 13:37:15,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:15,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:15,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 135 treesize of output 136 [2022-12-13 13:37:15,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:15,208 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-13 13:37:15,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:15,212 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-13 13:37:15,267 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-13 13:37:15,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026638190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:15,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:15,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:37:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217675510] [2022-12-13 13:37:15,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:15,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:37:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:37:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:37:15,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 62 [2022-12-13 13:37:15,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 653 transitions, 19480 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-13 13:37:15,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:15,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 62 [2022-12-13 13:37:15,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:17,594 INFO L130 PetriNetUnfolder]: 2978/5792 cut-off events. [2022-12-13 13:37:17,594 INFO L131 PetriNetUnfolder]: For 220133/220229 co-relation queries the response was YES. [2022-12-13 13:37:17,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63440 conditions, 5792 events. 2978/5792 cut-off events. For 220133/220229 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 44945 event pairs, 1092 based on Foata normal form. 32/5824 useless extension candidates. Maximal degree in co-relation 62796. Up to 5589 conditions per place. [2022-12-13 13:37:17,666 INFO L137 encePairwiseOnDemand]: 33/62 looper letters, 599 selfloop transitions, 75 changer transitions 2/677 dead transitions. [2022-12-13 13:37:17,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 677 transitions, 21068 flow [2022-12-13 13:37:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:37:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:37:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-13 13:37:17,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18996415770609318 [2022-12-13 13:37:17,667 INFO L175 Difference]: Start difference. First operand has 260 places, 653 transitions, 19480 flow. Second operand 9 states and 106 transitions. [2022-12-13 13:37:17,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 677 transitions, 21068 flow [2022-12-13 13:37:18,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 677 transitions, 20954 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:37:18,598 INFO L231 Difference]: Finished difference. Result has 267 places, 656 transitions, 19660 flow [2022-12-13 13:37:18,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=19366, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19660, PETRI_PLACES=267, PETRI_TRANSITIONS=656} [2022-12-13 13:37:18,599 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 246 predicate places. [2022-12-13 13:37:18,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:18,599 INFO L89 Accepts]: Start accepts. Operand has 267 places, 656 transitions, 19660 flow [2022-12-13 13:37:18,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:18,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:18,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 656 transitions, 19660 flow [2022-12-13 13:37:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 656 transitions, 19660 flow [2022-12-13 13:37:19,116 INFO L130 PetriNetUnfolder]: 721/2357 cut-off events. [2022-12-13 13:37:19,116 INFO L131 PetriNetUnfolder]: For 73147/73435 co-relation queries the response was YES. [2022-12-13 13:37:19,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23348 conditions, 2357 events. 721/2357 cut-off events. For 73147/73435 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22669 event pairs, 1 based on Foata normal form. 85/2439 useless extension candidates. Maximal degree in co-relation 23065. Up to 810 conditions per place. [2022-12-13 13:37:19,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 656 transitions, 19660 flow [2022-12-13 13:37:19,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 2190 [2022-12-13 13:37:19,172 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:19,172 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:19,249 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:19,249 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:19,396 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:19,396 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:19,535 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:37:19,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 937 [2022-12-13 13:37:19,536 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 654 transitions, 19637 flow [2022-12-13 13:37:19,536 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-13 13:37:19,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:19,536 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:19,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-12-13 13:37:19,742 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,SelfDestructingSolverStorable104 [2022-12-13 13:37:19,742 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-13 13:37:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 294507972, now seen corresponding path program 1 times [2022-12-13 13:37:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:19,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971827896] [2022-12-13 13:37:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,893 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-13 13:37:20,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:20,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971827896] [2022-12-13 13:37:20,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971827896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:20,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967793845] [2022-12-13 13:37:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:20,895 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-13 13:37:20,896 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-13 13:37:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 13:37:21,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:21,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:21,152 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-13 13:37:21,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:21,297 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-13 13:37:21,324 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-13 13:37:21,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:21,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:21,530 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 251 treesize of output 285 [2022-12-13 13:37:21,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:21,558 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 153 treesize of output 173 [2022-12-13 13:37:22,369 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-13 13:37:22,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967793845] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:22,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:37:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350741859] [2022-12-13 13:37:22,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:22,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:37:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:37:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:37:22,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-13 13:37:22,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 654 transitions, 19637 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-13 13:37:22,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:22,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-13 13:37:22,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:25,363 INFO L130 PetriNetUnfolder]: 3045/5954 cut-off events. [2022-12-13 13:37:25,363 INFO L131 PetriNetUnfolder]: For 220577/220613 co-relation queries the response was YES. [2022-12-13 13:37:25,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65209 conditions, 5954 events. 3045/5954 cut-off events. For 220577/220613 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 46743 event pairs, 512 based on Foata normal form. 46/6000 useless extension candidates. Maximal degree in co-relation 64557. Up to 5364 conditions per place. [2022-12-13 13:37:25,436 INFO L137 encePairwiseOnDemand]: 15/64 looper letters, 548 selfloop transitions, 143 changer transitions 45/737 dead transitions. [2022-12-13 13:37:25,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 737 transitions, 21988 flow [2022-12-13 13:37:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:37:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 13:37:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2022-12-13 13:37:25,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13616071428571427 [2022-12-13 13:37:25,437 INFO L175 Difference]: Start difference. First operand has 265 places, 654 transitions, 19637 flow. Second operand 21 states and 183 transitions. [2022-12-13 13:37:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 737 transitions, 21988 flow [2022-12-13 13:37:26,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 737 transitions, 21713 flow, removed 56 selfloop flow, removed 7 redundant places. [2022-12-13 13:37:26,517 INFO L231 Difference]: Finished difference. Result has 287 places, 657 transitions, 19756 flow [2022-12-13 13:37:26,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=19362, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=19756, PETRI_PLACES=287, PETRI_TRANSITIONS=657} [2022-12-13 13:37:26,518 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 266 predicate places. [2022-12-13 13:37:26,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:26,518 INFO L89 Accepts]: Start accepts. Operand has 287 places, 657 transitions, 19756 flow [2022-12-13 13:37:26,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:26,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:26,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 657 transitions, 19756 flow [2022-12-13 13:37:26,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 657 transitions, 19756 flow [2022-12-13 13:37:27,024 INFO L130 PetriNetUnfolder]: 720/2333 cut-off events. [2022-12-13 13:37:27,025 INFO L131 PetriNetUnfolder]: For 73566/73836 co-relation queries the response was YES. [2022-12-13 13:37:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 2333 events. 720/2333 cut-off events. For 73566/73836 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22260 event pairs, 1 based on Foata normal form. 80/2408 useless extension candidates. Maximal degree in co-relation 23291. Up to 810 conditions per place. [2022-12-13 13:37:27,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 657 transitions, 19756 flow [2022-12-13 13:37:27,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 2172 [2022-12-13 13:37:27,070 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:37:27,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-13 13:37:27,071 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 657 transitions, 19756 flow [2022-12-13 13:37:27,071 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-13 13:37:27,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:27,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:27,079 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-13 13:37:27,277 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,SelfDestructingSolverStorable105 [2022-12-13 13:37:27,278 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-13 13:37:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1150749562, now seen corresponding path program 1 times [2022-12-13 13:37:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:27,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816887027] [2022-12-13 13:37:27,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,336 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-13 13:37:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816887027] [2022-12-13 13:37:27,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816887027] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711593577] [2022-12-13 13:37:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:27,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:27,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:27,338 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-13 13:37:27,339 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-13 13:37:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:37:27,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:27,582 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-13 13:37:27,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:27,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711593577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:27,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:27,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 13:37:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157966939] [2022-12-13 13:37:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:27,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:37:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:37:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:37:27,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-13 13:37:27,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 657 transitions, 19756 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-13 13:37:27,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:27,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-13 13:37:27,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:29,330 INFO L130 PetriNetUnfolder]: 2947/5705 cut-off events. [2022-12-13 13:37:29,331 INFO L131 PetriNetUnfolder]: For 211006/211060 co-relation queries the response was YES. [2022-12-13 13:37:29,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63310 conditions, 5705 events. 2947/5705 cut-off events. For 211006/211060 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 43683 event pairs, 266 based on Foata normal form. 60/5765 useless extension candidates. Maximal degree in co-relation 63103. Up to 3047 conditions per place. [2022-12-13 13:37:29,396 INFO L137 encePairwiseOnDemand]: 28/64 looper letters, 342 selfloop transitions, 346 changer transitions 6/695 dead transitions. [2022-12-13 13:37:29,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 695 transitions, 21838 flow [2022-12-13 13:37:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:37:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:37:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 13:37:29,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.303125 [2022-12-13 13:37:29,397 INFO L175 Difference]: Start difference. First operand has 281 places, 657 transitions, 19756 flow. Second operand 5 states and 97 transitions. [2022-12-13 13:37:29,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 695 transitions, 21838 flow [2022-12-13 13:37:30,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 695 transitions, 21612 flow, removed 52 selfloop flow, removed 13 redundant places. [2022-12-13 13:37:30,411 INFO L231 Difference]: Finished difference. Result has 273 places, 653 transitions, 20173 flow [2022-12-13 13:37:30,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=19552, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20173, PETRI_PLACES=273, PETRI_TRANSITIONS=653} [2022-12-13 13:37:30,411 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2022-12-13 13:37:30,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:30,411 INFO L89 Accepts]: Start accepts. Operand has 273 places, 653 transitions, 20173 flow [2022-12-13 13:37:30,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:30,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:30,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 653 transitions, 20173 flow [2022-12-13 13:37:30,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 653 transitions, 20173 flow [2022-12-13 13:37:30,928 INFO L130 PetriNetUnfolder]: 719/2320 cut-off events. [2022-12-13 13:37:30,928 INFO L131 PetriNetUnfolder]: For 74068/74306 co-relation queries the response was YES. [2022-12-13 13:37:30,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23911 conditions, 2320 events. 719/2320 cut-off events. For 74068/74306 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 22029 event pairs, 1 based on Foata normal form. 77/2393 useless extension candidates. Maximal degree in co-relation 23665. Up to 809 conditions per place. [2022-12-13 13:37:30,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 653 transitions, 20173 flow [2022-12-13 13:37:30,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 2154 [2022-12-13 13:37:30,970 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:37:30,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 560 [2022-12-13 13:37:30,971 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 653 transitions, 20173 flow [2022-12-13 13:37:30,971 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-13 13:37:30,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:30,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:30,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-12-13 13:37:31,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:31,171 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-13 13:37:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1560300419, now seen corresponding path program 1 times [2022-12-13 13:37:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:31,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084376177] [2022-12-13 13:37:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:32,324 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-13 13:37:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:32,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084376177] [2022-12-13 13:37:32,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084376177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:32,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871842532] [2022-12-13 13:37:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:32,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:32,326 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-13 13:37:32,328 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-13 13:37:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:32,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 13:37:32,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:32,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:32,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 112 treesize of output 24 [2022-12-13 13:37:32,726 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-13 13:37:32,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:32,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:32,903 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 172 treesize of output 380 [2022-12-13 13:37:33,079 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-13 13:37:33,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871842532] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:33,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:33,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-13 13:37:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083686354] [2022-12-13 13:37:33,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:33,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:37:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:37:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:37:33,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2022-12-13 13:37:33,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 653 transitions, 20173 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-13 13:37:33,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:33,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2022-12-13 13:37:33,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:35,629 INFO L130 PetriNetUnfolder]: 2965/5754 cut-off events. [2022-12-13 13:37:35,630 INFO L131 PetriNetUnfolder]: For 221903/221948 co-relation queries the response was YES. [2022-12-13 13:37:35,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65283 conditions, 5754 events. 2965/5754 cut-off events. For 221903/221948 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 44392 event pairs, 796 based on Foata normal form. 34/5788 useless extension candidates. Maximal degree in co-relation 64826. Up to 5579 conditions per place. [2022-12-13 13:37:35,696 INFO L137 encePairwiseOnDemand]: 26/61 looper letters, 615 selfloop transitions, 67 changer transitions 13/696 dead transitions. [2022-12-13 13:37:35,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 696 transitions, 22113 flow [2022-12-13 13:37:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:37:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:37:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 129 transitions. [2022-12-13 13:37:35,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14098360655737704 [2022-12-13 13:37:35,697 INFO L175 Difference]: Start difference. First operand has 272 places, 653 transitions, 20173 flow. Second operand 15 states and 129 transitions. [2022-12-13 13:37:35,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 696 transitions, 22113 flow [2022-12-13 13:37:36,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 696 transitions, 21971 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 13:37:36,675 INFO L231 Difference]: Finished difference. Result has 288 places, 661 transitions, 20434 flow [2022-12-13 13:37:36,675 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=20031, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20434, PETRI_PLACES=288, PETRI_TRANSITIONS=661} [2022-12-13 13:37:36,675 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 267 predicate places. [2022-12-13 13:37:36,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:36,675 INFO L89 Accepts]: Start accepts. Operand has 288 places, 661 transitions, 20434 flow [2022-12-13 13:37:36,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:36,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:36,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 661 transitions, 20434 flow [2022-12-13 13:37:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 661 transitions, 20434 flow [2022-12-13 13:37:37,316 INFO L130 PetriNetUnfolder]: 721/2333 cut-off events. [2022-12-13 13:37:37,316 INFO L131 PetriNetUnfolder]: For 75103/75307 co-relation queries the response was YES. [2022-12-13 13:37:37,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24098 conditions, 2333 events. 721/2333 cut-off events. For 75103/75307 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22237 event pairs, 1 based on Foata normal form. 70/2397 useless extension candidates. Maximal degree in co-relation 23851. Up to 811 conditions per place. [2022-12-13 13:37:37,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 661 transitions, 20434 flow [2022-12-13 13:37:37,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 2172 [2022-12-13 13:37:37,359 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-13 13:37:37,457 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-13 13:37:37,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [852] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_857| v_~q~0.base_604))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_741| v_~N~0_483) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_701| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_701| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_701|) (= v_~q_front~0_1179 (+ v_~q_front~0_1180 1)) (= v_~q_back~0_1310 (+ v_~q_back~0_1311 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_674| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674|) (= (select .cse0 (+ v_~q~0.offset_603 (* v_~q_front~0_1180 4))) |v_thread2Thread1of1ForFork1_~j~0#1_733|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_701| (ite (= (select .cse0 (+ (* v_~q_back~0_1311 4) v_~q~0.offset_603)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674| 0)) (not (= (ite (and (<= 0 v_~q_back~0_1311) (< v_~q_back~0_1311 v_~n~0_595)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_740| (+ |v_thread1Thread1of1ForFork0_~i~0#1_741| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_674| (ite (and (< v_~q_front~0_1180 v_~n~0_595) (<= 0 v_~q_front~0_1180) (< v_~q_front~0_1180 v_~q_back~0_1311)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_733| 0)) (= (+ v_~s~0_1146 |v_thread2Thread1of1ForFork1_~j~0#1_733|) v_~s~0_1145))) InVars {~q_back~0=v_~q_back~0_1311, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_741|, #memory_int=|v_#memory_int_857|, ~N~0=v_~N~0_483, ~q~0.base=v_~q~0.base_604, ~n~0=v_~n~0_595, ~q~0.offset=v_~q~0.offset_603, ~s~0=v_~s~0_1146, ~q_front~0=v_~q_front~0_1180} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_733|, ~q_back~0=v_~q_back~0_1310, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_674|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_516|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_674|, ~N~0=v_~N~0_483, ~q~0.base=v_~q~0.base_604, ~q~0.offset=v_~q~0.offset_603, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_674|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_701|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_520|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_516|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_740|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_701|, #memory_int=|v_#memory_int_857|, ~n~0=v_~n~0_595, ~s~0=v_~s~0_1145, ~q_front~0=v_~q_front~0_1179} 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 [872] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_901| v_~q~0.base_630))) (and (= (+ v_~s~0_1256 |v_thread2Thread1of1ForFork1_~j~0#1_812|) v_~s~0_1255) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_743| 0)) (= v_~q_front~0_1281 (+ v_~q_front~0_1282 1)) (= (select .cse0 (+ v_~q~0.offset_629 (* v_~q_front~0_1282 4))) |v_thread2Thread1of1ForFork1_~j~0#1_812|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_745| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_786| (+ |v_thread1Thread1of1ForFork0_~i~0#1_787| 1)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_812| 0)) (not (= (ite (and (<= 0 v_~q_back~0_1381) (< v_~q_back~0_1381 v_~n~0_621)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_745| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_745|) (= (+ v_~q_back~0_1381 1) v_~q_back~0_1380) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1381 4) v_~q~0.offset_629)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_743|) (< |v_thread1Thread1of1ForFork0_~i~0#1_787| v_~N~0_497) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_745| (ite (and (< v_~q_front~0_1282 v_~q_back~0_1381) (< v_~q_front~0_1282 v_~n~0_621) (<= 0 v_~q_front~0_1282)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_743| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_743|))) InVars {~q_back~0=v_~q_back~0_1381, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_787|, #memory_int=|v_#memory_int_901|, ~N~0=v_~N~0_497, ~q~0.base=v_~q~0.base_630, ~n~0=v_~n~0_621, ~q~0.offset=v_~q~0.offset_629, ~s~0=v_~s~0_1256, ~q_front~0=v_~q_front~0_1282} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_812|, ~q_back~0=v_~q_back~0_1380, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_745|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_544|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_745|, ~N~0=v_~N~0_497, ~q~0.base=v_~q~0.base_630, ~q~0.offset=v_~q~0.offset_629, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_745|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_745|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_743|, 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_786|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_743|, #memory_int=|v_#memory_int_901|, ~n~0=v_~n~0_621, ~s~0=v_~s~0_1255, ~q_front~0=v_~q_front~0_1281} 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] [2022-12-13 13:37:37,571 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,571 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,571 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,572 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,572 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,572 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,902 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,902 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,902 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,902 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,902 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:37,902 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:38,121 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-13 13:37:38,216 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:37:38,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1541 [2022-12-13 13:37:38,216 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 658 transitions, 20390 flow [2022-12-13 13:37:38,216 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-13 13:37:38,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:38,217 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:38,223 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-13 13:37:38,423 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,SelfDestructingSolverStorable107 [2022-12-13 13:37:38,423 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-13 13:37:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1083315760, now seen corresponding path program 1 times [2022-12-13 13:37:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:38,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260477536] [2022-12-13 13:37:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:38,627 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-13 13:37:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:38,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260477536] [2022-12-13 13:37:38,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260477536] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:38,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993594857] [2022-12-13 13:37:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:38,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:38,629 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-13 13:37:38,631 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-13 13:37:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:38,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:37:38,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:38,978 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-13 13:37:38,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:39,044 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 13:37:39,044 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-13 13:37:39,086 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-13 13:37:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993594857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:39,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:39,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-13 13:37:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090801944] [2022-12-13 13:37:39,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:39,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:37:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:37:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:37:39,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-13 13:37:39,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 658 transitions, 20390 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-13 13:37:39,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:39,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-13 13:37:39,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:41,784 INFO L130 PetriNetUnfolder]: 3280/6310 cut-off events. [2022-12-13 13:37:41,784 INFO L131 PetriNetUnfolder]: For 280375/280456 co-relation queries the response was YES. [2022-12-13 13:37:41,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71860 conditions, 6310 events. 3280/6310 cut-off events. For 280375/280456 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 49256 event pairs, 954 based on Foata normal form. 74/6384 useless extension candidates. Maximal degree in co-relation 71127. Up to 4649 conditions per place. [2022-12-13 13:37:41,868 INFO L137 encePairwiseOnDemand]: 38/65 looper letters, 625 selfloop transitions, 227 changer transitions 2/855 dead transitions. [2022-12-13 13:37:41,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 855 transitions, 26381 flow [2022-12-13 13:37:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:37:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:37:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-12-13 13:37:41,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17988165680473372 [2022-12-13 13:37:41,869 INFO L175 Difference]: Start difference. First operand has 283 places, 658 transitions, 20390 flow. Second operand 13 states and 152 transitions. [2022-12-13 13:37:41,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 855 transitions, 26381 flow [2022-12-13 13:37:43,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 855 transitions, 26204 flow, removed 66 selfloop flow, removed 7 redundant places. [2022-12-13 13:37:43,080 INFO L231 Difference]: Finished difference. Result has 295 places, 743 transitions, 23717 flow [2022-12-13 13:37:43,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=20225, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=23717, PETRI_PLACES=295, PETRI_TRANSITIONS=743} [2022-12-13 13:37:43,081 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 274 predicate places. [2022-12-13 13:37:43,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:43,081 INFO L89 Accepts]: Start accepts. Operand has 295 places, 743 transitions, 23717 flow [2022-12-13 13:37:43,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:43,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:43,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 295 places, 743 transitions, 23717 flow [2022-12-13 13:37:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 743 transitions, 23717 flow [2022-12-13 13:37:43,638 INFO L130 PetriNetUnfolder]: 807/2543 cut-off events. [2022-12-13 13:37:43,638 INFO L131 PetriNetUnfolder]: For 93649/93855 co-relation queries the response was YES. [2022-12-13 13:37:43,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27759 conditions, 2543 events. 807/2543 cut-off events. For 93649/93855 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24420 event pairs, 2 based on Foata normal form. 74/2611 useless extension candidates. Maximal degree in co-relation 27438. Up to 926 conditions per place. [2022-12-13 13:37:43,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 743 transitions, 23717 flow [2022-12-13 13:37:43,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 2428 [2022-12-13 13:37:44,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_731| v_~q~0.base_501))) (let ((.cse1 (+ v_~n~0_497 1)) (.cse0 (select .cse2 (+ (* 4 v_~q_front~0_906) v_~q~0.offset_500))) (.cse3 (* v_~q_back~0_1037 4))) (and (< 4 v_~N~0_393) (not (= .cse0 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_550| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_502| (ite (and (< v_~q_front~0_905 (+ 3 v_~q_back~0_1037)) (<= 1 v_~q_front~0_905) (< v_~q_front~0_905 .cse1)) 1 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_500)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_500 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_906 (+ v_~q_back~0_1037 1)) (<= 0 v_~q_front~0_906) (< v_~q_front~0_906 v_~n~0_497)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_502| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_502|) (= (+ 2 v_~q_front~0_906) v_~q_front~0_905) (= (ite (= (select .cse2 (+ (- 4) (* v_~q_back~0_1035 4) v_~q~0.offset_500)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_527|) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_500)) 1) 1 0) 0)) (= (+ 5 v_~q_back~0_1037) v_~q_back~0_1035) (not (= (ite (and (< v_~q_back~0_1035 .cse1) (<= 1 v_~q_back~0_1035)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_545| 5) (= v_~s~0_860 (+ .cse0 v_~s~0_861 |v_thread2Thread1of1ForFork1_~j~0#1_550|)) (not (= (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_500)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_527| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_527|) (= (select .cse2 (+ (- 4) v_~q~0.offset_500 (* 4 v_~q_front~0_905))) |v_thread2Thread1of1ForFork1_~j~0#1_550|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_527| 0))))) InVars {~q_back~0=v_~q_back~0_1037, #memory_int=|v_#memory_int_731|, ~N~0=v_~N~0_393, ~q~0.base=v_~q~0.base_501, ~n~0=v_~n~0_497, ~q~0.offset=v_~q~0.offset_500, ~s~0=v_~s~0_861, ~q_front~0=v_~q_front~0_906} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_550|, ~q_back~0=v_~q_back~0_1035, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_502|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_365|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_502|, ~N~0=v_~N~0_393, ~q~0.base=v_~q~0.base_501, ~q~0.offset=v_~q~0.offset_500, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_502|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_502|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_527|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_369|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_365|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_545|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_527|, #memory_int=|v_#memory_int_731|, ~n~0=v_~n~0_497, ~s~0=v_~s~0_860, ~q_front~0=v_~q_front~0_905} 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-13 13:37:44,681 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:44,682 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:44,682 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:44,682 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:45,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:37:45,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2121 [2022-12-13 13:37:45,202 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 743 transitions, 23841 flow [2022-12-13 13:37:45,202 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-13 13:37:45,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:45,202 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:45,208 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-13 13:37:45,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:45,403 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-13 13:37:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 293824324, now seen corresponding path program 2 times [2022-12-13 13:37:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:45,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753284031] [2022-12-13 13:37:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:46,705 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-13 13:37:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:46,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753284031] [2022-12-13 13:37:46,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753284031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:46,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891517004] [2022-12-13 13:37:46,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:37:46,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:46,707 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-13 13:37:46,708 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-13 13:37:47,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:37:47,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:37:47,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 13:37:47,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:47,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:47,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 30 treesize of output 30 [2022-12-13 13:37:47,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:47,153 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-13 13:37:47,176 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-13 13:37:47,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:47,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:47,325 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-13 13:37:47,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:47,331 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-13 13:37:47,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:47,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 62 treesize of output 49 [2022-12-13 13:37:47,401 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-13 13:37:47,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891517004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:47,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:47,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:37:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705436981] [2022-12-13 13:37:47,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:47,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:37:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:47,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:37:47,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=326, Unknown=1, NotChecked=0, Total=380 [2022-12-13 13:37:47,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-13 13:37:47,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 743 transitions, 23841 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-13 13:37:47,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:47,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-13 13:37:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:51,617 INFO L130 PetriNetUnfolder]: 3356/6471 cut-off events. [2022-12-13 13:37:51,617 INFO L131 PetriNetUnfolder]: For 285429/285486 co-relation queries the response was YES. [2022-12-13 13:37:51,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77287 conditions, 6471 events. 3356/6471 cut-off events. For 285429/285486 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 50816 event pairs, 455 based on Foata normal form. 77/6548 useless extension candidates. Maximal degree in co-relation 76558. Up to 5885 conditions per place. [2022-12-13 13:37:51,704 INFO L137 encePairwiseOnDemand]: 15/67 looper letters, 624 selfloop transitions, 153 changer transitions 50/828 dead transitions. [2022-12-13 13:37:51,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 828 transitions, 26646 flow [2022-12-13 13:37:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:37:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 13:37:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 195 transitions. [2022-12-13 13:37:51,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1322930800542741 [2022-12-13 13:37:51,705 INFO L175 Difference]: Start difference. First operand has 294 places, 743 transitions, 23841 flow. Second operand 22 states and 195 transitions. [2022-12-13 13:37:51,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 828 transitions, 26646 flow [2022-12-13 13:37:53,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 828 transitions, 26037 flow, removed 293 selfloop flow, removed 3 redundant places. [2022-12-13 13:37:53,134 INFO L231 Difference]: Finished difference. Result has 322 places, 746 transitions, 23842 flow [2022-12-13 13:37:53,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=23270, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=23842, PETRI_PLACES=322, PETRI_TRANSITIONS=746} [2022-12-13 13:37:53,135 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 301 predicate places. [2022-12-13 13:37:53,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:53,135 INFO L89 Accepts]: Start accepts. Operand has 322 places, 746 transitions, 23842 flow [2022-12-13 13:37:53,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:53,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:53,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 322 places, 746 transitions, 23842 flow [2022-12-13 13:37:53,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 746 transitions, 23842 flow [2022-12-13 13:37:53,687 INFO L130 PetriNetUnfolder]: 809/2520 cut-off events. [2022-12-13 13:37:53,687 INFO L131 PetriNetUnfolder]: For 97240/97445 co-relation queries the response was YES. [2022-12-13 13:37:53,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28188 conditions, 2520 events. 809/2520 cut-off events. For 97240/97445 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24009 event pairs, 1 based on Foata normal form. 75/2592 useless extension candidates. Maximal degree in co-relation 28041. Up to 933 conditions per place. [2022-12-13 13:37:53,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 746 transitions, 23842 flow [2022-12-13 13:37:53,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 2434 [2022-12-13 13:37:53,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:37:53,960 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:53,961 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:53,961 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:53,961 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:53,961 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:53,961 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:54,213 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:37:54,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1078 [2022-12-13 13:37:54,213 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 744 transitions, 23790 flow [2022-12-13 13:37:54,213 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-13 13:37:54,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:54,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:54,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-12-13 13:37:54,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:54,414 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-13 13:37:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1735795415, now seen corresponding path program 1 times [2022-12-13 13:37:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:54,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957366506] [2022-12-13 13:37:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:55,904 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-13 13:37:55,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957366506] [2022-12-13 13:37:55,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957366506] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237854329] [2022-12-13 13:37:55,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:55,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:55,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:55,906 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-13 13:37:55,907 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-13 13:37:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:56,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 13:37:56,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:56,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:56,208 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-13 13:37:56,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:56,341 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-13 13:37:56,367 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-13 13:37:56,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:56,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:56,573 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 251 treesize of output 285 [2022-12-13 13:37:56,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:56,600 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 153 treesize of output 173 [2022-12-13 13:37:57,374 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-13 13:37:57,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237854329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:57,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:57,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:37:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330048546] [2022-12-13 13:37:57,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:57,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:37:57,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:37:57,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:37:57,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-13 13:37:57,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 744 transitions, 23790 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-13 13:37:57,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:57,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-13 13:37:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:00,892 INFO L130 PetriNetUnfolder]: 3292/6283 cut-off events. [2022-12-13 13:38:00,893 INFO L131 PetriNetUnfolder]: For 279743/279799 co-relation queries the response was YES. [2022-12-13 13:38:00,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75760 conditions, 6283 events. 3292/6283 cut-off events. For 279743/279799 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 48595 event pairs, 652 based on Foata normal form. 51/6334 useless extension candidates. Maximal degree in co-relation 75609. Up to 6080 conditions per place. [2022-12-13 13:38:00,975 INFO L137 encePairwiseOnDemand]: 18/67 looper letters, 679 selfloop transitions, 80 changer transitions 26/786 dead transitions. [2022-12-13 13:38:00,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 786 transitions, 25993 flow [2022-12-13 13:38:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:38:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:38:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2022-12-13 13:38:00,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14695752009184845 [2022-12-13 13:38:00,976 INFO L175 Difference]: Start difference. First operand has 311 places, 744 transitions, 23790 flow. Second operand 13 states and 128 transitions. [2022-12-13 13:38:00,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 786 transitions, 25993 flow [2022-12-13 13:38:02,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 786 transitions, 25430 flow, removed 220 selfloop flow, removed 13 redundant places. [2022-12-13 13:38:02,808 INFO L231 Difference]: Finished difference. Result has 317 places, 750 transitions, 23659 flow [2022-12-13 13:38:02,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=23249, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=23659, PETRI_PLACES=317, PETRI_TRANSITIONS=750} [2022-12-13 13:38:02,808 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 296 predicate places. [2022-12-13 13:38:02,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:02,809 INFO L89 Accepts]: Start accepts. Operand has 317 places, 750 transitions, 23659 flow [2022-12-13 13:38:02,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:02,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:02,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 750 transitions, 23659 flow [2022-12-13 13:38:02,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 750 transitions, 23659 flow [2022-12-13 13:38:03,379 INFO L130 PetriNetUnfolder]: 812/2513 cut-off events. [2022-12-13 13:38:03,380 INFO L131 PetriNetUnfolder]: For 94800/95048 co-relation queries the response was YES. [2022-12-13 13:38:03,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27719 conditions, 2513 events. 812/2513 cut-off events. For 94800/95048 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 23914 event pairs, 1 based on Foata normal form. 82/2591 useless extension candidates. Maximal degree in co-relation 27577. Up to 929 conditions per place. [2022-12-13 13:38:03,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 750 transitions, 23659 flow [2022-12-13 13:38:03,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 2430 [2022-12-13 13:38:03,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:03,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-13 13:38:03,432 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 750 transitions, 23659 flow [2022-12-13 13:38:03,432 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-13 13:38:03,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:03,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:03,439 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-13 13:38:03,634 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,SelfDestructingSolverStorable110 [2022-12-13 13:38:03,634 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-13 13:38:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 477479319, now seen corresponding path program 1 times [2022-12-13 13:38:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:03,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588266871] [2022-12-13 13:38:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:03,720 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-13 13:38:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:03,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588266871] [2022-12-13 13:38:03,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588266871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:03,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217651293] [2022-12-13 13:38:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:03,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:03,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:03,722 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-13 13:38:03,723 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-13 13:38:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:03,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:38:03,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:03,990 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-13 13:38:03,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:03,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217651293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:03,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:03,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-13 13:38:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604924990] [2022-12-13 13:38:03,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:03,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:03,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:03,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-13 13:38:03,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 750 transitions, 23659 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-13 13:38:03,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:03,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-13 13:38:03,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:06,329 INFO L130 PetriNetUnfolder]: 3348/6402 cut-off events. [2022-12-13 13:38:06,329 INFO L131 PetriNetUnfolder]: For 283428/283534 co-relation queries the response was YES. [2022-12-13 13:38:06,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76544 conditions, 6402 events. 3348/6402 cut-off events. For 283428/283534 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 49790 event pairs, 405 based on Foata normal form. 84/6486 useless extension candidates. Maximal degree in co-relation 76352. Up to 3697 conditions per place. [2022-12-13 13:38:06,422 INFO L137 encePairwiseOnDemand]: 30/67 looper letters, 363 selfloop transitions, 435 changer transitions 2/801 dead transitions. [2022-12-13 13:38:06,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 801 transitions, 26575 flow [2022-12-13 13:38:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:38:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:38:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 13:38:06,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31044776119402984 [2022-12-13 13:38:06,423 INFO L175 Difference]: Start difference. First operand has 313 places, 750 transitions, 23659 flow. Second operand 5 states and 104 transitions. [2022-12-13 13:38:06,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 801 transitions, 26575 flow [2022-12-13 13:38:08,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 801 transitions, 26440 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-13 13:38:08,116 INFO L231 Difference]: Finished difference. Result has 311 places, 779 transitions, 26350 flow [2022-12-13 13:38:08,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=23498, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=417, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=26350, PETRI_PLACES=311, PETRI_TRANSITIONS=779} [2022-12-13 13:38:08,116 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 290 predicate places. [2022-12-13 13:38:08,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:08,117 INFO L89 Accepts]: Start accepts. Operand has 311 places, 779 transitions, 26350 flow [2022-12-13 13:38:08,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:08,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:08,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 779 transitions, 26350 flow [2022-12-13 13:38:08,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 779 transitions, 26350 flow [2022-12-13 13:38:08,862 INFO L130 PetriNetUnfolder]: 827/2591 cut-off events. [2022-12-13 13:38:08,862 INFO L131 PetriNetUnfolder]: For 101673/101932 co-relation queries the response was YES. [2022-12-13 13:38:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30488 conditions, 2591 events. 827/2591 cut-off events. For 101673/101932 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24875 event pairs, 0 based on Foata normal form. 83/2671 useless extension candidates. Maximal degree in co-relation 30139. Up to 974 conditions per place. [2022-12-13 13:38:08,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 779 transitions, 26350 flow [2022-12-13 13:38:08,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 13:38:08,914 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:08,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 798 [2022-12-13 13:38:08,915 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 779 transitions, 26350 flow [2022-12-13 13:38:08,915 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-13 13:38:08,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:08,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:08,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:09,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:09,115 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-13 13:38:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 602002853, now seen corresponding path program 2 times [2022-12-13 13:38:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:09,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087731703] [2022-12-13 13:38:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:10,387 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-13 13:38:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:10,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087731703] [2022-12-13 13:38:10,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087731703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:10,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723725723] [2022-12-13 13:38:10,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:38:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:10,389 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-13 13:38:10,390 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-13 13:38:10,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:38:10,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:38:10,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 13:38:10,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:10,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:38:10,746 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-13 13:38:10,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:10,836 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-13 13:38:10,881 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-13 13:38:10,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:11,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:11,061 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 251 treesize of output 285 [2022-12-13 13:38:11,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:11,086 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 153 treesize of output 173 [2022-12-13 13:38:11,950 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-13 13:38:11,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723725723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:38:11,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:38:11,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:38:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087565956] [2022-12-13 13:38:11,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:38:11,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:38:11,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:11,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:38:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:38:11,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 66 [2022-12-13 13:38:11,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 779 transitions, 26350 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-13 13:38:11,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:11,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 66 [2022-12-13 13:38:11,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:15,259 INFO L130 PetriNetUnfolder]: 3354/6452 cut-off events. [2022-12-13 13:38:15,260 INFO L131 PetriNetUnfolder]: For 296042/296094 co-relation queries the response was YES. [2022-12-13 13:38:15,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81438 conditions, 6452 events. 3354/6452 cut-off events. For 296042/296094 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 50329 event pairs, 715 based on Foata normal form. 51/6503 useless extension candidates. Maximal degree in co-relation 80289. Up to 6238 conditions per place. [2022-12-13 13:38:15,345 INFO L137 encePairwiseOnDemand]: 17/66 looper letters, 705 selfloop transitions, 85 changer transitions 15/806 dead transitions. [2022-12-13 13:38:15,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 806 transitions, 28303 flow [2022-12-13 13:38:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:38:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:38:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-12-13 13:38:15,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13986013986013987 [2022-12-13 13:38:15,346 INFO L175 Difference]: Start difference. First operand has 311 places, 779 transitions, 26350 flow. Second operand 13 states and 120 transitions. [2022-12-13 13:38:15,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 806 transitions, 28303 flow [2022-12-13 13:38:17,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 806 transitions, 28111 flow, removed 96 selfloop flow, removed 0 redundant places. [2022-12-13 13:38:17,528 INFO L231 Difference]: Finished difference. Result has 327 places, 779 transitions, 26354 flow [2022-12-13 13:38:17,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=26158, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=26354, PETRI_PLACES=327, PETRI_TRANSITIONS=779} [2022-12-13 13:38:17,529 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 306 predicate places. [2022-12-13 13:38:17,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:17,529 INFO L89 Accepts]: Start accepts. Operand has 327 places, 779 transitions, 26354 flow [2022-12-13 13:38:17,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:17,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:17,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 327 places, 779 transitions, 26354 flow [2022-12-13 13:38:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 779 transitions, 26354 flow [2022-12-13 13:38:18,216 INFO L130 PetriNetUnfolder]: 826/2589 cut-off events. [2022-12-13 13:38:18,217 INFO L131 PetriNetUnfolder]: For 103808/104104 co-relation queries the response was YES. [2022-12-13 13:38:18,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30645 conditions, 2589 events. 826/2589 cut-off events. For 103808/104104 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 24776 event pairs, 1 based on Foata normal form. 90/2674 useless extension candidates. Maximal degree in co-relation 30302. Up to 975 conditions per place. [2022-12-13 13:38:18,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 779 transitions, 26354 flow [2022-12-13 13:38:18,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 13:38:18,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:18,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 741 [2022-12-13 13:38:18,270 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 779 transitions, 26354 flow [2022-12-13 13:38:18,270 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-13 13:38:18,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:18,270 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:18,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-12-13 13:38:18,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-12-13 13:38:18,470 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-13 13:38:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 726912041, now seen corresponding path program 2 times [2022-12-13 13:38:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:18,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779779015] [2022-12-13 13:38:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:19,082 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-13 13:38:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779779015] [2022-12-13 13:38:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779779015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88961867] [2022-12-13 13:38:19,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:38:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:19,084 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-13 13:38:19,085 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-13 13:38:19,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:38:19,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:38:19,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 13:38:19,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:19,365 INFO L321 Elim1Store]: treesize reduction 58, result has 28.4 percent of original size [2022-12-13 13:38:19,365 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 35 treesize of output 63 [2022-12-13 13:38:19,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:38:19,369 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 32 [2022-12-13 13:38:19,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:38:19,415 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-13 13:38:19,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:19,516 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-13 13:38:19,536 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-13 13:38:19,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:19,724 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-13 13:38:19,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88961867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:38:19,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:38:19,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:38:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172556841] [2022-12-13 13:38:19,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:38:19,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:38:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:38:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:38:19,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 66 [2022-12-13 13:38:19,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 779 transitions, 26354 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-13 13:38:19,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:19,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 66 [2022-12-13 13:38:19,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:23,050 INFO L130 PetriNetUnfolder]: 3380/6510 cut-off events. [2022-12-13 13:38:23,051 INFO L131 PetriNetUnfolder]: For 305279/305335 co-relation queries the response was YES. [2022-12-13 13:38:23,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82183 conditions, 6510 events. 3380/6510 cut-off events. For 305279/305335 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 50998 event pairs, 457 based on Foata normal form. 57/6567 useless extension candidates. Maximal degree in co-relation 81417. Up to 5927 conditions per place. [2022-12-13 13:38:23,151 INFO L137 encePairwiseOnDemand]: 14/66 looper letters, 673 selfloop transitions, 165 changer transitions 6/845 dead transitions. [2022-12-13 13:38:23,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 845 transitions, 28826 flow [2022-12-13 13:38:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:38:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:38:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-12-13 13:38:23,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1371610845295056 [2022-12-13 13:38:23,153 INFO L175 Difference]: Start difference. First operand has 325 places, 779 transitions, 26354 flow. Second operand 19 states and 172 transitions. [2022-12-13 13:38:23,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 845 transitions, 28826 flow [2022-12-13 13:38:24,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 845 transitions, 28628 flow, removed 22 selfloop flow, removed 10 redundant places. [2022-12-13 13:38:24,973 INFO L231 Difference]: Finished difference. Result has 341 places, 794 transitions, 27065 flow [2022-12-13 13:38:24,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=26156, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=27065, PETRI_PLACES=341, PETRI_TRANSITIONS=794} [2022-12-13 13:38:24,974 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 320 predicate places. [2022-12-13 13:38:24,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:24,974 INFO L89 Accepts]: Start accepts. Operand has 341 places, 794 transitions, 27065 flow [2022-12-13 13:38:24,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:24,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:24,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 341 places, 794 transitions, 27065 flow [2022-12-13 13:38:24,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 794 transitions, 27065 flow [2022-12-13 13:38:25,697 INFO L130 PetriNetUnfolder]: 825/2615 cut-off events. [2022-12-13 13:38:25,697 INFO L131 PetriNetUnfolder]: For 107668/107897 co-relation queries the response was YES. [2022-12-13 13:38:25,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31276 conditions, 2615 events. 825/2615 cut-off events. For 107668/107897 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 25309 event pairs, 1 based on Foata normal form. 84/2693 useless extension candidates. Maximal degree in co-relation 30922. Up to 985 conditions per place. [2022-12-13 13:38:25,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 341 places, 794 transitions, 27065 flow [2022-12-13 13:38:25,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 2606 [2022-12-13 13:38:25,755 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:25,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 782 [2022-12-13 13:38:25,756 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 794 transitions, 27065 flow [2022-12-13 13:38:25,756 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-13 13:38:25,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:25,756 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:25,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:25,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-12-13 13:38:25,957 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-13 13:38:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1958172623, now seen corresponding path program 3 times [2022-12-13 13:38:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:25,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026571947] [2022-12-13 13:38:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:26,519 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-13 13:38:26,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:26,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026571947] [2022-12-13 13:38:26,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026571947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:26,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853674661] [2022-12-13 13:38:26,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:38:26,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:26,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:26,521 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-13 13:38:26,522 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-13 13:38:26,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:38:26,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:38:26,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 13:38:26,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:38:26,931 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-13 13:38:27,195 INFO L321 Elim1Store]: treesize reduction 31, result has 43.6 percent of original size [2022-12-13 13:38:27,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 39 [2022-12-13 13:38:27,215 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-13 13:38:27,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:27,504 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (let ((.cse1 (+ c_~q_front~0 1)) (.cse4 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_4850 (Array Int Int)) (v_~q_front~0_1360 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4850) c_~q~0.base)) (.cse5 (* v_~q_front~0_1360 4))) (let ((.cse2 (select .cse3 (+ .cse5 c_~q~0.offset 4)))) (or (< v_~q_front~0_1360 0) (<= .cse0 v_~q_front~0_1360) (not (<= v_~q_front~0_1360 .cse1)) (not (= .cse2 0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| (+ c_~s~0 .cse2 (select .cse3 .cse4) (select .cse3 (+ .cse5 c_~q~0.offset)))))))) (forall ((v_ArrVal_4850 (Array Int Int)) (v_~q_front~0_1360 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4850) c_~q~0.base)) (.cse8 (* v_~q_front~0_1360 4))) (let ((.cse6 (select .cse7 (+ .cse8 c_~q~0.offset 4)))) (or (< v_~q_front~0_1360 0) (<= .cse0 v_~q_front~0_1360) (not (<= v_~q_front~0_1360 .cse1)) (< (+ c_~s~0 .cse6 (select .cse7 .cse4) (select .cse7 (+ .cse8 c_~q~0.offset))) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (not (= .cse6 0)))))))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (not (< .cse0 c_~n~0)))) is different from false [2022-12-13 13:38:27,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:27,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 259 treesize of output 408 [2022-12-13 13:38:27,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:27,620 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 165 treesize of output 166 [2022-12-13 13:38:27,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:27,637 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 139 treesize of output 140 [2022-12-13 13:38:29,013 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:29,180 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:31,023 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:31,278 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:31,590 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:32,384 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:32,895 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:33,069 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:34,375 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:37,096 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:37,779 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:38,451 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:39,147 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:39,804 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:40,099 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:40,559 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:40,922 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:41,019 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:41,053 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:41,083 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:41,115 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:41,206 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-13 13:38:41,303 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:41,361 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:41,681 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:41,794 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:41,893 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:42,011 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:42,164 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:42,324 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:42,502 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:42,698 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-13 13:38:42,920 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:43,207 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 13:38:43,348 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 13:38:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 13:38:52,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853674661] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:38:52,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:38:52,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-13 13:38:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885617764] [2022-12-13 13:38:52,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:38:52,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 13:38:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 13:38:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2022-12-13 13:38:52,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 66 [2022-12-13 13:38:52,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 794 transitions, 27065 flow. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:52,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:52,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 66 [2022-12-13 13:38:52,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:56,603 INFO L130 PetriNetUnfolder]: 3564/6873 cut-off events. [2022-12-13 13:38:56,604 INFO L131 PetriNetUnfolder]: For 334487/334538 co-relation queries the response was YES. [2022-12-13 13:38:56,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86894 conditions, 6873 events. 3564/6873 cut-off events. For 334487/334538 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 54548 event pairs, 1210 based on Foata normal form. 19/6892 useless extension candidates. Maximal degree in co-relation 86117. Up to 6274 conditions per place. [2022-12-13 13:38:56,701 INFO L137 encePairwiseOnDemand]: 42/66 looper letters, 774 selfloop transitions, 141 changer transitions 20/936 dead transitions. [2022-12-13 13:38:56,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 936 transitions, 31512 flow [2022-12-13 13:38:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 13:38:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 13:38:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 197 transitions. [2022-12-13 13:38:56,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12436868686868686 [2022-12-13 13:38:56,702 INFO L175 Difference]: Start difference. First operand has 341 places, 794 transitions, 27065 flow. Second operand 24 states and 197 transitions. [2022-12-13 13:38:56,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 936 transitions, 31512 flow [2022-12-13 13:38:58,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 936 transitions, 31316 flow, removed 59 selfloop flow, removed 4 redundant places. [2022-12-13 13:38:58,897 INFO L231 Difference]: Finished difference. Result has 371 places, 861 transitions, 29161 flow [2022-12-13 13:38:58,897 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=26869, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=29161, PETRI_PLACES=371, PETRI_TRANSITIONS=861} [2022-12-13 13:38:58,897 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 350 predicate places. [2022-12-13 13:38:58,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:58,897 INFO L89 Accepts]: Start accepts. Operand has 371 places, 861 transitions, 29161 flow [2022-12-13 13:38:58,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:58,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:58,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 861 transitions, 29161 flow [2022-12-13 13:38:58,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 861 transitions, 29161 flow [2022-12-13 13:38:59,574 INFO L130 PetriNetUnfolder]: 863/2744 cut-off events. [2022-12-13 13:38:59,574 INFO L131 PetriNetUnfolder]: For 115918/116130 co-relation queries the response was YES. [2022-12-13 13:38:59,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33371 conditions, 2744 events. 863/2744 cut-off events. For 115918/116130 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 26928 event pairs, 1 based on Foata normal form. 85/2826 useless extension candidates. Maximal degree in co-relation 33082. Up to 1042 conditions per place. [2022-12-13 13:38:59,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 861 transitions, 29161 flow [2022-12-13 13:38:59,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 2826 [2022-12-13 13:38:59,636 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:59,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 740 [2022-12-13 13:38:59,637 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 861 transitions, 29161 flow [2022-12-13 13:38:59,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:59,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:59,637 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:59,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-12-13 13:38:59,842 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,SelfDestructingSolverStorable114 [2022-12-13 13:38:59,843 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-13 13:38:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash -678799907, now seen corresponding path program 1 times [2022-12-13 13:38:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:59,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775125323] [2022-12-13 13:38:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:00,313 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-13 13:39:00,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:00,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775125323] [2022-12-13 13:39:00,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775125323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:00,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053214072] [2022-12-13 13:39:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:00,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:00,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:00,315 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-13 13:39:00,318 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-13 13:39:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:00,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:39:00,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:00,626 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-13 13:39:00,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:00,668 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:39:00,668 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-13 13:39:00,679 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-13 13:39:00,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053214072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:00,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:00,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-12-13 13:39:00,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920335983] [2022-12-13 13:39:00,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:00,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:39:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:00,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:39:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:39:00,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 66 [2022-12-13 13:39:00,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 861 transitions, 29161 flow. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 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-13 13:39:00,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:00,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 66 [2022-12-13 13:39:00,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:04,614 INFO L130 PetriNetUnfolder]: 4155/7917 cut-off events. [2022-12-13 13:39:04,614 INFO L131 PetriNetUnfolder]: For 448641/448697 co-relation queries the response was YES. [2022-12-13 13:39:04,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102692 conditions, 7917 events. 4155/7917 cut-off events. For 448641/448697 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 63639 event pairs, 664 based on Foata normal form. 211/8128 useless extension candidates. Maximal degree in co-relation 102102. Up to 5728 conditions per place. [2022-12-13 13:39:04,757 INFO L137 encePairwiseOnDemand]: 26/66 looper letters, 797 selfloop transitions, 359 changer transitions 0/1157 dead transitions. [2022-12-13 13:39:04,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1157 transitions, 38990 flow [2022-12-13 13:39:04,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:39:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 13:39:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 214 transitions. [2022-12-13 13:39:04,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14738292011019283 [2022-12-13 13:39:04,759 INFO L175 Difference]: Start difference. First operand has 368 places, 861 transitions, 29161 flow. Second operand 22 states and 214 transitions. [2022-12-13 13:39:04,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 1157 transitions, 38990 flow [2022-12-13 13:39:07,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1157 transitions, 38622 flow, removed 163 selfloop flow, removed 9 redundant places. [2022-12-13 13:39:07,186 INFO L231 Difference]: Finished difference. Result has 388 places, 969 transitions, 33987 flow [2022-12-13 13:39:07,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=28815, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=33987, PETRI_PLACES=388, PETRI_TRANSITIONS=969} [2022-12-13 13:39:07,186 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 367 predicate places. [2022-12-13 13:39:07,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:07,186 INFO L89 Accepts]: Start accepts. Operand has 388 places, 969 transitions, 33987 flow [2022-12-13 13:39:07,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:07,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:07,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 969 transitions, 33987 flow [2022-12-13 13:39:07,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 969 transitions, 33987 flow [2022-12-13 13:39:08,008 INFO L130 PetriNetUnfolder]: 1010/3155 cut-off events. [2022-12-13 13:39:08,009 INFO L131 PetriNetUnfolder]: For 140571/140967 co-relation queries the response was YES. [2022-12-13 13:39:08,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38991 conditions, 3155 events. 1010/3155 cut-off events. For 140571/140967 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 31750 event pairs, 2 based on Foata normal form. 105/3256 useless extension candidates. Maximal degree in co-relation 38616. Up to 1305 conditions per place. [2022-12-13 13:39:08,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 388 places, 969 transitions, 33987 flow [2022-12-13 13:39:08,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 3258 [2022-12-13 13:39:08,157 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:39:08,248 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-13 13:39:08,614 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:08,615 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:08,615 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:08,615 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:08,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [886] L92-3-->L47-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_847| (+ |v_thread1Thread1of1ForFork0_~i~0#1_848| 1)) (= (store |v_#memory_int_937| |v_ULTIMATE.start_main_~#t2~0#1.base_147| (store (select |v_#memory_int_937| |v_ULTIMATE.start_main_~#t2~0#1.base_147|) |v_ULTIMATE.start_main_~#t2~0#1.offset_141| |v_ULTIMATE.start_main_#t~pre14#1_275|)) |v_#memory_int_936|) (< |v_thread1Thread1of1ForFork0_~i~0#1_848| v_~N~0_517) (not (= (ite (and (<= 0 v_~q_back~0_1462) (< v_~q_back~0_1462 v_~n~0_641)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_799| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_799|) (= (+ v_~q_back~0_1462 1) v_~q_back~0_1461) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_799| 0)) (= (ite (= (select (select |v_#memory_int_936| v_~q~0.base_650) (+ (* v_~q_back~0_1462 4) v_~q~0.offset_649)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_799|) (= (+ |v_#pthreadsForks_292| 1) |v_#pthreadsForks_291|) (= |v_ULTIMATE.start_main_#t~pre14#1_275| |v_#pthreadsForks_292|)) InVars {~q_back~0=v_~q_back~0_1462, #pthreadsForks=|v_#pthreadsForks_292|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_848|, #memory_int=|v_#memory_int_937|, ~N~0=v_~N~0_517, ~q~0.base=v_~q~0.base_650, ~n~0=v_~n~0_641, ~q~0.offset=v_~q~0.offset_649, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_147|} OutVars{~q_back~0=v_~q_back~0_1461, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_141|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_585|, ~N~0=v_~N~0_517, ~q~0.base=v_~q~0.base_650, ~q~0.offset=v_~q~0.offset_649, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_799|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_243|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_589|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_275|, #pthreadsForks=|v_#pthreadsForks_291|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_585|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_847|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_799|, #memory_int=|v_#memory_int_936|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_201|, ~n~0=v_~n~0_641, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_147|} 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-13 13:39:08,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [886] L92-3-->L47-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_847| (+ |v_thread1Thread1of1ForFork0_~i~0#1_848| 1)) (= (store |v_#memory_int_937| |v_ULTIMATE.start_main_~#t2~0#1.base_147| (store (select |v_#memory_int_937| |v_ULTIMATE.start_main_~#t2~0#1.base_147|) |v_ULTIMATE.start_main_~#t2~0#1.offset_141| |v_ULTIMATE.start_main_#t~pre14#1_275|)) |v_#memory_int_936|) (< |v_thread1Thread1of1ForFork0_~i~0#1_848| v_~N~0_517) (not (= (ite (and (<= 0 v_~q_back~0_1462) (< v_~q_back~0_1462 v_~n~0_641)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_799| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_799|) (= (+ v_~q_back~0_1462 1) v_~q_back~0_1461) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_799| 0)) (= (ite (= (select (select |v_#memory_int_936| v_~q~0.base_650) (+ (* v_~q_back~0_1462 4) v_~q~0.offset_649)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_799|) (= (+ |v_#pthreadsForks_292| 1) |v_#pthreadsForks_291|) (= |v_ULTIMATE.start_main_#t~pre14#1_275| |v_#pthreadsForks_292|)) InVars {~q_back~0=v_~q_back~0_1462, #pthreadsForks=|v_#pthreadsForks_292|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_848|, #memory_int=|v_#memory_int_937|, ~N~0=v_~N~0_517, ~q~0.base=v_~q~0.base_650, ~n~0=v_~n~0_641, ~q~0.offset=v_~q~0.offset_649, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_147|} OutVars{~q_back~0=v_~q_back~0_1461, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_141|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_585|, ~N~0=v_~N~0_517, ~q~0.base=v_~q~0.base_650, ~q~0.offset=v_~q~0.offset_649, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_799|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_243|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_589|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_275|, #pthreadsForks=|v_#pthreadsForks_291|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_585|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_847|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_799|, #memory_int=|v_#memory_int_936|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_201|, ~n~0=v_~n~0_641, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_147|} 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 [543] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:39:09,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [889] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_944| v_~q~0.base_654)) (.cse1 (* v_~q_back~0_1473 4))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_805| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_805| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_653)) 1) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_653 4)) 1) 1 0) 0)) (= (store |v_#memory_int_945| |v_ULTIMATE.start_main_~#t2~0#1.base_151| (store (select |v_#memory_int_945| |v_ULTIMATE.start_main_~#t2~0#1.base_151|) |v_ULTIMATE.start_main_~#t2~0#1.offset_145| |v_ULTIMATE.start_main_#t~pre14#1_279|)) |v_#memory_int_944|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_805| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_805|) (= |v_thread1Thread1of1ForFork0_~i~0#1_853| 3) (not (= (ite (and (<= 0 v_~q_back~0_1473) (< v_~q_back~0_1473 v_~n~0_645)) 1 0) 0)) (= (+ 3 v_~q_back~0_1473) v_~q_back~0_1471) (= |v_ULTIMATE.start_main_#t~pre14#1_279| |v_#pthreadsForks_300|) (< |v_thread1Thread1of1ForFork0_~i~0#1_853| (+ v_~N~0_521 1)) (not (= (ite (= (select (select |v_#memory_int_945| v_~q~0.base_654) (+ .cse1 v_~q~0.offset_653)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1473))) (and (< .cse2 v_~n~0_645) (<= 0 .cse2))) 1 0) 0)) (= (+ |v_#pthreadsForks_300| 1) |v_#pthreadsForks_299|))) InVars {~q_back~0=v_~q_back~0_1473, #pthreadsForks=|v_#pthreadsForks_300|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_145|, #memory_int=|v_#memory_int_945|, ~N~0=v_~N~0_521, ~q~0.base=v_~q~0.base_654, ~n~0=v_~n~0_645, ~q~0.offset=v_~q~0.offset_653, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_151|} OutVars{~q_back~0=v_~q_back~0_1471, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_145|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_589|, ~N~0=v_~N~0_521, ~q~0.base=v_~q~0.base_654, ~q~0.offset=v_~q~0.offset_653, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_805|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_247|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_593|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_279|, #pthreadsForks=|v_#pthreadsForks_299|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_589|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_853|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_805|, #memory_int=|v_#memory_int_944|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_205|, ~n~0=v_~n~0_645, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_151|} 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-13 13:39:09,355 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:39:09,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2170 [2022-12-13 13:39:09,356 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 969 transitions, 34157 flow [2022-12-13 13:39:09,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 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-13 13:39:09,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:09,356 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:09,363 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-13 13:39:09,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:09,556 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-13 13:39:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:09,557 INFO L85 PathProgramCache]: Analyzing trace with hash -339230976, now seen corresponding path program 1 times [2022-12-13 13:39:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:09,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361256680] [2022-12-13 13:39:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:10,095 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-13 13:39:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:10,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361256680] [2022-12-13 13:39:10,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361256680] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:10,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607689986] [2022-12-13 13:39:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:10,097 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-13 13:39:10,097 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-13 13:39:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:10,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 13:39:10,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:10,413 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-13 13:39:10,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:10,452 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:39:10,452 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-13 13:39:10,466 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-13 13:39:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607689986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:10,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:10,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-13 13:39:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53705618] [2022-12-13 13:39:10,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:39:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:39:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:39:10,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-13 13:39:10,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 969 transitions, 34157 flow. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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-13 13:39:10,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:10,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-13 13:39:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:14,957 INFO L130 PetriNetUnfolder]: 4360/8098 cut-off events. [2022-12-13 13:39:14,958 INFO L131 PetriNetUnfolder]: For 517236/517310 co-relation queries the response was YES. [2022-12-13 13:39:15,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107366 conditions, 8098 events. 4360/8098 cut-off events. For 517236/517310 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 64290 event pairs, 207 based on Foata normal form. 422/8520 useless extension candidates. Maximal degree in co-relation 106568. Up to 3629 conditions per place. [2022-12-13 13:39:15,083 INFO L137 encePairwiseOnDemand]: 23/73 looper letters, 371 selfloop transitions, 851 changer transitions 2/1225 dead transitions. [2022-12-13 13:39:15,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1225 transitions, 41617 flow [2022-12-13 13:39:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:39:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 13:39:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 263 transitions. [2022-12-13 13:39:15,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1286692759295499 [2022-12-13 13:39:15,085 INFO L175 Difference]: Start difference. First operand has 388 places, 969 transitions, 34157 flow. Second operand 28 states and 263 transitions. [2022-12-13 13:39:15,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1225 transitions, 41617 flow [2022-12-13 13:39:17,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 1225 transitions, 40570 flow, removed 477 selfloop flow, removed 6 redundant places. [2022-12-13 13:39:17,808 INFO L231 Difference]: Finished difference. Result has 415 places, 1077 transitions, 38581 flow [2022-12-13 13:39:17,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=31885, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=721, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=38581, PETRI_PLACES=415, PETRI_TRANSITIONS=1077} [2022-12-13 13:39:17,809 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 394 predicate places. [2022-12-13 13:39:17,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:17,809 INFO L89 Accepts]: Start accepts. Operand has 415 places, 1077 transitions, 38581 flow [2022-12-13 13:39:17,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:17,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:17,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 1077 transitions, 38581 flow [2022-12-13 13:39:17,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 1077 transitions, 38581 flow [2022-12-13 13:39:18,799 INFO L130 PetriNetUnfolder]: 1064/3162 cut-off events. [2022-12-13 13:39:18,799 INFO L131 PetriNetUnfolder]: For 150028/150259 co-relation queries the response was YES. [2022-12-13 13:39:18,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40542 conditions, 3162 events. 1064/3162 cut-off events. For 150028/150259 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 31544 event pairs, 5 based on Foata normal form. 60/3218 useless extension candidates. Maximal degree in co-relation 40157. Up to 1437 conditions per place. [2022-12-13 13:39:18,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 1077 transitions, 38581 flow [2022-12-13 13:39:18,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 3634 [2022-12-13 13:39:18,881 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:18,882 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:18,882 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:18,882 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:19,107 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-13 13:39:19,205 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:19,205 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:19,369 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:39:19,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1561 [2022-12-13 13:39:19,370 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 1077 transitions, 38678 flow [2022-12-13 13:39:19,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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-13 13:39:19,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:19,370 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:19,378 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-13 13:39:19,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:19,578 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-13 13:39:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash 560705102, now seen corresponding path program 2 times [2022-12-13 13:39:19,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:19,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816059099] [2022-12-13 13:39:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:20,480 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-13 13:39:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:20,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816059099] [2022-12-13 13:39:20,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816059099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:20,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369807533] [2022-12-13 13:39:20,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:39:20,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:20,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:20,482 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-13 13:39:20,482 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-13 13:39:20,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:39:20,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:39:20,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:39:20,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:20,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:39:20,857 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-13 13:39:20,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:20,919 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-13 13:39:20,963 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-13 13:39:20,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:21,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:21,215 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-13 13:39:21,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:21,222 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-13 13:39:21,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:21,227 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-13 13:39:21,288 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-13 13:39:21,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369807533] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:21,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:21,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:39:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804510671] [2022-12-13 13:39:21,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:21,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:39:21,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:21,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:39:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=329, Unknown=1, NotChecked=0, Total=380 [2022-12-13 13:39:21,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-13 13:39:21,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1077 transitions, 38678 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-13 13:39:21,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:21,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-13 13:39:21,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:26,286 INFO L130 PetriNetUnfolder]: 4397/8203 cut-off events. [2022-12-13 13:39:26,286 INFO L131 PetriNetUnfolder]: For 476193/476234 co-relation queries the response was YES. [2022-12-13 13:39:26,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111505 conditions, 8203 events. 4397/8203 cut-off events. For 476193/476234 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 65761 event pairs, 848 based on Foata normal form. 32/8235 useless extension candidates. Maximal degree in co-relation 110679. Up to 7641 conditions per place. [2022-12-13 13:39:26,411 INFO L137 encePairwiseOnDemand]: 22/73 looper letters, 973 selfloop transitions, 180 changer transitions 18/1172 dead transitions. [2022-12-13 13:39:26,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1172 transitions, 42621 flow [2022-12-13 13:39:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 13:39:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 13:39:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 202 transitions. [2022-12-13 13:39:26,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12030970815961882 [2022-12-13 13:39:26,412 INFO L175 Difference]: Start difference. First operand has 415 places, 1077 transitions, 38678 flow. Second operand 23 states and 202 transitions. [2022-12-13 13:39:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1172 transitions, 42621 flow [2022-12-13 13:39:29,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1172 transitions, 39469 flow, removed 1036 selfloop flow, removed 10 redundant places. [2022-12-13 13:39:29,882 INFO L231 Difference]: Finished difference. Result has 438 places, 1106 transitions, 37019 flow [2022-12-13 13:39:29,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=35633, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1077, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=37019, PETRI_PLACES=438, PETRI_TRANSITIONS=1106} [2022-12-13 13:39:29,883 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 417 predicate places. [2022-12-13 13:39:29,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:29,883 INFO L89 Accepts]: Start accepts. Operand has 438 places, 1106 transitions, 37019 flow [2022-12-13 13:39:29,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:29,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:29,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 438 places, 1106 transitions, 37019 flow [2022-12-13 13:39:29,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 1106 transitions, 37019 flow [2022-12-13 13:39:30,791 INFO L130 PetriNetUnfolder]: 1068/3200 cut-off events. [2022-12-13 13:39:30,792 INFO L131 PetriNetUnfolder]: For 148982/149219 co-relation queries the response was YES. [2022-12-13 13:39:30,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39629 conditions, 3200 events. 1068/3200 cut-off events. For 148982/149219 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 32197 event pairs, 5 based on Foata normal form. 54/3253 useless extension candidates. Maximal degree in co-relation 39256. Up to 1453 conditions per place. [2022-12-13 13:39:30,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 1106 transitions, 37019 flow [2022-12-13 13:39:30,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 3722 [2022-12-13 13:39:30,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:39:31,017 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-13 13:39:31,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:39:31,259 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-13 13:39:31,353 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-13 13:39:31,453 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-13 13:39:31,552 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:39:31,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1669 [2022-12-13 13:39:31,553 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1101 transitions, 37014 flow [2022-12-13 13:39:31,553 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-13 13:39:31,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:31,553 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:31,559 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-13 13:39:31,755 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,SelfDestructingSolverStorable117 [2022-12-13 13:39:31,755 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-13 13:39:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1904615044, now seen corresponding path program 1 times [2022-12-13 13:39:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171737016] [2022-12-13 13:39:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:32,870 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-13 13:39:32,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:32,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171737016] [2022-12-13 13:39:32,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171737016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:32,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007760052] [2022-12-13 13:39:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:32,872 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-13 13:39:32,872 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-13 13:39:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:33,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 13:39:33,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:33,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:39:33,175 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-13 13:39:33,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:33,286 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-13 13:39:33,329 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-13 13:39:33,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:33,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:33,534 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 253 treesize of output 286 [2022-12-13 13:39:33,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:33,561 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 154 treesize of output 173 [2022-12-13 13:39:34,695 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-13 13:39:34,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007760052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:34,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:34,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 13:39:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382170396] [2022-12-13 13:39:34,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:34,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:39:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:39:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:39:34,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 79 [2022-12-13 13:39:34,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1101 transitions, 37014 flow. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-13 13:39:34,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:34,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 79 [2022-12-13 13:39:34,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:39,989 INFO L130 PetriNetUnfolder]: 4530/8618 cut-off events. [2022-12-13 13:39:39,989 INFO L131 PetriNetUnfolder]: For 472230/472398 co-relation queries the response was YES. [2022-12-13 13:39:40,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113413 conditions, 8618 events. 4530/8618 cut-off events. For 472230/472398 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 70870 event pairs, 301 based on Foata normal form. 78/8696 useless extension candidates. Maximal degree in co-relation 112584. Up to 4298 conditions per place. [2022-12-13 13:39:40,130 INFO L137 encePairwiseOnDemand]: 19/79 looper letters, 614 selfloop transitions, 625 changer transitions 21/1261 dead transitions. [2022-12-13 13:39:40,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1261 transitions, 42831 flow [2022-12-13 13:39:40,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:39:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 13:39:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 232 transitions. [2022-12-13 13:39:40,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10488245931283906 [2022-12-13 13:39:40,131 INFO L175 Difference]: Start difference. First operand has 430 places, 1101 transitions, 37014 flow. Second operand 28 states and 232 transitions. [2022-12-13 13:39:40,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1261 transitions, 42831 flow [2022-12-13 13:39:43,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 1261 transitions, 42456 flow, removed 160 selfloop flow, removed 9 redundant places. [2022-12-13 13:39:43,979 INFO L231 Difference]: Finished difference. Result has 458 places, 1181 transitions, 41014 flow [2022-12-13 13:39:43,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=36679, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=549, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=41014, PETRI_PLACES=458, PETRI_TRANSITIONS=1181} [2022-12-13 13:39:43,980 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 437 predicate places. [2022-12-13 13:39:43,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:43,980 INFO L89 Accepts]: Start accepts. Operand has 458 places, 1181 transitions, 41014 flow [2022-12-13 13:39:43,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:43,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:43,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 1181 transitions, 41014 flow [2022-12-13 13:39:44,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 454 places, 1181 transitions, 41014 flow [2022-12-13 13:39:45,167 INFO L130 PetriNetUnfolder]: 1061/3315 cut-off events. [2022-12-13 13:39:45,168 INFO L131 PetriNetUnfolder]: For 171804/172039 co-relation queries the response was YES. [2022-12-13 13:39:45,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42975 conditions, 3315 events. 1061/3315 cut-off events. For 171804/172039 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 34194 event pairs, 6 based on Foata normal form. 54/3368 useless extension candidates. Maximal degree in co-relation 42735. Up to 1493 conditions per place. [2022-12-13 13:39:45,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 1181 transitions, 41014 flow [2022-12-13 13:39:45,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 3952 [2022-12-13 13:39:45,259 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:45,259 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:45,393 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:45,393 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:39:45,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 [907] L65-2-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_987| v_~q~0.base_682))) (let ((.cse1 (select .cse0 (+ (* v_~q_front~0_1435 4) v_~q~0.offset_681)))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_841| 0)) (= (select .cse0 (+ (* v_~q_front~0_1433 4) (- 4) v_~q~0.offset_681)) |v_thread2Thread1of1ForFork1_~j~0#1_918|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_189| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_841| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_841|) (not (= .cse1 0)) (not (= (ite (and (< v_~q_front~0_1435 v_~q_back~0_1540) (<= 0 v_~q_front~0_1435) (< v_~q_front~0_1435 v_~n~0_673)) 1 0) 0)) (= (+ .cse1 v_~s~0_1409 |v_thread2Thread1of1ForFork1_~j~0#1_918|) v_~s~0_1407) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_841| (ite (and (<= 1 v_~q_front~0_1433) (< v_~q_front~0_1433 (+ v_~q_back~0_1540 1)) (< v_~q_front~0_1433 (+ v_~n~0_673 1))) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_918| 0) (= (+ v_~q_front~0_1435 2) v_~q_front~0_1433) (= |v_thread2Thread1of1ForFork1_#res#1.base_189| 0)))) InVars {~q_back~0=v_~q_back~0_1540, #memory_int=|v_#memory_int_987|, ~q~0.base=v_~q~0.base_682, ~n~0=v_~n~0_673, ~q~0.offset=v_~q~0.offset_681, ~s~0=v_~s~0_1409, ~q_front~0=v_~q_front~0_1435} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_918|, ~q_back~0=v_~q_back~0_1540, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_189|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_841|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_841|, ~q~0.base=v_~q~0.base_682, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_841|, ~q~0.offset=v_~q~0.offset_681, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_841|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_189|, #memory_int=|v_#memory_int_987|, ~n~0=v_~n~0_673, ~s~0=v_~s~0_1407, ~q_front~0=v_~q_front~0_1433} 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-13 13:39:45,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 [905] L65-2-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_985| v_~q~0.base_680))) (let ((.cse0 (select .cse1 (+ (* v_~q_front~0_1429 4) v_~q~0.offset_679)))) (and (= (+ .cse0 v_~s~0_1403 |v_thread2Thread1of1ForFork1_~j~0#1_914|) v_~s~0_1401) (= |v_thread2Thread1of1ForFork1_#res#1.offset_187| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_837| (ite (and (< v_~q_front~0_1427 (+ v_~n~0_671 1)) (<= 1 v_~q_front~0_1427) (< v_~q_front~0_1427 (+ v_~q_back~0_1538 1))) 1 0)) (not (= (ite (and (< v_~q_front~0_1429 v_~n~0_671) (<= 0 v_~q_front~0_1429) (< v_~q_front~0_1429 v_~q_back~0_1538)) 1 0) 0)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_837| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_837|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_837| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_914| 0) (= (select .cse1 (+ (* v_~q_front~0_1427 4) (- 4) v_~q~0.offset_679)) |v_thread2Thread1of1ForFork1_~j~0#1_914|) (= |v_thread2Thread1of1ForFork1_#res#1.base_187| 0) (= v_~q_front~0_1427 (+ v_~q_front~0_1429 2))))) InVars {~q_back~0=v_~q_back~0_1538, #memory_int=|v_#memory_int_985|, ~q~0.base=v_~q~0.base_680, ~n~0=v_~n~0_671, ~q~0.offset=v_~q~0.offset_679, ~s~0=v_~s~0_1403, ~q_front~0=v_~q_front~0_1429} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_914|, ~q_back~0=v_~q_back~0_1538, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_187|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_837|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_837|, ~q~0.base=v_~q~0.base_680, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_837|, ~q~0.offset=v_~q~0.offset_679, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_837|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_187|, #memory_int=|v_#memory_int_985|, ~n~0=v_~n~0_671, ~s~0=v_~s~0_1401, ~q_front~0=v_~q_front~0_1427} 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-13 13:39:46,027 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:39:46,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2047 [2022-12-13 13:39:46,027 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1177 transitions, 40946 flow [2022-12-13 13:39:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-13 13:39:46,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:46,028 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:46,033 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-13 13:39:46,228 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,SelfDestructingSolverStorable118 [2022-12-13 13:39:46,228 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-13 13:39:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1519737324, now seen corresponding path program 1 times [2022-12-13 13:39:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:46,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969723630] [2022-12-13 13:39:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:47,522 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-13 13:39:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969723630] [2022-12-13 13:39:47,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969723630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061965773] [2022-12-13 13:39:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:47,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:47,524 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-13 13:39:47,524 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-13 13:39:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:47,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 13:39:47,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:39:47,821 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-13 13:39:47,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:47,977 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-13 13:39:47,999 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-13 13:39:47,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:48,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:48,160 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 222 treesize of output 264 [2022-12-13 13:39:48,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:48,186 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 140 treesize of output 166 [2022-12-13 13:39:49,116 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-13 13:39:49,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061965773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:49,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:49,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:39:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066883397] [2022-12-13 13:39:49,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:49,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:39:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:39:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:39:49,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 81 [2022-12-13 13:39:49,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1177 transitions, 40946 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-13 13:39:49,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:49,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 81 [2022-12-13 13:39:49,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:54,384 INFO L130 PetriNetUnfolder]: 4487/8526 cut-off events. [2022-12-13 13:39:54,385 INFO L131 PetriNetUnfolder]: For 538471/538682 co-relation queries the response was YES. [2022-12-13 13:39:54,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116640 conditions, 8526 events. 4487/8526 cut-off events. For 538471/538682 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 69938 event pairs, 1559 based on Foata normal form. 21/8547 useless extension candidates. Maximal degree in co-relation 116330. Up to 8240 conditions per place. [2022-12-13 13:39:54,537 INFO L137 encePairwiseOnDemand]: 47/81 looper letters, 1116 selfloop transitions, 94 changer transitions 4/1215 dead transitions. [2022-12-13 13:39:54,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 1215 transitions, 43742 flow [2022-12-13 13:39:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:39:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:39:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2022-12-13 13:39:54,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13756613756613756 [2022-12-13 13:39:54,538 INFO L175 Difference]: Start difference. First operand has 450 places, 1177 transitions, 40946 flow. Second operand 14 states and 156 transitions. [2022-12-13 13:39:54,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 1215 transitions, 43742 flow [2022-12-13 13:39:59,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1215 transitions, 42689 flow, removed 448 selfloop flow, removed 12 redundant places. [2022-12-13 13:40:00,012 INFO L231 Difference]: Finished difference. Result has 454 places, 1181 transitions, 40236 flow [2022-12-13 13:40:00,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=39893, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1083, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=40236, PETRI_PLACES=454, PETRI_TRANSITIONS=1181} [2022-12-13 13:40:00,013 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 433 predicate places. [2022-12-13 13:40:00,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:00,013 INFO L89 Accepts]: Start accepts. Operand has 454 places, 1181 transitions, 40236 flow [2022-12-13 13:40:00,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:00,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:00,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 1181 transitions, 40236 flow [2022-12-13 13:40:00,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 454 places, 1181 transitions, 40236 flow [2022-12-13 13:40:01,134 INFO L130 PetriNetUnfolder]: 1061/3315 cut-off events. [2022-12-13 13:40:01,134 INFO L131 PetriNetUnfolder]: For 160325/160560 co-relation queries the response was YES. [2022-12-13 13:40:01,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41637 conditions, 3315 events. 1061/3315 cut-off events. For 160325/160560 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34206 event pairs, 6 based on Foata normal form. 54/3368 useless extension candidates. Maximal degree in co-relation 41226. Up to 1495 conditions per place. [2022-12-13 13:40:01,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 1181 transitions, 40236 flow [2022-12-13 13:40:01,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 3944 [2022-12-13 13:40:01,217 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:40:01,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1205 [2022-12-13 13:40:01,219 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 1181 transitions, 40236 flow [2022-12-13 13:40:01,219 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-13 13:40:01,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:01,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:01,227 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-13 13:40:01,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:01,419 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-13 13:40:01,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1075680868, now seen corresponding path program 1 times [2022-12-13 13:40:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:01,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442289492] [2022-12-13 13:40:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:02,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-13 13:40:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442289492] [2022-12-13 13:40:02,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442289492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030726145] [2022-12-13 13:40:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:02,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:02,845 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-13 13:40:02,846 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-13 13:40:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:03,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 13:40:03,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:03,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:40:03,175 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-13 13:40:03,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:03,285 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-13 13:40:03,308 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-13 13:40:03,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:03,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:03,469 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-13 13:40:03,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:03,494 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-13 13:40:04,306 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-13 13:40:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030726145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:04,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:04,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 13:40:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871702192] [2022-12-13 13:40:04,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:04,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:40:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:40:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:40:04,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 81 [2022-12-13 13:40:04,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 1181 transitions, 40236 flow. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 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-13 13:40:04,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:04,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 81 [2022-12-13 13:40:04,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:09,482 INFO L130 PetriNetUnfolder]: 4487/8522 cut-off events. [2022-12-13 13:40:09,482 INFO L131 PetriNetUnfolder]: For 489733/489890 co-relation queries the response was YES. [2022-12-13 13:40:09,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112516 conditions, 8522 events. 4487/8522 cut-off events. For 489733/489890 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 69903 event pairs, 370 based on Foata normal form. 74/8596 useless extension candidates. Maximal degree in co-relation 111664. Up to 4265 conditions per place. [2022-12-13 13:40:09,628 INFO L137 encePairwiseOnDemand]: 19/81 looper letters, 599 selfloop transitions, 616 changer transitions 10/1226 dead transitions. [2022-12-13 13:40:09,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1226 transitions, 43089 flow [2022-12-13 13:40:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:40:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:40:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 182 transitions. [2022-12-13 13:40:09,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12482853223593965 [2022-12-13 13:40:09,630 INFO L175 Difference]: Start difference. First operand has 454 places, 1181 transitions, 40236 flow. Second operand 18 states and 182 transitions. [2022-12-13 13:40:09,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 1226 transitions, 43089 flow [2022-12-13 13:40:13,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1226 transitions, 42856 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-12-13 13:40:13,767 INFO L231 Difference]: Finished difference. Result has 462 places, 1177 transitions, 41160 flow [2022-12-13 13:40:13,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=39989, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=616, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=41160, PETRI_PLACES=462, PETRI_TRANSITIONS=1177} [2022-12-13 13:40:13,768 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 441 predicate places. [2022-12-13 13:40:13,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:13,768 INFO L89 Accepts]: Start accepts. Operand has 462 places, 1177 transitions, 41160 flow [2022-12-13 13:40:13,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:13,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:13,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 462 places, 1177 transitions, 41160 flow [2022-12-13 13:40:13,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 1177 transitions, 41160 flow [2022-12-13 13:40:14,835 INFO L130 PetriNetUnfolder]: 1061/3305 cut-off events. [2022-12-13 13:40:14,836 INFO L131 PetriNetUnfolder]: For 164636/164855 co-relation queries the response was YES. [2022-12-13 13:40:14,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42620 conditions, 3305 events. 1061/3305 cut-off events. For 164636/164855 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34069 event pairs, 6 based on Foata normal form. 54/3358 useless extension candidates. Maximal degree in co-relation 42201. Up to 1493 conditions per place. [2022-12-13 13:40:14,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 460 places, 1177 transitions, 41160 flow [2022-12-13 13:40:14,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 3940 [2022-12-13 13:40:14,914 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-13 13:40:15,012 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:15,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1244 [2022-12-13 13:40:15,012 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 1176 transitions, 41138 flow [2022-12-13 13:40:15,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 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-13 13:40:15,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:15,012 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:15,018 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-13 13:40:15,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:15,213 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-13 13:40:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 233498445, now seen corresponding path program 1 times [2022-12-13 13:40:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:15,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038061881] [2022-12-13 13:40:15,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,204 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-13 13:40:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038061881] [2022-12-13 13:40:16,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038061881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061671989] [2022-12-13 13:40:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:16,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:16,206 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-13 13:40:16,252 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-13 13:40:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 13:40:16,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:16,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:40:16,551 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-13 13:40:16,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:16,698 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-13 13:40:16,717 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-13 13:40:16,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:16,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:16,910 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 286 treesize of output 311 [2022-12-13 13:40:16,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:16,936 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 171 treesize of output 184 [2022-12-13 13:40:18,596 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-13 13:40:18,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061671989] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:18,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:18,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:40:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391147732] [2022-12-13 13:40:18,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:18,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:40:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:40:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:40:18,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 80 [2022-12-13 13:40:18,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1176 transitions, 41138 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-13 13:40:18,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:18,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 80 [2022-12-13 13:40:18,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:23,403 INFO L130 PetriNetUnfolder]: 4505/8552 cut-off events. [2022-12-13 13:40:23,403 INFO L131 PetriNetUnfolder]: For 514604/514644 co-relation queries the response was YES. [2022-12-13 13:40:23,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116188 conditions, 8552 events. 4505/8552 cut-off events. For 514604/514644 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 70103 event pairs, 1244 based on Foata normal form. 35/8587 useless extension candidates. Maximal degree in co-relation 115310. Up to 8395 conditions per place. [2022-12-13 13:40:23,559 INFO L137 encePairwiseOnDemand]: 49/80 looper letters, 1164 selfloop transitions, 52 changer transitions 4/1221 dead transitions. [2022-12-13 13:40:23,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1221 transitions, 44129 flow [2022-12-13 13:40:23,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:40:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:40:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-12-13 13:40:23,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1451923076923077 [2022-12-13 13:40:23,561 INFO L175 Difference]: Start difference. First operand has 459 places, 1176 transitions, 41138 flow. Second operand 13 states and 151 transitions. [2022-12-13 13:40:23,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1221 transitions, 44129 flow [2022-12-13 13:40:28,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1221 transitions, 43643 flow, removed 13 selfloop flow, removed 12 redundant places. [2022-12-13 13:40:28,277 INFO L231 Difference]: Finished difference. Result has 466 places, 1184 transitions, 41090 flow [2022-12-13 13:40:28,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=40654, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=41090, PETRI_PLACES=466, PETRI_TRANSITIONS=1184} [2022-12-13 13:40:28,277 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 445 predicate places. [2022-12-13 13:40:28,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:28,278 INFO L89 Accepts]: Start accepts. Operand has 466 places, 1184 transitions, 41090 flow [2022-12-13 13:40:28,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:28,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:28,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 466 places, 1184 transitions, 41090 flow [2022-12-13 13:40:28,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 1184 transitions, 41090 flow [2022-12-13 13:40:29,454 INFO L130 PetriNetUnfolder]: 1061/3315 cut-off events. [2022-12-13 13:40:29,454 INFO L131 PetriNetUnfolder]: For 162867/163116 co-relation queries the response was YES. [2022-12-13 13:40:29,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42697 conditions, 3315 events. 1061/3315 cut-off events. For 162867/163116 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 34203 event pairs, 6 based on Foata normal form. 63/3377 useless extension candidates. Maximal degree in co-relation 42352. Up to 1499 conditions per place. [2022-12-13 13:40:29,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 466 places, 1184 transitions, 41090 flow [2022-12-13 13:40:29,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 3982 [2022-12-13 13:40:29,532 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:29,532 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:29,612 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:29,612 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:29,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [878] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_910| v_~q~0.base_638))) (let ((.cse2 (select .cse0 (+ (* v_~q_front~0_1307 4) v_~q~0.offset_637))) (.cse1 (* v_~q_back~0_1405 4))) (and (not (= (ite (= (select .cse0 (+ 16 .cse1 v_~q~0.offset_637)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_274| 0) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_637)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_637)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_1307 (+ v_~q_back~0_1405 1)) (<= 0 v_~q_front~0_1307) (< v_~q_front~0_1307 v_~n~0_629)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_758| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_808| 5) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_637)) 1) 1 0) 0)) (= v_~q_front~0_1306 (+ v_~q_front~0_1307 2)) (= (+ .cse2 v_~s~0_1278 |v_thread2Thread1of1ForFork1_~j~0#1_828|) v_~s~0_1277) (= |v_thread1Thread1of1ForFork0_#res#1.offset_274| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_760| (ite (and (<= 1 v_~q_front~0_1306) (< v_~q_front~0_1306 (+ v_~n~0_629 1)) (< v_~q_front~0_1306 (+ 3 v_~q_back~0_1405))) 1 0)) (< 4 v_~N~0_505) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_808| v_~N~0_505)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_758| (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_637)) 0) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_758| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_758|) (= (+ 6 v_~q_back~0_1405) v_~q_back~0_1403) (= |v_thread2Thread1of1ForFork1_~j~0#1_828| (select .cse0 (+ (* v_~q_front~0_1306 4) (- 4) v_~q~0.offset_637))) (not (= .cse2 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_828| 0)) (not (= (ite (let ((.cse3 (+ 5 v_~q_back~0_1405))) (and (< .cse3 v_~n~0_629) (<= 0 .cse3))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_760| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_760|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_637 4)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1405, #memory_int=|v_#memory_int_910|, ~N~0=v_~N~0_505, ~q~0.base=v_~q~0.base_638, ~n~0=v_~n~0_629, ~q~0.offset=v_~q~0.offset_637, ~s~0=v_~s~0_1278, ~q_front~0=v_~q_front~0_1307} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_828|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_274|, ~q_back~0=v_~q_back~0_1403, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_292|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_760|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_558|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_760|, ~N~0=v_~N~0_505, ~q~0.base=v_~q~0.base_638, ~q~0.offset=v_~q~0.offset_637, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_760|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_760|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_758|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_562|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_558|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_808|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_758|, #memory_int=|v_#memory_int_910|, ~n~0=v_~n~0_629, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_274|, ~s~0=v_~s~0_1277, ~q_front~0=v_~q_front~0_1306} 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-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,331 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:30,332 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:31,115 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:31,116 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:31,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_914| v_~q~0.base_642))) (let ((.cse3 (select .cse1 (+ (* v_~q_front~0_1317 4) v_~q~0.offset_641))) (.cse2 (* v_~q_back~0_1415 4))) (and (not (= (ite (let ((.cse0 (+ 5 v_~q_back~0_1415))) (and (<= 0 .cse0) (< .cse0 v_~n~0_633))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_812| 6) (= (ite (= (select .cse1 (+ 20 v_~q~0.offset_641 .cse2)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764| 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_641 .cse2)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764|) (< |v_thread1Thread1of1ForFork0_~i~0#1_812| (+ v_~N~0_509 1)) (= v_~s~0_1287 (+ .cse3 v_~s~0_1288 |v_thread2Thread1of1ForFork1_~j~0#1_834|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_766| (ite (and (< v_~q_front~0_1316 (+ v_~n~0_633 1)) (< v_~q_front~0_1316 (+ 3 v_~q_back~0_1415)) (<= 1 v_~q_front~0_1316)) 1 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_641 .cse2 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_1317 (+ v_~q_back~0_1415 1)) (<= 0 v_~q_front~0_1317) (< v_~q_front~0_1317 v_~n~0_633)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ 8 v_~q~0.offset_641 .cse2)) 1) 1 0) 0)) (= (select .cse1 (+ (- 4) v_~q~0.offset_641 (* v_~q_front~0_1316 4))) |v_thread2Thread1of1ForFork1_~j~0#1_834|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_834| 0)) (= (+ 6 v_~q_back~0_1415) v_~q_back~0_1413) (not (= (ite (= (select .cse1 (+ 12 v_~q~0.offset_641 .cse2)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_766| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_766|) (not (= .cse3 0)) (not (= (ite (= (select .cse1 (+ 16 v_~q~0.offset_641 .cse2)) 1) 1 0) 0)) (= v_~q_front~0_1316 (+ v_~q_front~0_1317 2))))) InVars {~q_back~0=v_~q_back~0_1415, #memory_int=|v_#memory_int_914|, ~N~0=v_~N~0_509, ~q~0.base=v_~q~0.base_642, ~n~0=v_~n~0_633, ~q~0.offset=v_~q~0.offset_641, ~s~0=v_~s~0_1288, ~q_front~0=v_~q_front~0_1317} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_834|, ~q_back~0=v_~q_back~0_1413, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_766|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_562|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_766|, ~N~0=v_~N~0_509, ~q~0.base=v_~q~0.base_642, ~q~0.offset=v_~q~0.offset_641, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_766|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_766|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_566|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_562|, 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_764|, #memory_int=|v_#memory_int_914|, ~n~0=v_~n~0_633, ~s~0=v_~s~0_1287, ~q_front~0=v_~q_front~0_1316} 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-13 13:40:32,456 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:32,457 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:32,854 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:32,854 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:32,854 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:32,854 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:33,123 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:33,123 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:33,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1015| v_~q~0.base_704)) (.cse1 (* v_~q_back~0_1587 4))) (and (not (= (ite (and (<= 1 v_~q_back~0_1587) (< v_~q_back~0_1587 (+ v_~n~0_695 1))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_322| 0) (= (+ v_~q_back~0_1589 4) v_~q_back~0_1587) (= |v_ULTIMATE.start_main_#t~pre14#1_301| |v_#pthreadsForks_326|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_871| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_871|) (not (= (ite (and (<= 0 v_~q_back~0_1589) (< v_~q_back~0_1589 v_~n~0_695)) 1 0) 0)) (= (store |v_#memory_int_1016| |v_ULTIMATE.start_main_~#t2~0#1.base_161| (store (select |v_#memory_int_1016| |v_ULTIMATE.start_main_~#t2~0#1.base_161|) |v_ULTIMATE.start_main_~#t2~0#1.offset_155| |v_ULTIMATE.start_main_#t~pre14#1_301|)) |v_#memory_int_1015|) (< |v_thread1Thread1of1ForFork0_~i~0#1_934| (+ v_~N~0_561 1)) (not (= (ite (= (select .cse0 (+ .cse1 (- 12) v_~q~0.offset_703)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_322| 0) (not (= (ite (= (select (select |v_#memory_int_1016| v_~q~0.base_704) (+ (* v_~q_back~0_1589 4) v_~q~0.offset_703)) 1) 1 0) 0)) (= (+ |v_#pthreadsForks_326| 1) |v_#pthreadsForks_325|) (= |v_thread1Thread1of1ForFork0_~i~0#1_934| 3) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_934| v_~N~0_561)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_703 (- 8))) 1) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 (- 4) v_~q~0.offset_703)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_871|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_871| 0)))) InVars {~q_back~0=v_~q_back~0_1589, #pthreadsForks=|v_#pthreadsForks_326|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_155|, #memory_int=|v_#memory_int_1016|, ~N~0=v_~N~0_561, ~q~0.base=v_~q~0.base_704, ~n~0=v_~n~0_695, ~q~0.offset=v_~q~0.offset_703, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_161|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_322|, ~q_back~0=v_~q_back~0_1587, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_340|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_155|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_641|, ~N~0=v_~N~0_561, ~q~0.base=v_~q~0.base_704, ~q~0.offset=v_~q~0.offset_703, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_871|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_263|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_645|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_301|, #pthreadsForks=|v_#pthreadsForks_325|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_641|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_934|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_340|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_871|, #memory_int=|v_#memory_int_1015|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_221|, ~n~0=v_~n~0_695, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_161|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_#t~post1#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#res#1.base] and [927] L65-2-->L65-2: Formula: (let ((.cse3 (select |v_#memory_int_1023| v_~q~0.base_708)) (.cse4 (* v_~q_front~0_1514 4))) (let ((.cse1 (select .cse3 (+ v_~q~0.offset_707 .cse4))) (.cse0 (select .cse3 (+ v_~q~0.offset_707 4 .cse4))) (.cse5 (select .cse3 (+ 8 v_~q~0.offset_707 .cse4)))) (and (not (= .cse0 0)) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893| 0)) (not (= (ite (and (<= 0 v_~q_front~0_1514) (< v_~q_front~0_1514 v_~n~0_699) (< v_~q_front~0_1514 v_~q_back~0_1599)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_893| (ite (let ((.cse2 (+ v_~q_front~0_1514 3))) (and (<= 0 .cse2) (< .cse2 v_~q_back~0_1599) (< .cse2 v_~n~0_699))) 1 0)) (= (select .cse3 (+ 12 v_~q~0.offset_707 .cse4)) |v_thread2Thread1of1ForFork1_~j~0#1_973|) (= v_~q_front~0_1512 (+ v_~q_front~0_1514 4)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_973| 0)) (not (= .cse5 0)) (= v_~s~0_1489 (+ .cse1 .cse0 .cse5 v_~s~0_1491 |v_thread2Thread1of1ForFork1_~j~0#1_973|))))) InVars {~q_back~0=v_~q_back~0_1599, #memory_int=|v_#memory_int_1023|, ~q~0.base=v_~q~0.base_708, ~n~0=v_~n~0_699, ~q~0.offset=v_~q~0.offset_707, ~s~0=v_~s~0_1491, ~q_front~0=v_~q_front~0_1514} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_893|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_973|, ~q_back~0=v_~q_back~0_1599, #memory_int=|v_#memory_int_1023|, 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|, ~q~0.base=v_~q~0.base_708, ~n~0=v_~n~0_699, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_893|, ~q~0.offset=v_~q~0.offset_707, ~s~0=v_~s~0_1489, ~q_front~0=v_~q_front~0_1512} 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-13 13:40:34,102 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,102 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,102 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,102 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1011| v_~q~0.base_700))) (let ((.cse2 (* v_~q_back~0_1582 4)) (.cse4 (* v_~q_front~0_1500 4)) (.cse3 (select .cse1 (+ (* v_~q_front~0_1502 4) v_~q~0.offset_699)))) (and (= (+ 6 v_~q_back~0_1582) v_~q_back~0_1581) (not (= (ite (let ((.cse0 (+ 5 v_~q_back~0_1582))) (and (< .cse0 v_~n~0_691) (<= 0 .cse0))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_699 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_869| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_869|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_885| (ite (and (< v_~q_front~0_1500 (+ v_~q_back~0_1581 1)) (< v_~q_front~0_1500 (+ v_~n~0_691 1)) (<= 1 v_~q_front~0_1500)) 1 0)) (not (= (ite (= (select .cse1 (+ 16 .cse2 v_~q~0.offset_699)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_699)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_869| (ite (= (select .cse1 (+ .cse2 20 v_~q~0.offset_699)) 1) 1 0)) (= (+ .cse3 (select .cse1 (+ .cse4 v_~q~0.offset_699 (- 8))) v_~s~0_1479 |v_thread2Thread1of1ForFork1_~j~0#1_965|) v_~s~0_1477) (not (= v_~s~0_1477 (+ .cse3 v_~s~0_1479 |v_thread2Thread1of1ForFork1_~j~0#1_965|))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_965| 0)) (not (= (ite (and (< v_~q_front~0_1502 v_~n~0_691) (<= 0 v_~q_front~0_1502) (< v_~q_front~0_1502 (+ v_~q_back~0_1582 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_869| 0)) (= v_~q_front~0_1500 (+ v_~q_front~0_1502 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_885| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_885|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_699)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_932| (+ v_~N~0_559 1)) (not (= (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_699)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_932| 6) (= (select .cse1 (+ (- 4) .cse4 v_~q~0.offset_699)) |v_thread2Thread1of1ForFork1_~j~0#1_965|) (not (= .cse3 0))))) InVars {~q_back~0=v_~q_back~0_1582, #memory_int=|v_#memory_int_1011|, ~N~0=v_~N~0_559, ~q~0.base=v_~q~0.base_700, ~n~0=v_~n~0_691, ~q~0.offset=v_~q~0.offset_699, ~s~0=v_~s~0_1479, ~q_front~0=v_~q_front~0_1502} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_965|, ~q_back~0=v_~q_back~0_1581, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_885|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_885|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_639|, ~N~0=v_~N~0_559, ~q~0.base=v_~q~0.base_700, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_885|, ~q~0.offset=v_~q~0.offset_699, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_885|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_869|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_643|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_639|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_932|, #memory_int=|v_#memory_int_1011|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_869|, ~n~0=v_~n~0_691, ~s~0=v_~s~0_1477, ~q_front~0=v_~q_front~0_1500} 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 [898] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_971| v_~q~0.base_668))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_820| 0)) (= (+ v_~s~0_1370 |v_thread2Thread1of1ForFork1_~j~0#1_896|) v_~s~0_1369) (= (+ v_~q_front~0_1398 1) v_~q_front~0_1397) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_896| 0)) (not (= (ite (and (<= 0 v_~q_back~0_1511) (< v_~q_back~0_1511 v_~n~0_659)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_830| 0)) (= (select .cse0 (+ (* v_~q_front~0_1398 4) v_~q~0.offset_667)) |v_thread2Thread1of1ForFork1_~j~0#1_896|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_820| (ite (and (< v_~q_front~0_1398 v_~q_back~0_1510) (<= 0 v_~q_front~0_1398) (< v_~q_front~0_1398 v_~n~0_659)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_830| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_830|) (= (ite (= (select .cse0 (+ v_~q~0.offset_667 (* v_~q_back~0_1511 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_830|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_300| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_820| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_820|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_884| v_~N~0_535)) (= |v_thread1Thread1of1ForFork0_#res#1.base_300| 0) (= v_~q_back~0_1510 (+ v_~q_back~0_1511 1)))) InVars {~q_back~0=v_~q_back~0_1511, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_884|, #memory_int=|v_#memory_int_971|, ~N~0=v_~N~0_535, ~q~0.base=v_~q~0.base_668, ~n~0=v_~n~0_659, ~q~0.offset=v_~q~0.offset_667, ~s~0=v_~s~0_1370, ~q_front~0=v_~q_front~0_1398} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_896|, ~q_back~0=v_~q_back~0_1510, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_300|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_318|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_820|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_820|, ~N~0=v_~N~0_535, ~q~0.base=v_~q~0.base_668, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_820|, ~q~0.offset=v_~q~0.offset_667, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_820|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_830|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_884|, #memory_int=|v_#memory_int_971|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_318|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_830|, ~n~0=v_~n~0_659, ~s~0=v_~s~0_1369, ~q_front~0=v_~q_front~0_1397, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_300|} 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-13 13:40:34,646 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,646 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,646 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,646 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,646 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:34,647 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:35,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1011| v_~q~0.base_700))) (let ((.cse2 (* v_~q_back~0_1582 4)) (.cse4 (* v_~q_front~0_1500 4)) (.cse3 (select .cse1 (+ (* v_~q_front~0_1502 4) v_~q~0.offset_699)))) (and (= (+ 6 v_~q_back~0_1582) v_~q_back~0_1581) (not (= (ite (let ((.cse0 (+ 5 v_~q_back~0_1582))) (and (< .cse0 v_~n~0_691) (<= 0 .cse0))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_699 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_869| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_869|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_885| (ite (and (< v_~q_front~0_1500 (+ v_~q_back~0_1581 1)) (< v_~q_front~0_1500 (+ v_~n~0_691 1)) (<= 1 v_~q_front~0_1500)) 1 0)) (not (= (ite (= (select .cse1 (+ 16 .cse2 v_~q~0.offset_699)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_699)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_869| (ite (= (select .cse1 (+ .cse2 20 v_~q~0.offset_699)) 1) 1 0)) (= (+ .cse3 (select .cse1 (+ .cse4 v_~q~0.offset_699 (- 8))) v_~s~0_1479 |v_thread2Thread1of1ForFork1_~j~0#1_965|) v_~s~0_1477) (not (= v_~s~0_1477 (+ .cse3 v_~s~0_1479 |v_thread2Thread1of1ForFork1_~j~0#1_965|))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_965| 0)) (not (= (ite (and (< v_~q_front~0_1502 v_~n~0_691) (<= 0 v_~q_front~0_1502) (< v_~q_front~0_1502 (+ v_~q_back~0_1582 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_869| 0)) (= v_~q_front~0_1500 (+ v_~q_front~0_1502 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_885| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_885|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_699)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_932| (+ v_~N~0_559 1)) (not (= (ite (= (select .cse1 (+ .cse2 12 v_~q~0.offset_699)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_932| 6) (= (select .cse1 (+ (- 4) .cse4 v_~q~0.offset_699)) |v_thread2Thread1of1ForFork1_~j~0#1_965|) (not (= .cse3 0))))) InVars {~q_back~0=v_~q_back~0_1582, #memory_int=|v_#memory_int_1011|, ~N~0=v_~N~0_559, ~q~0.base=v_~q~0.base_700, ~n~0=v_~n~0_691, ~q~0.offset=v_~q~0.offset_699, ~s~0=v_~s~0_1479, ~q_front~0=v_~q_front~0_1502} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_965|, ~q_back~0=v_~q_back~0_1581, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_885|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_885|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_639|, ~N~0=v_~N~0_559, ~q~0.base=v_~q~0.base_700, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_885|, ~q~0.offset=v_~q~0.offset_699, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_885|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_869|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_643|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_639|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_932|, #memory_int=|v_#memory_int_1011|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_869|, ~n~0=v_~n~0_691, ~s~0=v_~s~0_1477, ~q_front~0=v_~q_front~0_1500} 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-13 13:40:35,531 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:35,531 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:35,531 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:35,531 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:35,531 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:35,531 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,142 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,142 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,142 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,142 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,142 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,142 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:36,751 INFO L241 LiptonReduction]: Total number of compositions: 12 [2022-12-13 13:40:36,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8473 [2022-12-13 13:40:36,751 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 1176 transitions, 41264 flow [2022-12-13 13:40:36,752 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-13 13:40:36,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:36,752 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:36,760 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-13 13:40:36,952 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,SelfDestructingSolverStorable121 [2022-12-13 13:40:36,952 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-13 13:40:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1742336484, now seen corresponding path program 2 times [2022-12-13 13:40:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:36,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497721731] [2022-12-13 13:40:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:38,141 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-13 13:40:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497721731] [2022-12-13 13:40:38,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497721731] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020441971] [2022-12-13 13:40:38,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:40:38,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:38,143 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-13 13:40:38,144 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-13 13:40:38,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:40:38,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:40:38,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 13:40:38,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:38,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:40:38,472 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-13 13:40:38,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:38,580 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-13 13:40:38,624 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-13 13:40:38,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:38,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:38,810 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 251 treesize of output 285 [2022-12-13 13:40:38,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:38,837 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 153 treesize of output 173 [2022-12-13 13:40:39,985 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-13 13:40:39,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020441971] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:39,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:39,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2022-12-13 13:40:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374205940] [2022-12-13 13:40:39,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:39,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 13:40:39,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:39,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 13:40:39,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-12-13 13:40:39,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-13 13:40:39,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 1176 transitions, 41264 flow. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:39,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:39,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-13 13:40:39,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:45,596 INFO L130 PetriNetUnfolder]: 4610/8819 cut-off events. [2022-12-13 13:40:45,597 INFO L131 PetriNetUnfolder]: For 544100/544158 co-relation queries the response was YES. [2022-12-13 13:40:45,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120472 conditions, 8819 events. 4610/8819 cut-off events. For 544100/544158 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 73444 event pairs, 1098 based on Foata normal form. 49/8866 useless extension candidates. Maximal degree in co-relation 120049. Up to 7912 conditions per place. [2022-12-13 13:40:45,747 INFO L137 encePairwiseOnDemand]: 23/86 looper letters, 1037 selfloop transitions, 237 changer transitions 21/1296 dead transitions. [2022-12-13 13:40:45,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 1296 transitions, 46528 flow [2022-12-13 13:40:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 13:40:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 13:40:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 233 transitions. [2022-12-13 13:40:45,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10837209302325582 [2022-12-13 13:40:45,749 INFO L175 Difference]: Start difference. First operand has 458 places, 1176 transitions, 41264 flow. Second operand 25 states and 233 transitions. [2022-12-13 13:40:45,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 1296 transitions, 46528 flow [2022-12-13 13:40:51,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 1296 transitions, 45809 flow, removed 65 selfloop flow, removed 10 redundant places. [2022-12-13 13:40:51,184 INFO L231 Difference]: Finished difference. Result has 478 places, 1214 transitions, 42787 flow [2022-12-13 13:40:51,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=40346, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=42787, PETRI_PLACES=478, PETRI_TRANSITIONS=1214} [2022-12-13 13:40:51,185 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 457 predicate places. [2022-12-13 13:40:51,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:51,186 INFO L89 Accepts]: Start accepts. Operand has 478 places, 1214 transitions, 42787 flow [2022-12-13 13:40:51,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:51,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:51,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 1214 transitions, 42787 flow [2022-12-13 13:40:51,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 1214 transitions, 42787 flow [2022-12-13 13:40:52,466 INFO L130 PetriNetUnfolder]: 1072/3385 cut-off events. [2022-12-13 13:40:52,466 INFO L131 PetriNetUnfolder]: For 173326/173500 co-relation queries the response was YES. [2022-12-13 13:40:52,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44210 conditions, 3385 events. 1072/3385 cut-off events. For 173326/173500 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 35279 event pairs, 5 based on Foata normal form. 49/3429 useless extension candidates. Maximal degree in co-relation 43927. Up to 1528 conditions per place. [2022-12-13 13:40:52,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 1214 transitions, 42787 flow [2022-12-13 13:40:52,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 4070 [2022-12-13 13:40:52,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:40:52,741 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:52,742 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:52,742 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:52,742 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:52,742 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:52,742 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [834] L47-4-->L47-4: Formula: (let ((.cse0 (+ v_~n~0_569 1)) (.cse1 (select |v_#memory_int_812| v_~q~0.base_573))) (and (= (+ 2 v_~q_back~0_1233) v_~q_back~0_1231) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_674| 2) |v_thread1Thread1of1ForFork0_~i~0#1_672|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_627| (ite (and (<= 1 v_~q_front~0_1104) (< v_~q_front~0_1104 .cse0) (< v_~q_front~0_1104 v_~q_back~0_1231)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_627| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_627|) (= (select .cse1 (+ (- 4) (* v_~q_front~0_1104 4) v_~q~0.offset_572)) |v_thread2Thread1of1ForFork1_~j~0#1_681|) (not (= (+ v_~s~0_1065 |v_thread2Thread1of1ForFork1_~j~0#1_681|) v_~s~0_1063)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_649| 0)) (not (= (ite (and (< v_~q_back~0_1231 .cse0) (<= 1 v_~q_back~0_1231)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_627| 0)) (= (+ v_~s~0_1065 |v_thread2Thread1of1ForFork1_~j~0#1_681| (select .cse1 (+ (* v_~q_front~0_1106 4) v_~q~0.offset_572))) v_~s~0_1063) (not (= (ite (and (< v_~q_front~0_1106 v_~n~0_569) (<= 0 v_~q_front~0_1106) (< (+ v_~q_front~0_1106 1) v_~q_back~0_1231)) 1 0) 0)) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1231 4) (- 4) v_~q~0.offset_572)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_649|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_674| 1) v_~N~0_455) (not (= (ite (= (select .cse1 (+ (* v_~q_back~0_1233 4) v_~q~0.offset_572)) 1) 1 0) 0)) (= v_~q_front~0_1104 (+ v_~q_front~0_1106 2)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_681| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_649| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_649|))) InVars {~q_back~0=v_~q_back~0_1233, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_674|, #memory_int=|v_#memory_int_812|, ~N~0=v_~N~0_455, ~q~0.base=v_~q~0.base_573, ~n~0=v_~n~0_569, ~q~0.offset=v_~q~0.offset_572, ~s~0=v_~s~0_1065, ~q_front~0=v_~q_front~0_1106} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_681|, ~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_627|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_469|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_627|, ~N~0=v_~N~0_455, ~q~0.base=v_~q~0.base_573, ~q~0.offset=v_~q~0.offset_572, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_627|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_627|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_649|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_473|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_469|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_672|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_649|, #memory_int=|v_#memory_int_812|, ~n~0=v_~n~0_569, ~s~0=v_~s~0_1063, ~q_front~0=v_~q_front~0_1104} 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 [871] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_899| v_~q~0.base_628))) (and (= (+ v_~q_front~0_1278 1) v_~q_front~0_1277) (= (+ v_~s~0_1252 |v_thread2Thread1of1ForFork1_~j~0#1_810|) v_~s~0_1251) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_810| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_783| v_~N~0_495) (= (ite (and (< v_~q_front~0_1278 v_~n~0_619) (< v_~q_front~0_1278 v_~q_back~0_1377) (<= 0 v_~q_front~0_1278)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_743|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_741| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_741|) (= (select .cse0 (+ (* v_~q_front~0_1278 4) v_~q~0.offset_627)) |v_thread2Thread1of1ForFork1_~j~0#1_810|) (= |v_thread1Thread1of1ForFork0_~i~0#1_782| (+ |v_thread1Thread1of1ForFork0_~i~0#1_783| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_741| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_743| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_743| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_743|) (= v_~q_back~0_1376 (+ v_~q_back~0_1377 1)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1377 4) v_~q~0.offset_627)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_741|) (not (= (ite (and (<= 0 v_~q_back~0_1377) (< v_~q_back~0_1377 v_~n~0_619)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1377, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_783|, #memory_int=|v_#memory_int_899|, ~N~0=v_~N~0_495, ~q~0.base=v_~q~0.base_628, ~n~0=v_~n~0_619, ~q~0.offset=v_~q~0.offset_627, ~s~0=v_~s~0_1252, ~q_front~0=v_~q_front~0_1278} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_810|, ~q_back~0=v_~q_back~0_1376, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_743|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_542|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_743|, ~N~0=v_~N~0_495, ~q~0.base=v_~q~0.base_628, ~q~0.offset=v_~q~0.offset_627, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_743|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_743|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_741|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_546|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_542|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_782|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_741|, #memory_int=|v_#memory_int_899|, ~n~0=v_~n~0_619, ~s~0=v_~s~0_1251, ~q_front~0=v_~q_front~0_1277} 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] [2022-12-13 13:40:53,102 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,103 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,103 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,103 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,103 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,103 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,567 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,567 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,568 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,568 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,568 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:53,568 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_841| v_~q~0.base_594)) (.cse2 (* v_~q_front~0_1152 4))) (let ((.cse1 (* v_~q_back~0_1281 4)) (.cse6 (select .cse0 (+ v_~q~0.offset_593 4 .cse2))) (.cse7 (select .cse0 (+ v_~q~0.offset_593 .cse2))) (.cse4 (+ v_~q_front~0_1152 3)) (.cse3 (* v_~q_back~0_1283 4))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_712| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_656|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_681| (ite (= (select .cse0 (+ .cse1 (- 4) v_~q~0.offset_593)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_681| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_681|) (= (select .cse0 (+ 8 v_~q~0.offset_593 .cse2)) |v_thread2Thread1of1ForFork1_~j~0#1_712|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_593 4 .cse3)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656| (ite (let ((.cse5 (+ v_~q_front~0_1152 2))) (and (< .cse4 v_~q_back~0_1281) (<= 0 .cse5) (< .cse5 v_~n~0_587))) 1 0)) (not (= (ite (and (< v_~q_front~0_1152 v_~n~0_587) (<= 0 v_~q_front~0_1152) (< v_~q_front~0_1152 (+ v_~q_back~0_1283 1))) 1 0) 0)) (= (+ v_~q_back~0_1283 4) v_~q_back~0_1281) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_681| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_593 (- 8))) 1) 1 0) 0)) (= (+ .cse6 .cse7 v_~s~0_1114 |v_thread2Thread1of1ForFork1_~j~0#1_712|) v_~s~0_1113) (not (= .cse6 0)) (not (= (ite (and (< v_~q_back~0_1281 (+ v_~n~0_587 1)) (<= 1 v_~q_back~0_1281)) 1 0) 0)) (not (= .cse7 0)) (= .cse4 v_~q_front~0_1151) (= |v_thread1Thread1of1ForFork0_~i~0#1_720| 4) (not (= 0 (ite (= (select .cse0 (+ v_~q~0.offset_593 .cse3)) 1) 1 0))) (< 3 v_~N~0_475)))) InVars {~q_back~0=v_~q_back~0_1283, #memory_int=|v_#memory_int_841|, ~N~0=v_~N~0_475, ~q~0.base=v_~q~0.base_594, ~n~0=v_~n~0_587, ~q~0.offset=v_~q~0.offset_593, ~s~0=v_~s~0_1114, ~q_front~0=v_~q_front~0_1152} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_712|, ~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_656|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_499|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_656|, ~N~0=v_~N~0_475, ~q~0.base=v_~q~0.base_594, ~q~0.offset=v_~q~0.offset_593, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_656|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_656|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_681|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_503|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_499|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_720|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_681|, #memory_int=|v_#memory_int_841|, ~n~0=v_~n~0_587, ~s~0=v_~s~0_1113, ~q_front~0=v_~q_front~0_1151} 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 [876] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_905| v_~q~0.base_634)) (.cse1 (* v_~q_back~0_1392 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_751| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_751|) (= |v_thread1Thread1of1ForFork0_~i~0#1_796| (+ |v_thread1Thread1of1ForFork0_~i~0#1_798| 2)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_818| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_751| (ite (and (< v_~q_front~0_1292 v_~q_back~0_1392) (<= 0 v_~q_front~0_1292) (< v_~q_front~0_1292 v_~n~0_625)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_633)) 1) 1 0) 0)) (= v_~q_front~0_1291 (+ v_~q_front~0_1292 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_751| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749|) (= (select .cse0 (+ (* v_~q_front~0_1292 4) v_~q~0.offset_633)) |v_thread2Thread1of1ForFork1_~j~0#1_818|) (= (+ v_~s~0_1266 |v_thread2Thread1of1ForFork1_~j~0#1_818|) v_~s~0_1265) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1392 1))) (and (< .cse2 v_~n~0_625) (<= 0 .cse2))) 1 0) 0)) (= v_~q_back~0_1390 (+ 2 v_~q_back~0_1392)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_633 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749| 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_798| 1) v_~N~0_501))) InVars {~q_back~0=v_~q_back~0_1392, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_798|, #memory_int=|v_#memory_int_905|, ~N~0=v_~N~0_501, ~q~0.base=v_~q~0.base_634, ~n~0=v_~n~0_625, ~q~0.offset=v_~q~0.offset_633, ~s~0=v_~s~0_1266, ~q_front~0=v_~q_front~0_1292} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_818|, ~q_back~0=v_~q_back~0_1390, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_751|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_550|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_751|, ~N~0=v_~N~0_501, ~q~0.base=v_~q~0.base_634, ~q~0.offset=v_~q~0.offset_633, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_751|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_751|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_554|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_550|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_796|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749|, #memory_int=|v_#memory_int_905|, ~n~0=v_~n~0_625, ~s~0=v_~s~0_1265, ~q_front~0=v_~q_front~0_1291} 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] [2022-12-13 13:40:54,053 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,053 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,053 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,053 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,054 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,054 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_841| v_~q~0.base_594)) (.cse2 (* v_~q_front~0_1152 4))) (let ((.cse1 (* v_~q_back~0_1281 4)) (.cse6 (select .cse0 (+ v_~q~0.offset_593 4 .cse2))) (.cse7 (select .cse0 (+ v_~q~0.offset_593 .cse2))) (.cse4 (+ v_~q_front~0_1152 3)) (.cse3 (* v_~q_back~0_1283 4))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_712| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_656|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_681| (ite (= (select .cse0 (+ .cse1 (- 4) v_~q~0.offset_593)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_681| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_681|) (= (select .cse0 (+ 8 v_~q~0.offset_593 .cse2)) |v_thread2Thread1of1ForFork1_~j~0#1_712|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_593 4 .cse3)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656| (ite (let ((.cse5 (+ v_~q_front~0_1152 2))) (and (< .cse4 v_~q_back~0_1281) (<= 0 .cse5) (< .cse5 v_~n~0_587))) 1 0)) (not (= (ite (and (< v_~q_front~0_1152 v_~n~0_587) (<= 0 v_~q_front~0_1152) (< v_~q_front~0_1152 (+ v_~q_back~0_1283 1))) 1 0) 0)) (= (+ v_~q_back~0_1283 4) v_~q_back~0_1281) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_681| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_593 (- 8))) 1) 1 0) 0)) (= (+ .cse6 .cse7 v_~s~0_1114 |v_thread2Thread1of1ForFork1_~j~0#1_712|) v_~s~0_1113) (not (= .cse6 0)) (not (= (ite (and (< v_~q_back~0_1281 (+ v_~n~0_587 1)) (<= 1 v_~q_back~0_1281)) 1 0) 0)) (not (= .cse7 0)) (= .cse4 v_~q_front~0_1151) (= |v_thread1Thread1of1ForFork0_~i~0#1_720| 4) (not (= 0 (ite (= (select .cse0 (+ v_~q~0.offset_593 .cse3)) 1) 1 0))) (< 3 v_~N~0_475)))) InVars {~q_back~0=v_~q_back~0_1283, #memory_int=|v_#memory_int_841|, ~N~0=v_~N~0_475, ~q~0.base=v_~q~0.base_594, ~n~0=v_~n~0_587, ~q~0.offset=v_~q~0.offset_593, ~s~0=v_~s~0_1114, ~q_front~0=v_~q_front~0_1152} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_712|, ~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_656|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_499|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_656|, ~N~0=v_~N~0_475, ~q~0.base=v_~q~0.base_594, ~q~0.offset=v_~q~0.offset_593, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_656|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_656|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_681|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_503|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_499|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_720|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_681|, #memory_int=|v_#memory_int_841|, ~n~0=v_~n~0_587, ~s~0=v_~s~0_1113, ~q_front~0=v_~q_front~0_1151} 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 [874] L65-2-->L47-4: Formula: (let ((.cse0 (+ v_~n~0_623 1)) (.cse1 (select |v_#memory_int_903| v_~q~0.base_632))) (and (= (+ 2 v_~q_back~0_1386) v_~q_back~0_1384) (= |v_thread1Thread1of1ForFork0_~i~0#1_790| (+ |v_thread1Thread1of1ForFork0_~i~0#1_792| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_745| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_745| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_745|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_747| (ite (and (<= 1 v_~q_front~0_1285) (< v_~q_front~0_1285 v_~q_back~0_1384) (< v_~q_front~0_1285 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_814| (select .cse1 (+ (- 4) v_~q~0.offset_631 (* v_~q_front~0_1285 4)))) (not (= (+ v_~s~0_1261 |v_thread2Thread1of1ForFork1_~j~0#1_814|) v_~s~0_1259)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_745| (ite (= (select .cse1 (+ (- 4) v_~q~0.offset_631 (* v_~q_back~0_1384 4))) 1) 1 0)) (not (= (ite (and (< v_~q_back~0_1384 .cse0) (<= 1 v_~q_back~0_1384)) 1 0) 0)) (= v_~q_front~0_1285 (+ v_~q_front~0_1287 2)) (not (= (ite (= (select .cse1 (+ (* v_~q_back~0_1386 4) v_~q~0.offset_631)) 1) 1 0) 0)) (= v_~s~0_1259 (+ v_~s~0_1261 (select .cse1 (+ (* v_~q_front~0_1287 4) v_~q~0.offset_631)) |v_thread2Thread1of1ForFork1_~j~0#1_814|)) (< |v_thread1Thread1of1ForFork0_~i~0#1_790| (+ v_~N~0_499 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_747| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_747|) (not (= (ite (and (< v_~q_front~0_1287 v_~q_back~0_1386) (<= 0 v_~q_front~0_1287) (< v_~q_front~0_1287 v_~n~0_623)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_814| 0)))) InVars {~q_back~0=v_~q_back~0_1386, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, #memory_int=|v_#memory_int_903|, ~N~0=v_~N~0_499, ~q~0.base=v_~q~0.base_632, ~n~0=v_~n~0_623, ~q~0.offset=v_~q~0.offset_631, ~s~0=v_~s~0_1261, ~q_front~0=v_~q_front~0_1287} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_814|, ~q_back~0=v_~q_back~0_1384, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_747|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_546|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_747|, ~N~0=v_~N~0_499, ~q~0.base=v_~q~0.base_632, ~q~0.offset=v_~q~0.offset_631, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_747|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_747|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_745|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_550|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_546|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_790|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_745|, #memory_int=|v_#memory_int_903|, ~n~0=v_~n~0_623, ~s~0=v_~s~0_1259, ~q_front~0=v_~q_front~0_1285} 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] [2022-12-13 13:40:54,743 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,744 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,744 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,744 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,744 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:54,744 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,519 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,519 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,519 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,519 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,519 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,519 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [844] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_836| v_~q~0.base_590)) (.cse6 (* v_~q_front~0_1138 4))) (let ((.cse1 (* v_~q_back~0_1268 4)) (.cse2 (select .cse0 (+ .cse6 v_~q~0.offset_589))) (.cse4 (< v_~q_front~0_1138 v_~q_back~0_1268))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_670| (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_589 4)) 1) 1 0)) (= v_~q_front~0_1136 (+ v_~q_front~0_1138 2)) (= (+ .cse2 v_~s~0_1099 |v_thread2Thread1of1ForFork1_~j~0#1_701|) v_~s~0_1097) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_670| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_670|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_701| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646| (ite (let ((.cse3 (+ v_~q_front~0_1138 1))) (and (<= 0 .cse3) .cse4 (< .cse3 v_~n~0_583))) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_589)) 1) 1 0) 0)) (not (= .cse2 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_670| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_706| (+ |v_thread1Thread1of1ForFork0_~i~0#1_708| 2)) (not (= (ite (and (< v_~q_front~0_1138 v_~n~0_583) .cse4 (<= 0 v_~q_front~0_1138)) 1 0) 0)) (not (= (ite (let ((.cse5 (+ v_~q_back~0_1268 1))) (and (< .cse5 v_~n~0_583) (<= 0 .cse5))) 1 0) 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_708| 1) v_~N~0_471) (= (+ 2 v_~q_back~0_1268) v_~q_back~0_1266) (= (select .cse0 (+ .cse6 v_~q~0.offset_589 4)) |v_thread2Thread1of1ForFork1_~j~0#1_701|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_646|)))) InVars {~q_back~0=v_~q_back~0_1268, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_708|, #memory_int=|v_#memory_int_836|, ~N~0=v_~N~0_471, ~q~0.base=v_~q~0.base_590, ~n~0=v_~n~0_583, ~q~0.offset=v_~q~0.offset_589, ~s~0=v_~s~0_1099, ~q_front~0=v_~q_front~0_1138} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_701|, ~q_back~0=v_~q_back~0_1266, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_489|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_646|, ~N~0=v_~N~0_471, ~q~0.base=v_~q~0.base_590, ~q~0.offset=v_~q~0.offset_589, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_646|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_646|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_670|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_493|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_489|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_706|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_670|, #memory_int=|v_#memory_int_836|, ~n~0=v_~n~0_583, ~s~0=v_~s~0_1097, ~q_front~0=v_~q_front~0_1136} 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 [877] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_907| v_~q~0.base_636))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_820| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_753| (ite (and (< v_~q_front~0_1296 v_~n~0_627) (< v_~q_front~0_1296 v_~q_back~0_1397) (<= 0 v_~q_front~0_1296)) 1 0)) (= (+ v_~q_back~0_1397 1) v_~q_back~0_1396) (= (+ v_~s~0_1270 |v_thread2Thread1of1ForFork1_~j~0#1_820|) v_~s~0_1269) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_753| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_753|) (= |v_thread1Thread1of1ForFork0_~i~0#1_802| (+ |v_thread1Thread1of1ForFork0_~i~0#1_803| 1)) (not (= (ite (and (<= 0 v_~q_back~0_1397) (< v_~q_back~0_1397 v_~n~0_627)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_753| 0)) (= v_~q_front~0_1295 (+ v_~q_front~0_1296 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_753| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_753| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_753|) (= (select .cse0 (+ (* v_~q_front~0_1296 4) v_~q~0.offset_635)) |v_thread2Thread1of1ForFork1_~j~0#1_820|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_753| (ite (= (select .cse0 (+ (* v_~q_back~0_1397 4) v_~q~0.offset_635)) 1) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_803| v_~N~0_503))) InVars {~q_back~0=v_~q_back~0_1397, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_803|, #memory_int=|v_#memory_int_907|, ~N~0=v_~N~0_503, ~q~0.base=v_~q~0.base_636, ~n~0=v_~n~0_627, ~q~0.offset=v_~q~0.offset_635, ~s~0=v_~s~0_1270, ~q_front~0=v_~q_front~0_1296} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_820|, ~q_back~0=v_~q_back~0_1396, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_753|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_554|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_753|, ~N~0=v_~N~0_503, ~q~0.base=v_~q~0.base_636, ~q~0.offset=v_~q~0.offset_635, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_753|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_753|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_753|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_558|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_554|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_802|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_753|, #memory_int=|v_#memory_int_907|, ~n~0=v_~n~0_627, ~s~0=v_~s~0_1269, ~q_front~0=v_~q_front~0_1295} 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] [2022-12-13 13:40:55,843 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,844 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,844 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,844 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,844 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:55,844 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:56,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [930] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1029| v_~q~0.base_712))) (let ((.cse1 (* v_~q_back~0_1607 4)) (.cse3 (select .cse0 (+ v_~q~0.offset_711 (* v_~q_front~0_1523 4))))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_711 4)) 1) 1 0) 0)) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_711)) 1) 1 0))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_979| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_942| (+ v_~N~0_567 1)) (= (select .cse0 (+ (* v_~q_front~0_1522 4) (- 4) v_~q~0.offset_711)) |v_thread2Thread1of1ForFork1_~j~0#1_979|) (= (ite (and (< v_~q_front~0_1522 (+ 3 v_~q_back~0_1607)) (<= 1 v_~q_front~0_1522) (< v_~q_front~0_1522 (+ v_~n~0_703 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_899|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_881| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_881| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_881|) (not (= (ite (= 1 (select .cse0 (+ .cse1 8 v_~q~0.offset_711))) 1 0) 0)) (= (+ 7 v_~q_back~0_1607) v_~q_back~0_1605) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_711)) 1) 1 0) 0)) (= v_~q_front~0_1522 (+ v_~q_front~0_1523 2)) (not (= (ite (let ((.cse2 (+ 6 v_~q_back~0_1607))) (and (<= 0 .cse2) (< .cse2 v_~n~0_703))) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_942|) (not (= (ite (and (< v_~q_front~0_1523 v_~n~0_703) (<= 0 v_~q_front~0_1523) (< v_~q_front~0_1523 (+ v_~q_back~0_1607 1))) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_711 24)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_881|) (not (= (ite (= (select .cse0 (+ .cse1 20 v_~q~0.offset_711)) 1) 1 0) 0)) (= (+ .cse3 v_~s~0_1500 |v_thread2Thread1of1ForFork1_~j~0#1_979|) v_~s~0_1499) (not (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_711)) 1) 1 0) 0)) (not (= .cse3 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_899| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_899|)))) InVars {~q_back~0=v_~q_back~0_1607, #memory_int=|v_#memory_int_1029|, ~N~0=v_~N~0_567, ~q~0.base=v_~q~0.base_712, ~n~0=v_~n~0_703, ~q~0.offset=v_~q~0.offset_711, ~s~0=v_~s~0_1500, ~q_front~0=v_~q_front~0_1523} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_979|, ~q_back~0=v_~q_back~0_1605, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_899|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_649|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_899|, ~N~0=v_~N~0_567, ~q~0.base=v_~q~0.base_712, ~q~0.offset=v_~q~0.offset_711, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_899|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_899|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_881|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_653|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_649|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_942|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_881|, #memory_int=|v_#memory_int_1029|, ~n~0=v_~n~0_703, ~s~0=v_~s~0_1499, ~q_front~0=v_~q_front~0_1522} 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-13 13:40:56,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_802| v_~q~0.base_563))) (let ((.cse1 (* v_~q_back~0_1203 4)) (.cse2 (+ v_~n~0_559 1)) (.cse3 (select .cse0 (+ (* v_~q_front~0_1079 4) v_~q~0.offset_562))) (.cse4 (* v_~q_back~0_1201 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_562 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_562)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_611| (ite (and (< v_~q_front~0_1078 .cse2) (< (+ v_~q_front~0_1078 1) v_~q_back~0_1201) (<= 1 v_~q_front~0_1078)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_629| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_629|) (not (= .cse3 0)) (not (= (ite (and (< v_~q_back~0_1201 .cse2) (<= 1 v_~q_back~0_1201)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_652| 4) (= v_~q_front~0_1078 (+ v_~q_front~0_1079 2)) (not (= (ite (and (< v_~q_front~0_1079 v_~n~0_559) (<= 0 v_~q_front~0_1079) (< v_~q_front~0_1079 (+ v_~q_back~0_1203 1))) 1 0) 0)) (= (+ v_~q_back~0_1203 4) v_~q_back~0_1201) (= (+ .cse3 v_~s~0_1038 |v_thread2Thread1of1ForFork1_~j~0#1_665|) v_~s~0_1037) (< |v_thread1Thread1of1ForFork0_~i~0#1_652| (+ v_~N~0_445 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_611| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_611|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_665| 0)) (not (= (ite (= (select .cse0 (+ .cse4 v_~q~0.offset_562 (- 8))) 1) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse4 (- 4) v_~q~0.offset_562)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_629|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_629| 0)) (= (select .cse0 (+ (- 4) v_~q~0.offset_562 (* v_~q_front~0_1078 4))) |v_thread2Thread1of1ForFork1_~j~0#1_665|)))) InVars {~q_back~0=v_~q_back~0_1203, #memory_int=|v_#memory_int_802|, ~N~0=v_~N~0_445, ~q~0.base=v_~q~0.base_563, ~n~0=v_~n~0_559, ~q~0.offset=v_~q~0.offset_562, ~s~0=v_~s~0_1038, ~q_front~0=v_~q_front~0_1079} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_665|, ~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_611|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_449|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_611|, ~N~0=v_~N~0_445, ~q~0.base=v_~q~0.base_563, ~q~0.offset=v_~q~0.offset_562, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_611|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_611|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_629|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_453|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_449|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_652|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_629|, #memory_int=|v_#memory_int_802|, ~n~0=v_~n~0_559, ~s~0=v_~s~0_1037, ~q_front~0=v_~q_front~0_1078} 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-13 13:40:57,375 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:57,375 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:57,375 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:57,375 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:40:57,816 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 13:40:57,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6630 [2022-12-13 13:40:57,816 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 1213 transitions, 43196 flow [2022-12-13 13:40:57,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:57,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:57,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:57,825 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-13 13:40:58,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-12-13 13:40:58,017 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-13 13:40:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1101297076, now seen corresponding path program 1 times [2022-12-13 13:40:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:58,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379490929] [2022-12-13 13:40:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:58,063 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-13 13:40:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379490929] [2022-12-13 13:40:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379490929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:58,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:58,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:40:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331538992] [2022-12-13 13:40:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:58,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:40:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:40:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:40:58,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 91 [2022-12-13 13:40:58,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1213 transitions, 43196 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:58,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:58,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 91 [2022-12-13 13:40:58,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:02,376 INFO L130 PetriNetUnfolder]: 4494/8557 cut-off events. [2022-12-13 13:41:02,376 INFO L131 PetriNetUnfolder]: For 542868/542924 co-relation queries the response was YES. [2022-12-13 13:41:02,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117948 conditions, 8557 events. 4494/8557 cut-off events. For 542868/542924 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 70519 event pairs, 1122 based on Foata normal form. 16/8573 useless extension candidates. Maximal degree in co-relation 117150. Up to 7889 conditions per place. [2022-12-13 13:41:02,508 INFO L137 encePairwiseOnDemand]: 83/91 looper letters, 1116 selfloop transitions, 100 changer transitions 3/1220 dead transitions. [2022-12-13 13:41:02,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1220 transitions, 45475 flow [2022-12-13 13:41:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-12-13 13:41:02,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3772893772893773 [2022-12-13 13:41:02,509 INFO L175 Difference]: Start difference. First operand has 474 places, 1213 transitions, 43196 flow. Second operand 3 states and 103 transitions. [2022-12-13 13:41:02,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1220 transitions, 45475 flow [2022-12-13 13:41:07,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 1220 transitions, 44547 flow, removed 193 selfloop flow, removed 13 redundant places. [2022-12-13 13:41:07,294 INFO L231 Difference]: Finished difference. Result has 461 places, 1186 transitions, 41487 flow [2022-12-13 13:41:07,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=41467, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1089, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=41487, PETRI_PLACES=461, PETRI_TRANSITIONS=1186} [2022-12-13 13:41:07,295 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 440 predicate places. [2022-12-13 13:41:07,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:07,295 INFO L89 Accepts]: Start accepts. Operand has 461 places, 1186 transitions, 41487 flow [2022-12-13 13:41:07,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:07,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:07,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 461 places, 1186 transitions, 41487 flow [2022-12-13 13:41:07,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 457 places, 1186 transitions, 41487 flow [2022-12-13 13:41:08,317 INFO L130 PetriNetUnfolder]: 1057/3321 cut-off events. [2022-12-13 13:41:08,318 INFO L131 PetriNetUnfolder]: For 163708/163874 co-relation queries the response was YES. [2022-12-13 13:41:08,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42611 conditions, 3321 events. 1057/3321 cut-off events. For 163708/163874 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 34433 event pairs, 5 based on Foata normal form. 48/3364 useless extension candidates. Maximal degree in co-relation 42211. Up to 1490 conditions per place. [2022-12-13 13:41:08,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 457 places, 1186 transitions, 41487 flow [2022-12-13 13:41:08,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 3958 [2022-12-13 13:41:08,424 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,424 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,424 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,424 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] $Ultimate##0-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_843| v_~q~0.base_596)) (.cse7 (* v_~q_front~0_1156 4))) (let ((.cse0 (< v_~q_front~0_1156 (+ v_~q_back~0_1289 1))) (.cse5 (select .cse2 (+ .cse7 v_~q~0.offset_595))) (.cse4 (select .cse2 (+ .cse7 v_~q~0.offset_595 4))) (.cse3 (* v_~q_back~0_1289 4))) (and (= v_~q_front~0_1155 (+ v_~q_front~0_1156 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_658| (ite (let ((.cse1 (+ v_~q_front~0_1156 2))) (and .cse0 (< .cse1 v_~n~0_589) (<= 0 .cse1))) 1 0)) (= (+ v_~q_back~0_1289 4) v_~q_back~0_1287) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_685| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_724| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_685| (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_595)) 1) 1 0)) (not (= .cse4 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_685| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_685|) (not (= .cse5 0)) (not (= (ite (and (< v_~q_front~0_1156 v_~n~0_589) .cse0 (<= 0 v_~q_front~0_1156)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_595)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_595)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_658| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_658|) (< |v_thread1Thread1of1ForFork0_~i~0#1_724| (+ v_~N~0_477 1)) (not (= (ite (let ((.cse6 (+ 3 v_~q_back~0_1289))) (and (<= 0 .cse6) (< .cse6 v_~n~0_589))) 1 0) 0)) (= (+ .cse5 v_~s~0_1118 |v_thread2Thread1of1ForFork1_~j~0#1_714| .cse4) v_~s~0_1117) (= (select .cse2 (+ .cse7 8 v_~q~0.offset_595)) |v_thread2Thread1of1ForFork1_~j~0#1_714|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_714| 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_595 4)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1289, #memory_int=|v_#memory_int_843|, ~N~0=v_~N~0_477, ~q~0.base=v_~q~0.base_596, ~n~0=v_~n~0_589, ~q~0.offset=v_~q~0.offset_595, ~s~0=v_~s~0_1118, ~q_front~0=v_~q_front~0_1156} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_714|, ~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_658|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_503|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_658|, ~N~0=v_~N~0_477, ~q~0.base=v_~q~0.base_596, ~q~0.offset=v_~q~0.offset_595, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_658|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_658|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_685|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_507|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_503|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_724|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_685|, #memory_int=|v_#memory_int_843|, ~n~0=v_~n~0_589, ~s~0=v_~s~0_1117, ~q_front~0=v_~q_front~0_1155} 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 [876] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_905| v_~q~0.base_634)) (.cse1 (* v_~q_back~0_1392 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_751| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_751|) (= |v_thread1Thread1of1ForFork0_~i~0#1_796| (+ |v_thread1Thread1of1ForFork0_~i~0#1_798| 2)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_818| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_751| (ite (and (< v_~q_front~0_1292 v_~q_back~0_1392) (<= 0 v_~q_front~0_1292) (< v_~q_front~0_1292 v_~n~0_625)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_633)) 1) 1 0) 0)) (= v_~q_front~0_1291 (+ v_~q_front~0_1292 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_751| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749|) (= (select .cse0 (+ (* v_~q_front~0_1292 4) v_~q~0.offset_633)) |v_thread2Thread1of1ForFork1_~j~0#1_818|) (= (+ v_~s~0_1266 |v_thread2Thread1of1ForFork1_~j~0#1_818|) v_~s~0_1265) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1392 1))) (and (< .cse2 v_~n~0_625) (<= 0 .cse2))) 1 0) 0)) (= v_~q_back~0_1390 (+ 2 v_~q_back~0_1392)) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_633 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749| 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_798| 1) v_~N~0_501))) InVars {~q_back~0=v_~q_back~0_1392, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_798|, #memory_int=|v_#memory_int_905|, ~N~0=v_~N~0_501, ~q~0.base=v_~q~0.base_634, ~n~0=v_~n~0_625, ~q~0.offset=v_~q~0.offset_633, ~s~0=v_~s~0_1266, ~q_front~0=v_~q_front~0_1292} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_818|, ~q_back~0=v_~q_back~0_1390, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_751|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_550|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_751|, ~N~0=v_~N~0_501, ~q~0.base=v_~q~0.base_634, ~q~0.offset=v_~q~0.offset_633, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_751|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_751|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_554|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_550|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_796|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749|, #memory_int=|v_#memory_int_905|, ~n~0=v_~n~0_625, ~s~0=v_~s~0_1265, ~q_front~0=v_~q_front~0_1291} 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] [2022-12-13 13:41:08,896 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,896 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,896 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:08,896 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:09,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] $Ultimate##0-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_843| v_~q~0.base_596)) (.cse7 (* v_~q_front~0_1156 4))) (let ((.cse0 (< v_~q_front~0_1156 (+ v_~q_back~0_1289 1))) (.cse5 (select .cse2 (+ .cse7 v_~q~0.offset_595))) (.cse4 (select .cse2 (+ .cse7 v_~q~0.offset_595 4))) (.cse3 (* v_~q_back~0_1289 4))) (and (= v_~q_front~0_1155 (+ v_~q_front~0_1156 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_658| (ite (let ((.cse1 (+ v_~q_front~0_1156 2))) (and .cse0 (< .cse1 v_~n~0_589) (<= 0 .cse1))) 1 0)) (= (+ v_~q_back~0_1289 4) v_~q_back~0_1287) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_685| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_724| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_685| (ite (= (select .cse2 (+ .cse3 12 v_~q~0.offset_595)) 1) 1 0)) (not (= .cse4 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_685| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_685|) (not (= .cse5 0)) (not (= (ite (and (< v_~q_front~0_1156 v_~n~0_589) .cse0 (<= 0 v_~q_front~0_1156)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_595)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_595)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_658| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_658|) (< |v_thread1Thread1of1ForFork0_~i~0#1_724| (+ v_~N~0_477 1)) (not (= (ite (let ((.cse6 (+ 3 v_~q_back~0_1289))) (and (<= 0 .cse6) (< .cse6 v_~n~0_589))) 1 0) 0)) (= (+ .cse5 v_~s~0_1118 |v_thread2Thread1of1ForFork1_~j~0#1_714| .cse4) v_~s~0_1117) (= (select .cse2 (+ .cse7 8 v_~q~0.offset_595)) |v_thread2Thread1of1ForFork1_~j~0#1_714|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_714| 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_595 4)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1289, #memory_int=|v_#memory_int_843|, ~N~0=v_~N~0_477, ~q~0.base=v_~q~0.base_596, ~n~0=v_~n~0_589, ~q~0.offset=v_~q~0.offset_595, ~s~0=v_~s~0_1118, ~q_front~0=v_~q_front~0_1156} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_714|, ~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_658|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_503|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_658|, ~N~0=v_~N~0_477, ~q~0.base=v_~q~0.base_596, ~q~0.offset=v_~q~0.offset_595, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_658|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_658|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_685|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_507|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_503|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_724|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_685|, #memory_int=|v_#memory_int_843|, ~n~0=v_~n~0_589, ~s~0=v_~s~0_1117, ~q_front~0=v_~q_front~0_1155} 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 [874] L65-2-->L47-4: Formula: (let ((.cse0 (+ v_~n~0_623 1)) (.cse1 (select |v_#memory_int_903| v_~q~0.base_632))) (and (= (+ 2 v_~q_back~0_1386) v_~q_back~0_1384) (= |v_thread1Thread1of1ForFork0_~i~0#1_790| (+ |v_thread1Thread1of1ForFork0_~i~0#1_792| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_745| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_745| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_745|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_747| (ite (and (<= 1 v_~q_front~0_1285) (< v_~q_front~0_1285 v_~q_back~0_1384) (< v_~q_front~0_1285 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_814| (select .cse1 (+ (- 4) v_~q~0.offset_631 (* v_~q_front~0_1285 4)))) (not (= (+ v_~s~0_1261 |v_thread2Thread1of1ForFork1_~j~0#1_814|) v_~s~0_1259)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_745| (ite (= (select .cse1 (+ (- 4) v_~q~0.offset_631 (* v_~q_back~0_1384 4))) 1) 1 0)) (not (= (ite (and (< v_~q_back~0_1384 .cse0) (<= 1 v_~q_back~0_1384)) 1 0) 0)) (= v_~q_front~0_1285 (+ v_~q_front~0_1287 2)) (not (= (ite (= (select .cse1 (+ (* v_~q_back~0_1386 4) v_~q~0.offset_631)) 1) 1 0) 0)) (= v_~s~0_1259 (+ v_~s~0_1261 (select .cse1 (+ (* v_~q_front~0_1287 4) v_~q~0.offset_631)) |v_thread2Thread1of1ForFork1_~j~0#1_814|)) (< |v_thread1Thread1of1ForFork0_~i~0#1_790| (+ v_~N~0_499 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_747| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_747|) (not (= (ite (and (< v_~q_front~0_1287 v_~q_back~0_1386) (<= 0 v_~q_front~0_1287) (< v_~q_front~0_1287 v_~n~0_623)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_814| 0)))) InVars {~q_back~0=v_~q_back~0_1386, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, #memory_int=|v_#memory_int_903|, ~N~0=v_~N~0_499, ~q~0.base=v_~q~0.base_632, ~n~0=v_~n~0_623, ~q~0.offset=v_~q~0.offset_631, ~s~0=v_~s~0_1261, ~q_front~0=v_~q_front~0_1287} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_814|, ~q_back~0=v_~q_back~0_1384, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_747|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_546|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_747|, ~N~0=v_~N~0_499, ~q~0.base=v_~q~0.base_632, ~q~0.offset=v_~q~0.offset_631, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_747|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_747|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_745|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_550|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_546|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_790|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_745|, #memory_int=|v_#memory_int_903|, ~n~0=v_~n~0_623, ~s~0=v_~s~0_1259, ~q_front~0=v_~q_front~0_1285} 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] [2022-12-13 13:41:09,616 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:09,617 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:09,617 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:09,617 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:10,383 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:10,383 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:11,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [936] $Ultimate##0-->L65-2: Formula: (let ((.cse3 (* v_~q_front~0_1536 4)) (.cse2 (select |v_#memory_int_1035| v_~q~0.base_718))) (let ((.cse0 (select .cse2 (+ v_~q~0.offset_717 (* v_~q_front~0_1538 4)))) (.cse1 (select .cse2 (+ .cse3 v_~q~0.offset_717 (- 8)))) (.cse4 (* v_~q_back~0_1624 4))) (and (not (= (+ .cse0 .cse1 v_~s~0_1515 |v_thread2Thread1of1ForFork1_~j~0#1_987|) v_~s~0_1513)) (= (+ .cse0 .cse1 (select .cse2 (+ .cse3 (- 12) v_~q~0.offset_717)) v_~s~0_1515 |v_thread2Thread1of1ForFork1_~j~0#1_987|) v_~s~0_1513) (not (= (ite (= (select .cse2 (+ .cse4 12 v_~q~0.offset_717)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_717)) 1) 1 0) 0)) (= v_~q_front~0_1536 (+ v_~q_front~0_1538 4)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_893| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_893|) (not (= .cse0 0)) (not (= 0 (ite (let ((.cse5 (+ 5 v_~q_back~0_1624))) (and (< .cse5 v_~n~0_709) (<= 0 .cse5))) 1 0))) (< |v_thread1Thread1of1ForFork0_~i~0#1_952| (+ v_~N~0_573 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_907| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_907|) (not (= .cse1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_893| (ite (= (select .cse2 (+ .cse4 20 v_~q~0.offset_717)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_893| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_952| 6) (= (ite (and (<= 1 v_~q_front~0_1536) (< v_~q_front~0_1536 (+ v_~q_back~0_1623 1)) (< v_~q_front~0_1536 (+ v_~n~0_709 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_907|) (not (= (ite (and (<= 0 v_~q_front~0_1538) (< v_~q_front~0_1538 (+ v_~q_back~0_1624 1)) (< v_~q_front~0_1538 v_~n~0_709)) 1 0) 0)) (= (+ 6 v_~q_back~0_1624) v_~q_back~0_1623) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_987| 0)) (= (select .cse2 (+ (- 4) .cse3 v_~q~0.offset_717)) |v_thread2Thread1of1ForFork1_~j~0#1_987|) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_717 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_717)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 16 v_~q~0.offset_717)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1624, #memory_int=|v_#memory_int_1035|, ~N~0=v_~N~0_573, ~q~0.base=v_~q~0.base_718, ~n~0=v_~n~0_709, ~q~0.offset=v_~q~0.offset_717, ~s~0=v_~s~0_1515, ~q_front~0=v_~q_front~0_1538} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_987|, ~q_back~0=v_~q_back~0_1623, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_907|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_907|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_659|, ~N~0=v_~N~0_573, ~q~0.base=v_~q~0.base_718, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_907|, ~q~0.offset=v_~q~0.offset_717, 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_893|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_663|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_659|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_952|, #memory_int=|v_#memory_int_1035|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_893|, ~n~0=v_~n~0_709, ~s~0=v_~s~0_1513, ~q_front~0=v_~q_front~0_1536} 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-13 13:41:12,004 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:41:12,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4710 [2022-12-13 13:41:12,005 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 1185 transitions, 41627 flow [2022-12-13 13:41:12,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:12,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:12,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:12,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-13 13:41:12,005 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-13 13:41:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -474456427, now seen corresponding path program 1 times [2022-12-13 13:41:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:12,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137451675] [2022-12-13 13:41:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:12,053 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-13 13:41:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:12,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137451675] [2022-12-13 13:41:12,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137451675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:12,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:12,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068396874] [2022-12-13 13:41:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:12,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:12,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 85 [2022-12-13 13:41:12,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1185 transitions, 41627 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-13 13:41:12,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:12,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 85 [2022-12-13 13:41:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:16,202 INFO L130 PetriNetUnfolder]: 4432/8444 cut-off events. [2022-12-13 13:41:16,203 INFO L131 PetriNetUnfolder]: For 519872/519924 co-relation queries the response was YES. [2022-12-13 13:41:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114521 conditions, 8444 events. 4432/8444 cut-off events. For 519872/519924 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 69580 event pairs, 1616 based on Foata normal form. 29/8473 useless extension candidates. Maximal degree in co-relation 114110. Up to 7774 conditions per place. [2022-12-13 13:41:16,326 INFO L137 encePairwiseOnDemand]: 74/85 looper letters, 1099 selfloop transitions, 96 changer transitions 9/1205 dead transitions. [2022-12-13 13:41:16,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 1205 transitions, 44270 flow [2022-12-13 13:41:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:41:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-13 13:41:16,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25882352941176473 [2022-12-13 13:41:16,327 INFO L175 Difference]: Start difference. First operand has 456 places, 1185 transitions, 41627 flow. Second operand 5 states and 110 transitions. [2022-12-13 13:41:16,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 1205 transitions, 44270 flow [2022-12-13 13:41:20,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 1205 transitions, 43974 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-13 13:41:20,788 INFO L231 Difference]: Finished difference. Result has 455 places, 1165 transitions, 40691 flow [2022-12-13 13:41:20,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=40777, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=40691, PETRI_PLACES=455, PETRI_TRANSITIONS=1165} [2022-12-13 13:41:20,789 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 434 predicate places. [2022-12-13 13:41:20,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:20,789 INFO L89 Accepts]: Start accepts. Operand has 455 places, 1165 transitions, 40691 flow [2022-12-13 13:41:20,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:20,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:20,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 455 places, 1165 transitions, 40691 flow [2022-12-13 13:41:20,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 1165 transitions, 40691 flow [2022-12-13 13:41:21,750 INFO L130 PetriNetUnfolder]: 1041/3276 cut-off events. [2022-12-13 13:41:21,750 INFO L131 PetriNetUnfolder]: For 160536/160702 co-relation queries the response was YES. [2022-12-13 13:41:21,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41858 conditions, 3276 events. 1041/3276 cut-off events. For 160536/160702 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 33820 event pairs, 7 based on Foata normal form. 48/3320 useless extension candidates. Maximal degree in co-relation 41580. Up to 1458 conditions per place. [2022-12-13 13:41:21,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 452 places, 1165 transitions, 40691 flow [2022-12-13 13:41:21,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 3884 [2022-12-13 13:41:21,832 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:41:21,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1044 [2022-12-13 13:41:21,833 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 1165 transitions, 40691 flow [2022-12-13 13:41:21,833 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-13 13:41:21,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:21,833 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:21,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-13 13:41:21,833 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-13 13:41:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash -826589627, now seen corresponding path program 2 times [2022-12-13 13:41:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:21,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919584742] [2022-12-13 13:41:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:22,018 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-13 13:41:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:22,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919584742] [2022-12-13 13:41:22,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919584742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:22,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:22,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54444833] [2022-12-13 13:41:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:22,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:22,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:22,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:22,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 81 [2022-12-13 13:41:22,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 1165 transitions, 40691 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-13 13:41:22,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:22,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 81 [2022-12-13 13:41:22,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:27,724 INFO L130 PetriNetUnfolder]: 5905/11386 cut-off events. [2022-12-13 13:41:27,725 INFO L131 PetriNetUnfolder]: For 793104/793415 co-relation queries the response was YES. [2022-12-13 13:41:27,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153674 conditions, 11386 events. 5905/11386 cut-off events. For 793104/793415 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 99666 event pairs, 464 based on Foata normal form. 398/11784 useless extension candidates. Maximal degree in co-relation 153264. Up to 5634 conditions per place. [2022-12-13 13:41:27,894 INFO L137 encePairwiseOnDemand]: 33/81 looper letters, 428 selfloop transitions, 1020 changer transitions 77/1526 dead transitions. [2022-12-13 13:41:27,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1526 transitions, 55621 flow [2022-12-13 13:41:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:41:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:41:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-13 13:41:27,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2674897119341564 [2022-12-13 13:41:27,895 INFO L175 Difference]: Start difference. First operand has 452 places, 1165 transitions, 40691 flow. Second operand 6 states and 130 transitions. [2022-12-13 13:41:27,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1526 transitions, 55621 flow [2022-12-13 13:41:33,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 1526 transitions, 55363 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:33,970 INFO L231 Difference]: Finished difference. Result has 458 places, 1421 transitions, 53332 flow [2022-12-13 13:41:33,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=40487, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=730, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=53332, PETRI_PLACES=458, PETRI_TRANSITIONS=1421} [2022-12-13 13:41:33,970 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 437 predicate places. [2022-12-13 13:41:33,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:33,971 INFO L89 Accepts]: Start accepts. Operand has 458 places, 1421 transitions, 53332 flow [2022-12-13 13:41:33,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:33,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:33,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 1421 transitions, 53332 flow [2022-12-13 13:41:34,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 436 places, 1421 transitions, 53332 flow [2022-12-13 13:41:35,435 INFO L130 PetriNetUnfolder]: 1345/4274 cut-off events. [2022-12-13 13:41:35,436 INFO L131 PetriNetUnfolder]: For 216713/216981 co-relation queries the response was YES. [2022-12-13 13:41:35,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57963 conditions, 4274 events. 1345/4274 cut-off events. For 216713/216981 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 46138 event pairs, 4 based on Foata normal form. 68/4338 useless extension candidates. Maximal degree in co-relation 57785. Up to 2150 conditions per place. [2022-12-13 13:41:35,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 436 places, 1421 transitions, 53332 flow [2022-12-13 13:41:35,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 4638 [2022-12-13 13:41:35,539 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L47-4-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_504| v_~q~0.base_348)) (.cse1 (* v_~q_back~0_673 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_304| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_304|) (= (+ 2 v_~q_back~0_673) v_~q_back~0_671) (< |v_thread1Thread1of1ForFork0_~i~0#1_324| v_~N~0_267) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_347)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_114| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_304| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_304| (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_347 4)) 0) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_114| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_323| (+ |v_thread1Thread1of1ForFork0_~i~0#1_324| 1)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_323| v_~N~0_267)) (not (= (ite (and (<= 0 v_~q_back~0_673) (< v_~q_back~0_673 v_~n~0_353)) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_673 1))) (and (< .cse2 v_~n~0_353) (<= 0 .cse2))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_673, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_324|, #memory_int=|v_#memory_int_504|, ~N~0=v_~N~0_267, ~q~0.base=v_~q~0.base_348, ~n~0=v_~n~0_353, ~q~0.offset=v_~q~0.offset_347} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_114|, ~q_back~0=v_~q_back~0_671, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_132|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_206|, ~N~0=v_~N~0_267, ~q~0.base=v_~q~0.base_348, ~q~0.offset=v_~q~0.offset_347, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_304|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_210|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_206|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_323|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_132|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_304|, #memory_int=|v_#memory_int_504|, ~n~0=v_~n~0_353, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_114|} 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-13 13:41:35,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L47-4-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_500| v_~q~0.base_344))) (and (not (= (ite (and (< v_~q_back~0_663 v_~n~0_349) (<= 0 v_~q_back~0_663)) 1 0) 0)) (= (+ 2 v_~q_back~0_663) v_~q_back~0_661) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_298| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_663 4) v_~q~0.offset_343)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_298| (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_661 4) v_~q~0.offset_343)) 1) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_315| 2) |v_thread1Thread1of1ForFork0_~i~0#1_313|) (< |v_thread1Thread1of1ForFork0_~i~0#1_313| (+ v_~N~0_263 1)) (not (= (ite (and (< v_~q_back~0_661 (+ v_~n~0_349 1)) (<= 1 v_~q_back~0_661)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_663, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_500|, ~N~0=v_~N~0_263, ~q~0.base=v_~q~0.base_344, ~n~0=v_~n~0_349, ~q~0.offset=v_~q~0.offset_343} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_298|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_204|, ~q_back~0=v_~q_back~0_661, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_200|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_200|, ~N~0=v_~N~0_263, ~q~0.base=v_~q~0.base_344, ~n~0=v_~n~0_349, ~q~0.offset=v_~q~0.offset_343} 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-13 13:41:35,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L47-4-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_500| v_~q~0.base_344))) (and (not (= (ite (and (< v_~q_back~0_663 v_~n~0_349) (<= 0 v_~q_back~0_663)) 1 0) 0)) (= (+ 2 v_~q_back~0_663) v_~q_back~0_661) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_298| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_663 4) v_~q~0.offset_343)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_298| (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_661 4) v_~q~0.offset_343)) 1) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_315| 2) |v_thread1Thread1of1ForFork0_~i~0#1_313|) (< |v_thread1Thread1of1ForFork0_~i~0#1_313| (+ v_~N~0_263 1)) (not (= (ite (and (< v_~q_back~0_661 (+ v_~n~0_349 1)) (<= 1 v_~q_back~0_661)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_663, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_500|, ~N~0=v_~N~0_263, ~q~0.base=v_~q~0.base_344, ~n~0=v_~n~0_349, ~q~0.offset=v_~q~0.offset_343} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_298|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_204|, ~q_back~0=v_~q_back~0_661, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_200|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_200|, ~N~0=v_~N~0_263, ~q~0.base=v_~q~0.base_344, ~n~0=v_~n~0_349, ~q~0.offset=v_~q~0.offset_343} 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-13 13:41:35,897 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [953] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1057| v_~q~0.base_738)) (.cse2 (* v_~q_front~0_1596 4))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_737 .cse2))) (.cse4 (* v_~q_back~0_1682 4)) (.cse3 (* v_~q_back~0_1681 4))) (and (not (= (ite (and (< v_~q_front~0_1596 (+ v_~q_back~0_1682 1)) (< v_~q_front~0_1596 v_~n~0_729) (<= 0 v_~q_front~0_1596)) 1 0) 0)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1025| (select .cse1 (+ 8 v_~q~0.offset_737 .cse2))) (= v_~q_back~0_1681 (+ v_~q_back~0_1682 4)) (= v_~s~0_1573 (+ |v_thread2Thread1of1ForFork1_~j~0#1_1025| .cse0 (select .cse1 (+ v_~q~0.offset_737 4 .cse2)) v_~s~0_1575)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_931| 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_737 .cse3 (- 8))) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_944| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_944|) (not (= (ite (and (<= 1 v_~q_back~0_1681) (< v_~q_back~0_1681 (+ v_~n~0_729 1))) 1 0) 0)) (= v_~q_front~0_1594 (+ v_~q_front~0_1596 3)) (< |v_thread1Thread1of1ForFork0_~i~0#1_998| (+ v_~N~0_593 1)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_737 .cse4)) 1) 1 0) 0)) (not (= v_~s~0_1573 (+ |v_thread2Thread1of1ForFork1_~j~0#1_1025| .cse0 v_~s~0_1575))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_944| (ite (let ((.cse5 (+ v_~q_front~0_1596 2))) (and (< .cse5 v_~n~0_729) (< .cse5 v_~q_back~0_1681) (<= 0 .cse5))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1025| 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_737 4 .cse4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_931| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_931|) (= |v_thread1Thread1of1ForFork0_~i~0#1_998| 4) (= (ite (= (select .cse1 (+ (- 4) v_~q~0.offset_737 .cse3)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_931|)))) InVars {~q_back~0=v_~q_back~0_1682, #memory_int=|v_#memory_int_1057|, ~N~0=v_~N~0_593, ~q~0.base=v_~q~0.base_738, ~n~0=v_~n~0_729, ~q~0.offset=v_~q~0.offset_737, ~s~0=v_~s~0_1575, ~q_front~0=v_~q_front~0_1596} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1025|, ~q_back~0=v_~q_back~0_1681, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_944|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_944|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_694|, ~N~0=v_~N~0_593, ~q~0.base=v_~q~0.base_738, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_944|, ~q~0.offset=v_~q~0.offset_737, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_944|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_931|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_698|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_694|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_998|, #memory_int=|v_#memory_int_1057|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_931|, ~n~0=v_~n~0_729, ~s~0=v_~s~0_1573, ~q_front~0=v_~q_front~0_1594} 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-13 13:41:35,897 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:35,897 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:35,897 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:35,897 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:35,897 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:35,898 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,364 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,364 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,364 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,364 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,364 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,365 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:36,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [971] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1083| v_~q~0.base_760)) (.cse1 (* v_~q_front~0_1640 4))) (let ((.cse2 (select .cse0 (+ .cse1 v_~q~0.offset_759))) (.cse3 (select .cse0 (+ .cse1 8 v_~q~0.offset_759))) (.cse5 (* v_~q_back~0_1738 4)) (.cse6 (* v_~q_back~0_1737 4))) (and (= |v_thread2Thread1of1ForFork1_~j~0#1_1051| (select .cse0 (+ .cse1 12 v_~q~0.offset_759))) (= |v_thread1Thread1of1ForFork0_~i~0#1_1038| 4) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1051| (select .cse0 (+ .cse1 v_~q~0.offset_759 4)) .cse2 .cse3 v_~s~0_1619) v_~s~0_1617) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1051| .cse2 .cse3 v_~s~0_1619) v_~s~0_1617)) (not (= (ite (and (< v_~q_front~0_1640 v_~n~0_751) (<= 0 v_~q_front~0_1640) (< v_~q_front~0_1640 (+ v_~q_back~0_1738 1))) 1 0) 0)) (not (= .cse2 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_970| (ite (let ((.cse4 (+ v_~q_front~0_1640 3))) (and (<= 0 .cse4) (< .cse4 v_~n~0_751) (< .cse4 v_~q_back~0_1737))) 1 0)) (not (= (ite (and (<= 1 v_~q_back~0_1737) (< v_~q_back~0_1737 (+ v_~n~0_751 1))) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse5 v_~q~0.offset_759 4)) 1) 1 0) 0)) (not (= .cse3 0)) (not (= (ite (= (select .cse0 (+ .cse5 v_~q~0.offset_759)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_965| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_965|) (< |v_thread1Thread1of1ForFork0_~i~0#1_1038| (+ v_~N~0_615 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_965| 0)) (not (= (ite (= (select .cse0 (+ .cse6 v_~q~0.offset_759 (- 8))) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1051| 0)) (= v_~q_front~0_1638 (+ v_~q_front~0_1640 4)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_965| (ite (= (select .cse0 (+ .cse6 (- 4) v_~q~0.offset_759)) 1) 1 0)) (= (+ v_~q_back~0_1738 4) v_~q_back~0_1737) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_970| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_970|)))) InVars {~q_back~0=v_~q_back~0_1738, #memory_int=|v_#memory_int_1083|, ~N~0=v_~N~0_615, ~q~0.base=v_~q~0.base_760, ~n~0=v_~n~0_751, ~q~0.offset=v_~q~0.offset_759, ~s~0=v_~s~0_1619, ~q_front~0=v_~q_front~0_1640} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1051|, ~q_back~0=v_~q_back~0_1737, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_970|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_970|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_728|, ~N~0=v_~N~0_615, ~q~0.base=v_~q~0.base_760, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_970|, ~q~0.offset=v_~q~0.offset_759, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_970|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_965|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_732|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_728|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1038|, #memory_int=|v_#memory_int_1083|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_965|, ~n~0=v_~n~0_751, ~s~0=v_~s~0_1617, ~q_front~0=v_~q_front~0_1638} 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-13 13:41:37,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:41:37,578 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 (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (= v_~N~0_In_5 v_~s~0_In_3)) 1 0))) InVars {~N~0=v_~N~0_In_5, ~s~0=v_~s~0_In_3} OutVars{~N~0=v_~N~0_In_5, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ~s~0=v_~s~0_In_3} 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-13 13:41:37,657 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 13:41:37,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3688 [2022-12-13 13:41:37,658 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 1418 transitions, 53469 flow [2022-12-13 13:41:37,658 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-13 13:41:37,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:37,658 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:37,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-13 13:41:37,658 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-13 13:41:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2106554547, now seen corresponding path program 3 times [2022-12-13 13:41:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:37,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148425464] [2022-12-13 13:41:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:38,966 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-13 13:41:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148425464] [2022-12-13 13:41:38,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148425464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:41:38,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061418335] [2022-12-13 13:41:38,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:41:38,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:41:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:41:38,968 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-13 13:41:38,968 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-13 13:41:39,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:41:39,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:41:39,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 13:41:39,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:41:39,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:39,416 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-13 13:41:39,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:39,552 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-13 13:41:39,583 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-13 13:41:39,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:41:39,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:39,748 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-13 13:41:39,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:39,783 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-13 13:41:40,628 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-13 13:41:40,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061418335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:41:40,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:41:40,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 13:41:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918538484] [2022-12-13 13:41:40,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:41:40,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:41:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:40,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:41:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:41:40,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-13 13:41:40,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1418 transitions, 53469 flow. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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-13 13:41:40,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:40,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-13 13:41:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:48,322 INFO L130 PetriNetUnfolder]: 5785/11187 cut-off events. [2022-12-13 13:41:48,322 INFO L131 PetriNetUnfolder]: For 691342/691392 co-relation queries the response was YES. [2022-12-13 13:41:48,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160073 conditions, 11187 events. 5785/11187 cut-off events. For 691342/691392 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 97365 event pairs, 1414 based on Foata normal form. 48/11235 useless extension candidates. Maximal degree in co-relation 159893. Up to 10397 conditions per place. [2022-12-13 13:41:48,562 INFO L137 encePairwiseOnDemand]: 26/86 looper letters, 1293 selfloop transitions, 215 changer transitions 54/1563 dead transitions. [2022-12-13 13:41:48,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1563 transitions, 60258 flow [2022-12-13 13:41:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:41:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 13:41:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 205 transitions. [2022-12-13 13:41:48,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11351052048726468 [2022-12-13 13:41:48,563 INFO L175 Difference]: Start difference. First operand has 432 places, 1418 transitions, 53469 flow. Second operand 21 states and 205 transitions. [2022-12-13 13:41:48,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1563 transitions, 60258 flow [2022-12-13 13:41:56,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1563 transitions, 56548 flow, removed 1387 selfloop flow, removed 21 redundant places. [2022-12-13 13:41:56,195 INFO L231 Difference]: Finished difference. Result has 446 places, 1472 transitions, 52856 flow [2022-12-13 13:41:56,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=49995, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=52856, PETRI_PLACES=446, PETRI_TRANSITIONS=1472} [2022-12-13 13:41:56,196 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 425 predicate places. [2022-12-13 13:41:56,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:41:56,196 INFO L89 Accepts]: Start accepts. Operand has 446 places, 1472 transitions, 52856 flow [2022-12-13 13:41:56,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:41:56,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:41:56,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 446 places, 1472 transitions, 52856 flow [2022-12-13 13:41:56,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 1472 transitions, 52856 flow [2022-12-13 13:41:57,756 INFO L130 PetriNetUnfolder]: 1368/4325 cut-off events. [2022-12-13 13:41:57,756 INFO L131 PetriNetUnfolder]: For 188150/188276 co-relation queries the response was YES. [2022-12-13 13:41:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54447 conditions, 4325 events. 1368/4325 cut-off events. For 188150/188276 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 46565 event pairs, 2 based on Foata normal form. 53/4373 useless extension candidates. Maximal degree in co-relation 54215. Up to 1611 conditions per place. [2022-12-13 13:41:57,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 437 places, 1472 transitions, 52856 flow [2022-12-13 13:41:57,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 4828 [2022-12-13 13:41:57,867 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:57,868 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:41:57,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:41:58,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 [976] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1095| v_~q~0.base_768))) (and (not (= (ite (and (<= 0 v_~q_front~0_1661) (< v_~q_front~0_1661 v_~q_back~0_1756) (< v_~q_front~0_1661 v_~n~0_759)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_983| 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1065| (select .cse0 (+ v_~q~0.offset_767 (* v_~q_front~0_1661 4))) v_~s~0_1641) v_~s~0_1639) (= v_~q_front~0_1659 (+ v_~q_front~0_1661 2)) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1065| v_~s~0_1641) v_~s~0_1639)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1065| (select .cse0 (+ (* v_~q_front~0_1659 4) (- 4) v_~q~0.offset_767))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1065| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_983| (ite (and (< v_~q_front~0_1659 (+ v_~q_back~0_1756 1)) (<= 1 v_~q_front~0_1659) (< v_~q_front~0_1659 (+ v_~n~0_759 1))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_983| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_983|))) InVars {~q_back~0=v_~q_back~0_1756, #memory_int=|v_#memory_int_1095|, ~q~0.base=v_~q~0.base_768, ~n~0=v_~n~0_759, ~q~0.offset=v_~q~0.offset_767, ~s~0=v_~s~0_1641, ~q_front~0=v_~q_front~0_1661} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_983|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1065|, ~q_back~0=v_~q_back~0_1756, #memory_int=|v_#memory_int_1095|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_983|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_983|, ~q~0.base=v_~q~0.base_768, ~n~0=v_~n~0_759, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_983|, ~q~0.offset=v_~q~0.offset_767, ~s~0=v_~s~0_1639, ~q_front~0=v_~q_front~0_1659} 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-13 13:41:58,365 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:41:58,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2171 [2022-12-13 13:41:58,367 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 1469 transitions, 52786 flow [2022-12-13 13:41:58,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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-13 13:41:58,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:58,367 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:58,374 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-13 13:41:58,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-12-13 13:41:58,574 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-13 13:41:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1054615156, now seen corresponding path program 1 times [2022-12-13 13:41:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:58,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804014576] [2022-12-13 13:41:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:59,015 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-13 13:41:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:59,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804014576] [2022-12-13 13:41:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804014576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:41:59,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676798590] [2022-12-13 13:41:59,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:59,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:41:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:41:59,017 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-13 13:41:59,018 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-13 13:41:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:59,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 13:41:59,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:41:59,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:59,342 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-13 13:41:59,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:59,408 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-13 13:41:59,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-13 13:41:59,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:41:59,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:59,534 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-13 13:41:59,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:59,539 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-13 13:41:59,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:59,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 58 treesize of output 45 [2022-12-13 13:41:59,592 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-13 13:41:59,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676798590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:41:59,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:41:59,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 13:41:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986732470] [2022-12-13 13:41:59,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:41:59,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:41:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:41:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:41:59,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-13 13:41:59,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 1469 transitions, 52786 flow. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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-13 13:41:59,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:59,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-13 13:41:59,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:06,429 INFO L130 PetriNetUnfolder]: 5687/10910 cut-off events. [2022-12-13 13:42:06,429 INFO L131 PetriNetUnfolder]: For 578760/578808 co-relation queries the response was YES. [2022-12-13 13:42:06,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145367 conditions, 10910 events. 5687/10910 cut-off events. For 578760/578808 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 93926 event pairs, 1625 based on Foata normal form. 42/10952 useless extension candidates. Maximal degree in co-relation 144937. Up to 10733 conditions per place. [2022-12-13 13:42:06,612 INFO L137 encePairwiseOnDemand]: 30/86 looper letters, 1391 selfloop transitions, 85 changer transitions 16/1493 dead transitions. [2022-12-13 13:42:06,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1493 transitions, 55943 flow [2022-12-13 13:42:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:42:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:42:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-12-13 13:42:06,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1569767441860465 [2022-12-13 13:42:06,614 INFO L175 Difference]: Start difference. First operand has 434 places, 1469 transitions, 52786 flow. Second operand 10 states and 135 transitions. [2022-12-13 13:42:06,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 1493 transitions, 55943 flow [2022-12-13 13:42:12,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1493 transitions, 55473 flow, removed 211 selfloop flow, removed 12 redundant places. [2022-12-13 13:42:12,813 INFO L231 Difference]: Finished difference. Result has 434 places, 1468 transitions, 52411 flow [2022-12-13 13:42:12,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=52316, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=52411, PETRI_PLACES=434, PETRI_TRANSITIONS=1468} [2022-12-13 13:42:12,814 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 413 predicate places. [2022-12-13 13:42:12,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:12,814 INFO L89 Accepts]: Start accepts. Operand has 434 places, 1468 transitions, 52411 flow [2022-12-13 13:42:12,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:12,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:12,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 1468 transitions, 52411 flow [2022-12-13 13:42:12,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 431 places, 1468 transitions, 52411 flow [2022-12-13 13:42:14,223 INFO L130 PetriNetUnfolder]: 1368/4310 cut-off events. [2022-12-13 13:42:14,223 INFO L131 PetriNetUnfolder]: For 185396/185558 co-relation queries the response was YES. [2022-12-13 13:42:14,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53761 conditions, 4310 events. 1368/4310 cut-off events. For 185396/185558 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 46516 event pairs, 2 based on Foata normal form. 59/4366 useless extension candidates. Maximal degree in co-relation 53478. Up to 1601 conditions per place. [2022-12-13 13:42:14,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 431 places, 1468 transitions, 52411 flow [2022-12-13 13:42:14,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 4798 [2022-12-13 13:42:14,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [966] L47-4-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_1076| v_~q~0.base_754))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_1026| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1027| 2)) (not (= (ite (and (<= 1 v_~q_back~0_1723) (< v_~q_back~0_1723 (+ v_~n~0_745 1))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_1724) (< v_~q_back~0_1724 v_~n~0_745)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957| 0)) (= (store |v_#memory_int_1076| |v_ULTIMATE.start_main_~#t2~0#1.base_169| (store (select |v_#memory_int_1076| |v_ULTIMATE.start_main_~#t2~0#1.base_169|) |v_ULTIMATE.start_main_~#t2~0#1.offset_163| |v_ULTIMATE.start_main_#t~pre14#1_311|)) |v_#memory_int_1075|) (= (+ |v_#pthreadsForks_343| 1) |v_#pthreadsForks_342|) (= |v_ULTIMATE.start_main_#t~pre14#1_311| |v_#pthreadsForks_343|) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_753 (* v_~q_back~0_1723 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957|) (= (+ 2 v_~q_back~0_1724) v_~q_back~0_1723) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_753 (* v_~q_back~0_1724 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957|) (< |v_thread1Thread1of1ForFork0_~i~0#1_1026| (+ v_~N~0_609 1)))) InVars {#pthreadsForks=|v_#pthreadsForks_343|, ~q_back~0=v_~q_back~0_1724, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_163|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1027|, #memory_int=|v_#memory_int_1076|, ~N~0=v_~N~0_609, ~q~0.base=v_~q~0.base_754, ~n~0=v_~n~0_745, ~q~0.offset=v_~q~0.offset_753, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_169|} OutVars{~q_back~0=v_~q_back~0_1723, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_163|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_720|, ~N~0=v_~N~0_609, ~q~0.base=v_~q~0.base_754, ~q~0.offset=v_~q~0.offset_753, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_311|, #pthreadsForks=|v_#pthreadsForks_342|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_724|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_720|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1026|, #memory_int=|v_#memory_int_1075|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_230|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957|, ~n~0=v_~n~0_745, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_169|} 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 (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:42:14,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [966] L47-4-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_1076| v_~q~0.base_754))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_1026| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1027| 2)) (not (= (ite (and (<= 1 v_~q_back~0_1723) (< v_~q_back~0_1723 (+ v_~n~0_745 1))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_1724) (< v_~q_back~0_1724 v_~n~0_745)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957| 0)) (= (store |v_#memory_int_1076| |v_ULTIMATE.start_main_~#t2~0#1.base_169| (store (select |v_#memory_int_1076| |v_ULTIMATE.start_main_~#t2~0#1.base_169|) |v_ULTIMATE.start_main_~#t2~0#1.offset_163| |v_ULTIMATE.start_main_#t~pre14#1_311|)) |v_#memory_int_1075|) (= (+ |v_#pthreadsForks_343| 1) |v_#pthreadsForks_342|) (= |v_ULTIMATE.start_main_#t~pre14#1_311| |v_#pthreadsForks_343|) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_753 (* v_~q_back~0_1723 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957|) (= (+ 2 v_~q_back~0_1724) v_~q_back~0_1723) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_753 (* v_~q_back~0_1724 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957|) (< |v_thread1Thread1of1ForFork0_~i~0#1_1026| (+ v_~N~0_609 1)))) InVars {#pthreadsForks=|v_#pthreadsForks_343|, ~q_back~0=v_~q_back~0_1724, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_163|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1027|, #memory_int=|v_#memory_int_1076|, ~N~0=v_~N~0_609, ~q~0.base=v_~q~0.base_754, ~n~0=v_~n~0_745, ~q~0.offset=v_~q~0.offset_753, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_169|} OutVars{~q_back~0=v_~q_back~0_1723, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_163|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_720|, ~N~0=v_~N~0_609, ~q~0.base=v_~q~0.base_754, ~q~0.offset=v_~q~0.offset_753, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_311|, #pthreadsForks=|v_#pthreadsForks_342|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_724|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_720|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1026|, #memory_int=|v_#memory_int_1075|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_230|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957|, ~n~0=v_~n~0_745, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_169|} 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-13 13:42:14,545 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:14,545 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:14,545 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:14,546 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:14,751 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:42:14,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1937 [2022-12-13 13:42:14,751 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 1468 transitions, 52561 flow [2022-12-13 13:42:14,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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-13 13:42:14,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:14,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:14,758 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-13 13:42:14,953 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,SelfDestructingSolverStorable127 [2022-12-13 13:42:14,953 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-13 13:42:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1120395407, now seen corresponding path program 1 times [2022-12-13 13:42:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:14,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582855623] [2022-12-13 13:42:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:16,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-13 13:42:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:16,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582855623] [2022-12-13 13:42:16,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582855623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:42:16,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059198519] [2022-12-13 13:42:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:16,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:16,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:42:16,071 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-13 13:42:16,072 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-13 13:42:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:16,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 13:42:16,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:42:16,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:42:16,380 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-13 13:42:16,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:16,462 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-13 13:42:16,486 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-13 13:42:16,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:42:16,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:16,597 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-13 13:42:16,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:16,622 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-13 13:42:17,244 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-13 13:42:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059198519] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:42:17,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:42:17,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 13:42:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859375111] [2022-12-13 13:42:17,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:42:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:42:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:17,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:42:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:42:17,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 87 [2022-12-13 13:42:17,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1468 transitions, 52561 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-13 13:42:17,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:17,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 87 [2022-12-13 13:42:17,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:23,843 INFO L130 PetriNetUnfolder]: 5673/10879 cut-off events. [2022-12-13 13:42:23,844 INFO L131 PetriNetUnfolder]: For 561400/561449 co-relation queries the response was YES. [2022-12-13 13:42:23,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144128 conditions, 10879 events. 5673/10879 cut-off events. For 561400/561449 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 93016 event pairs, 1370 based on Foata normal form. 39/10918 useless extension candidates. Maximal degree in co-relation 143270. Up to 10586 conditions per place. [2022-12-13 13:42:24,032 INFO L137 encePairwiseOnDemand]: 48/87 looper letters, 1369 selfloop transitions, 120 changer transitions 7/1497 dead transitions. [2022-12-13 13:42:24,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1497 transitions, 55902 flow [2022-12-13 13:42:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:42:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:42:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2022-12-13 13:42:24,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17496807151979565 [2022-12-13 13:42:24,033 INFO L175 Difference]: Start difference. First operand has 431 places, 1468 transitions, 52561 flow. Second operand 9 states and 137 transitions. [2022-12-13 13:42:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1497 transitions, 55902 flow [2022-12-13 13:42:29,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 1497 transitions, 55717 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-13 13:42:29,706 INFO L231 Difference]: Finished difference. Result has 432 places, 1468 transitions, 52707 flow [2022-12-13 13:42:29,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=52376, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=52707, PETRI_PLACES=432, PETRI_TRANSITIONS=1468} [2022-12-13 13:42:29,707 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 411 predicate places. [2022-12-13 13:42:29,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:29,707 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1468 transitions, 52707 flow [2022-12-13 13:42:29,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:29,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:29,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1468 transitions, 52707 flow [2022-12-13 13:42:29,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 431 places, 1468 transitions, 52707 flow [2022-12-13 13:42:31,383 INFO L130 PetriNetUnfolder]: 1366/4314 cut-off events. [2022-12-13 13:42:31,384 INFO L131 PetriNetUnfolder]: For 184635/184760 co-relation queries the response was YES. [2022-12-13 13:42:31,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53904 conditions, 4314 events. 1366/4314 cut-off events. For 184635/184760 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 46236 event pairs, 2 based on Foata normal form. 53/4363 useless extension candidates. Maximal degree in co-relation 53518. Up to 1600 conditions per place. [2022-12-13 13:42:31,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 431 places, 1468 transitions, 52707 flow [2022-12-13 13:42:31,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 4782 [2022-12-13 13:42:31,543 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:42:31,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1837 [2022-12-13 13:42:31,544 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 1468 transitions, 52707 flow [2022-12-13 13:42:31,544 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-13 13:42:31,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:31,544 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:31,550 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-13 13:42:31,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:31,745 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-13 13:42:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash -442130406, now seen corresponding path program 1 times [2022-12-13 13:42:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:31,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347112497] [2022-12-13 13:42:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:32,029 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-13 13:42:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347112497] [2022-12-13 13:42:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347112497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:42:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700887850] [2022-12-13 13:42:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:32,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:42:32,030 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-13 13:42:32,032 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-13 13:42:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:32,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 13:42:32,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:42:32,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:42:32,351 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-13 13:42:32,410 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-13 13:42:32,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:42:32,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:32,455 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 44 [2022-12-13 13:42:32,458 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-13 13:42:32,510 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-13 13:42:32,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700887850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:42:32,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:42:32,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-13 13:42:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601738056] [2022-12-13 13:42:32,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:42:32,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:42:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:42:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:42:32,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-13 13:42:32,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1468 transitions, 52707 flow. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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-13 13:42:32,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:32,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-13 13:42:32,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:41,040 INFO L130 PetriNetUnfolder]: 6613/12617 cut-off events. [2022-12-13 13:42:41,040 INFO L131 PetriNetUnfolder]: For 717452/717529 co-relation queries the response was YES. [2022-12-13 13:42:41,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165562 conditions, 12617 events. 6613/12617 cut-off events. For 717452/717529 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 110275 event pairs, 1203 based on Foata normal form. 160/12777 useless extension candidates. Maximal degree in co-relation 164813. Up to 9133 conditions per place. [2022-12-13 13:42:41,241 INFO L137 encePairwiseOnDemand]: 36/86 looper letters, 1344 selfloop transitions, 707 changer transitions 0/2052 dead transitions. [2022-12-13 13:42:41,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 2052 transitions, 71146 flow [2022-12-13 13:42:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 13:42:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 13:42:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 375 transitions. [2022-12-13 13:42:41,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11180679785330948 [2022-12-13 13:42:41,242 INFO L175 Difference]: Start difference. First operand has 431 places, 1468 transitions, 52707 flow. Second operand 39 states and 375 transitions. [2022-12-13 13:42:41,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 2052 transitions, 71146 flow [2022-12-13 13:42:48,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 2052 transitions, 70964 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 13:42:48,135 INFO L231 Difference]: Finished difference. Result has 481 places, 1816 transitions, 66599 flow [2022-12-13 13:42:48,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=52499, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=66599, PETRI_PLACES=481, PETRI_TRANSITIONS=1816} [2022-12-13 13:42:48,136 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 460 predicate places. [2022-12-13 13:42:48,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:42:48,136 INFO L89 Accepts]: Start accepts. Operand has 481 places, 1816 transitions, 66599 flow [2022-12-13 13:42:48,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:42:48,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:42:48,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 481 places, 1816 transitions, 66599 flow [2022-12-13 13:42:48,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 1816 transitions, 66599 flow [2022-12-13 13:42:50,211 INFO L130 PetriNetUnfolder]: 1589/4982 cut-off events. [2022-12-13 13:42:50,211 INFO L131 PetriNetUnfolder]: For 254528/254688 co-relation queries the response was YES. [2022-12-13 13:42:50,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66206 conditions, 4982 events. 1589/4982 cut-off events. For 254528/254688 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 54799 event pairs, 0 based on Foata normal form. 54/5032 useless extension candidates. Maximal degree in co-relation 65870. Up to 1948 conditions per place. [2022-12-13 13:42:50,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 481 places, 1816 transitions, 66599 flow [2022-12-13 13:42:50,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 5970 [2022-12-13 13:42:50,356 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,357 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,357 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,357 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-13 13:42:50,707 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-13 13:42:50,830 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,831 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,831 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:50,831 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:51,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [939] L47-4-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1041| v_~q~0.base_722)) (.cse1 (* v_~q_back~0_1637 4)) (.cse2 (+ 2 v_~q_back~0_1637))) (and (not (= (ite (and (<= 0 v_~q_front~0_1553) (< v_~q_front~0_1553 v_~n~0_713) (< v_~q_front~0_1553 (+ v_~q_back~0_1637 1))) 1 0) 0)) (= v_~s~0_1531 (+ (select .cse0 (+ (* v_~q_front~0_1553 4) v_~q~0.offset_721)) v_~s~0_1532 |v_thread2Thread1of1ForFork1_~j~0#1_999|)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_721 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_901| 0)) (= (select .cse0 (+ (- 4) (* v_~q_front~0_1552 4) v_~q~0.offset_721)) |v_thread2Thread1of1ForFork1_~j~0#1_999|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_918| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_918|) (= |v_thread1Thread1of1ForFork0_~i~0#1_960| (+ |v_thread1Thread1of1ForFork0_~i~0#1_962| 3)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_721)) 1) 1 0) 0)) (= (+ 3 v_~q_back~0_1637) v_~q_back~0_1635) (not (= v_~s~0_1531 (+ v_~s~0_1532 |v_thread2Thread1of1ForFork1_~j~0#1_999|))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_918| 0)) (= (+ v_~q_front~0_1553 2) v_~q_front~0_1552) (< |v_thread1Thread1of1ForFork0_~i~0#1_960| (+ v_~N~0_577 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_918| (ite (and (<= 1 v_~q_front~0_1552) (< v_~q_front~0_1552 .cse2) (< v_~q_front~0_1552 (+ v_~n~0_713 1))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_999| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_901| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_721)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_901| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_901|) (not (= (ite (and (< .cse2 v_~n~0_713) (<= 0 .cse2)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1637, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_962|, #memory_int=|v_#memory_int_1041|, ~N~0=v_~N~0_577, ~q~0.base=v_~q~0.base_722, ~n~0=v_~n~0_713, ~q~0.offset=v_~q~0.offset_721, ~s~0=v_~s~0_1532, ~q_front~0=v_~q_front~0_1553} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_999|, ~q_back~0=v_~q_back~0_1635, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_918|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_664|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_918|, ~N~0=v_~N~0_577, ~q~0.base=v_~q~0.base_722, ~q~0.offset=v_~q~0.offset_721, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_918|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_918|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_901|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_668|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_664|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_960|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_901|, #memory_int=|v_#memory_int_1041|, ~n~0=v_~n~0_713, ~s~0=v_~s~0_1531, ~q_front~0=v_~q_front~0_1552} 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-13 13:42:51,590 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:51,590 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:51,591 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:51,591 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:42:52,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:42:52,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [992] L47-4-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1129| v_~q~0.base_792)) (.cse1 (* v_~q_back~0_1826 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_791)) 1) 1 0) 0)) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1102| v_~s~0_1693) v_~s~0_1692)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1019| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1019|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_791 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_791)) 1) 1 0) 0)) (= (+ v_~q_back~0_1826 4) v_~q_back~0_1824) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1019| 0)) (not (= (ite (and (<= 0 v_~q_front~0_1713) (< v_~q_front~0_1713 (+ v_~q_back~0_1826 1)) (< v_~q_front~0_1713 v_~n~0_783)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_1105| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1106| 3)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1102| 0)) (not (= (ite (let ((.cse2 (+ 3 v_~q_back~0_1826))) (and (<= 0 .cse2) (< .cse2 v_~n~0_783))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1102| (select .cse0 (+ (- 4) v_~q~0.offset_791 (* v_~q_front~0_1712 4)))) (= (+ (select .cse0 (+ (* v_~q_front~0_1713 4) v_~q~0.offset_791)) |v_thread2Thread1of1ForFork1_~j~0#1_1102| v_~s~0_1693) v_~s~0_1692) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1019| (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_791)) 0) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1017| (ite (and (<= 1 v_~q_front~0_1712) (< v_~q_front~0_1712 (+ v_~n~0_783 1)) (< v_~q_front~0_1712 (+ 2 v_~q_back~0_1826))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1017| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_352| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_352| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1017| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1017|) (< |v_thread1Thread1of1ForFork0_~i~0#1_1105| (+ v_~N~0_645 1)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_1105| v_~N~0_645)) (= v_~q_front~0_1712 (+ v_~q_front~0_1713 2)))) InVars {~q_back~0=v_~q_back~0_1826, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1106|, #memory_int=|v_#memory_int_1129|, ~N~0=v_~N~0_645, ~q~0.base=v_~q~0.base_792, ~n~0=v_~n~0_783, ~q~0.offset=v_~q~0.offset_791, ~s~0=v_~s~0_1693, ~q_front~0=v_~q_front~0_1713} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1102|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_352|, ~q_back~0=v_~q_back~0_1824, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_370|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1017|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_770|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1017|, ~N~0=v_~N~0_645, ~q~0.base=v_~q~0.base_792, ~q~0.offset=v_~q~0.offset_791, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1017|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1017|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1019|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_774|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_770|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1105|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_370|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1019|, #memory_int=|v_#memory_int_1129|, ~n~0=v_~n~0_783, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_352|, ~s~0=v_~s~0_1692, ~q_front~0=v_~q_front~0_1712} 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-13 13:42:53,151 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:42:53,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5015 [2022-12-13 13:42:53,151 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 1814 transitions, 66855 flow [2022-12-13 13:42:53,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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-13 13:42:53,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:53,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:53,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-12-13 13:42:53,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:53,352 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-13 13:42:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 995690214, now seen corresponding path program 1 times [2022-12-13 13:42:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:53,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836998885] [2022-12-13 13:42:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:53,991 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-13 13:42:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836998885] [2022-12-13 13:42:53,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836998885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:42:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826514408] [2022-12-13 13:42:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:42:53,993 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-13 13:42:53,994 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-13 13:42:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:54,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 13:42:54,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:42:54,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:42:54,332 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-13 13:42:54,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:54,390 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-13 13:42:54,419 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-13 13:42:54,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:42:54,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:54,516 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-13 13:42:54,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:54,522 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-13 13:42:54,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:54,526 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-13 13:42:54,577 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-13 13:42:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826514408] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:42:54,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:42:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 13:42:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142734771] [2022-12-13 13:42:54,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:42:54,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:42:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:42:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:42:54,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 94 [2022-12-13 13:42:54,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 1814 transitions, 66855 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-13 13:42:54,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:54,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 94 [2022-12-13 13:42:54,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:04,317 INFO L130 PetriNetUnfolder]: 6655/12696 cut-off events. [2022-12-13 13:43:04,318 INFO L131 PetriNetUnfolder]: For 761546/761648 co-relation queries the response was YES. [2022-12-13 13:43:04,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178225 conditions, 12696 events. 6655/12696 cut-off events. For 761546/761648 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 110992 event pairs, 1355 based on Foata normal form. 50/12746 useless extension candidates. Maximal degree in co-relation 177775. Up to 12104 conditions per place. [2022-12-13 13:43:04,594 INFO L137 encePairwiseOnDemand]: 23/94 looper letters, 1609 selfloop transitions, 260 changer transitions 9/1879 dead transitions. [2022-12-13 13:43:04,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1879 transitions, 71701 flow [2022-12-13 13:43:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:43:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:43:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2022-12-13 13:43:04,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10694288913773796 [2022-12-13 13:43:04,595 INFO L175 Difference]: Start difference. First operand has 479 places, 1814 transitions, 66855 flow. Second operand 19 states and 191 transitions. [2022-12-13 13:43:04,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1879 transitions, 71701 flow [2022-12-13 13:43:15,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 1879 transitions, 68396 flow, removed 1625 selfloop flow, removed 4 redundant places. [2022-12-13 13:43:15,854 INFO L231 Difference]: Finished difference. Result has 494 places, 1830 transitions, 64816 flow [2022-12-13 13:43:15,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=63561, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=64816, PETRI_PLACES=494, PETRI_TRANSITIONS=1830} [2022-12-13 13:43:15,856 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 473 predicate places. [2022-12-13 13:43:15,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:43:15,856 INFO L89 Accepts]: Start accepts. Operand has 494 places, 1830 transitions, 64816 flow [2022-12-13 13:43:15,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:43:15,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:43:15,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 494 places, 1830 transitions, 64816 flow [2022-12-13 13:43:15,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 490 places, 1830 transitions, 64816 flow [2022-12-13 13:43:17,954 INFO L130 PetriNetUnfolder]: 1597/5002 cut-off events. [2022-12-13 13:43:17,954 INFO L131 PetriNetUnfolder]: For 248580/248740 co-relation queries the response was YES. [2022-12-13 13:43:18,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65025 conditions, 5002 events. 1597/5002 cut-off events. For 248580/248740 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 55191 event pairs, 0 based on Foata normal form. 60/5059 useless extension candidates. Maximal degree in co-relation 64782. Up to 1916 conditions per place. [2022-12-13 13:43:18,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 490 places, 1830 transitions, 64816 flow [2022-12-13 13:43:18,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 6024 [2022-12-13 13:43:18,087 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,087 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,087 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,087 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,087 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,088 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_474| v_~q~0.base_325))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| (ite (and (< v_~q_front~0_458 v_~n~0_331) (< v_~q_front~0_458 v_~q_back~0_614) (<= 0 v_~q_front~0_458)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_284| 1) |v_thread1Thread1of1ForFork0_~i~0#1_283|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_268|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210| 0)) (= (+ v_~q_back~0_614 1) v_~q_back~0_613) (= (ite (= 1 (select .cse0 (+ (* v_~q_back~0_614 4) v_~q~0.offset_324))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_232| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_268| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_284| v_~N~0_245) (= (+ 1 v_~q_front~0_458) v_~q_front~0_457) (= (+ v_~s~0_392 |v_thread2Thread1of1ForFork1_~j~0#1_232|) v_~s~0_391) (= (select .cse0 (+ v_~q~0.offset_324 (* 4 v_~q_front~0_458))) |v_thread2Thread1of1ForFork1_~j~0#1_232|) (not (= (ite (and (< v_~q_back~0_614 v_~n~0_331) (<= 0 v_~q_back~0_614)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|))) InVars {~q_back~0=v_~q_back~0_614, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_284|, #memory_int=|v_#memory_int_474|, ~N~0=v_~N~0_245, ~q~0.base=v_~q~0.base_325, ~n~0=v_~n~0_331, ~q~0.offset=v_~q~0.offset_324, ~s~0=v_~s~0_392, ~q_front~0=v_~q_front~0_458} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_232|, ~q_back~0=v_~q_back~0_613, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_178|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_210|, ~N~0=v_~N~0_245, ~q~0.base=v_~q~0.base_325, ~q~0.offset=v_~q~0.offset_324, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_210|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_182|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_178|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_283|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_268|, #memory_int=|v_#memory_int_474|, ~n~0=v_~n~0_331, ~s~0=v_~s~0_391, ~q_front~0=v_~q_front~0_457} 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-13 13:43:18,301 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,302 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,302 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,302 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,302 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,302 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,535 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,535 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,535 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,535 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,536 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,536 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,536 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,536 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,536 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:18,536 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:19,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:43:19,346 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:43:19,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3491 [2022-12-13 13:43:19,347 INFO L495 AbstractCegarLoop]: Abstraction has has 488 places, 1827 transitions, 64776 flow [2022-12-13 13:43:19,347 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-13 13:43:19,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:43:19,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:19,353 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-13 13:43:19,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:43:19,548 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-13 13:43:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1875627354, now seen corresponding path program 1 times [2022-12-13 13:43:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:19,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86977087] [2022-12-13 13:43:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:19,592 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-13 13:43:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:19,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86977087] [2022-12-13 13:43:19,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86977087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:19,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:43:19,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:43:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318653115] [2022-12-13 13:43:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:19,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:43:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:43:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:43:19,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 95 [2022-12-13 13:43:19,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 1827 transitions, 64776 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-13 13:43:19,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:43:19,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 95 [2022-12-13 13:43:19,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:28,935 INFO L130 PetriNetUnfolder]: 6569/12534 cut-off events. [2022-12-13 13:43:28,935 INFO L131 PetriNetUnfolder]: For 736862/736936 co-relation queries the response was YES. [2022-12-13 13:43:29,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171612 conditions, 12534 events. 6569/12534 cut-off events. For 736862/736936 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 109594 event pairs, 2448 based on Foata normal form. 23/12557 useless extension candidates. Maximal degree in co-relation 171157. Up to 9478 conditions per place. [2022-12-13 13:43:29,166 INFO L137 encePairwiseOnDemand]: 90/95 looper letters, 1856 selfloop transitions, 3 changer transitions 1/1861 dead transitions. [2022-12-13 13:43:29,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 1861 transitions, 69418 flow [2022-12-13 13:43:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:43:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:43:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 13:43:29,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 13:43:29,167 INFO L175 Difference]: Start difference. First operand has 488 places, 1827 transitions, 64776 flow. Second operand 4 states and 114 transitions. [2022-12-13 13:43:29,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 1861 transitions, 69418 flow [2022-12-13 13:43:39,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 1861 transitions, 69183 flow, removed 51 selfloop flow, removed 11 redundant places. [2022-12-13 13:43:39,411 INFO L231 Difference]: Finished difference. Result has 479 places, 1808 transitions, 63801 flow [2022-12-13 13:43:39,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=63815, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63801, PETRI_PLACES=479, PETRI_TRANSITIONS=1808} [2022-12-13 13:43:39,412 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 458 predicate places. [2022-12-13 13:43:39,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:43:39,413 INFO L89 Accepts]: Start accepts. Operand has 479 places, 1808 transitions, 63801 flow [2022-12-13 13:43:39,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:43:39,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:43:39,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 479 places, 1808 transitions, 63801 flow [2022-12-13 13:43:39,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 478 places, 1808 transitions, 63801 flow [2022-12-13 13:43:41,546 INFO L130 PetriNetUnfolder]: 1577/4955 cut-off events. [2022-12-13 13:43:41,546 INFO L131 PetriNetUnfolder]: For 240193/240344 co-relation queries the response was YES. [2022-12-13 13:43:41,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63793 conditions, 4955 events. 1577/4955 cut-off events. For 240193/240344 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 54774 event pairs, 0 based on Foata normal form. 56/5007 useless extension candidates. Maximal degree in co-relation 63488. Up to 1884 conditions per place. [2022-12-13 13:43:41,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 478 places, 1808 transitions, 63801 flow [2022-12-13 13:43:41,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 5944 [2022-12-13 13:43:41,684 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,684 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,685 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,685 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,685 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,685 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_472| v_~q~0.base_323))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (and (< v_~q_front~0_454 v_~q_back~0_610) (<= 0 v_~q_front~0_454) (< v_~q_front~0_454 v_~n~0_329)) 1 0)) (= (+ 1 v_~q_front~0_454) v_~q_front~0_453) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208|) (= (+ v_~q_back~0_610 1) v_~q_back~0_609) (not (= (ite (and (< v_~q_back~0_610 v_~n~0_329) (<= 0 v_~q_back~0_610)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_280| v_~N~0_243) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|) (= (select .cse0 (+ v_~q~0.offset_322 (* 4 v_~q_front~0_454))) |v_thread2Thread1of1ForFork1_~j~0#1_230|) (= (+ v_~s~0_388 |v_thread2Thread1of1ForFork1_~j~0#1_230|) v_~s~0_387) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_230| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_279| (+ |v_thread1Thread1of1ForFork0_~i~0#1_280| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| (ite (= (select .cse0 (+ (* v_~q_back~0_610 4) v_~q~0.offset_322)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208| 0)))) InVars {~q_back~0=v_~q_back~0_610, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_280|, #memory_int=|v_#memory_int_472|, ~N~0=v_~N~0_243, ~q~0.base=v_~q~0.base_323, ~n~0=v_~n~0_329, ~q~0.offset=v_~q~0.offset_322, ~s~0=v_~s~0_388, ~q_front~0=v_~q_front~0_454} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_230|, ~q_back~0=v_~q_back~0_609, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_176|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_208|, ~N~0=v_~N~0_243, ~q~0.base=v_~q~0.base_323, ~q~0.offset=v_~q~0.offset_322, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_208|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_208|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_180|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_176|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_279|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|, #memory_int=|v_#memory_int_472|, ~n~0=v_~n~0_329, ~s~0=v_~s~0_387, ~q_front~0=v_~q_front~0_453} 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-13 13:43:41,904 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,904 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,904 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,904 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,904 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:41,904 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:43:42,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:43:42,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2712 [2022-12-13 13:43:42,125 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 1808 transitions, 63819 flow [2022-12-13 13:43:42,125 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-13 13:43:42,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:43:42,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:42,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-13 13:43:42,125 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-13 13:43:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1364621140, now seen corresponding path program 1 times [2022-12-13 13:43:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381018386] [2022-12-13 13:43:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:42,188 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-13 13:43:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381018386] [2022-12-13 13:43:42,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381018386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:42,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:43:42,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:43:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642808903] [2022-12-13 13:43:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:42,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:43:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:43:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:43:42,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 93 [2022-12-13 13:43:42,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1808 transitions, 63819 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-13 13:43:42,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:43:42,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 93 [2022-12-13 13:43:42,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:50,610 INFO L130 PetriNetUnfolder]: 6218/11921 cut-off events. [2022-12-13 13:43:50,610 INFO L131 PetriNetUnfolder]: For 703395/703455 co-relation queries the response was YES. [2022-12-13 13:43:50,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164459 conditions, 11921 events. 6218/11921 cut-off events. For 703395/703455 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 103677 event pairs, 2355 based on Foata normal form. 53/11974 useless extension candidates. Maximal degree in co-relation 164006. Up to 9478 conditions per place. [2022-12-13 13:43:50,802 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 1739 selfloop transitions, 4 changer transitions 8/1752 dead transitions. [2022-12-13 13:43:50,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 1752 transitions, 66363 flow [2022-12-13 13:43:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:43:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:43:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-13 13:43:50,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25806451612903225 [2022-12-13 13:43:50,803 INFO L175 Difference]: Start difference. First operand has 478 places, 1808 transitions, 63819 flow. Second operand 5 states and 120 transitions. [2022-12-13 13:43:50,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 1752 transitions, 66363 flow [2022-12-13 13:44:00,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 1752 transitions, 65930 flow, removed 193 selfloop flow, removed 11 redundant places. [2022-12-13 13:44:00,175 INFO L231 Difference]: Finished difference. Result has 462 places, 1688 transitions, 60441 flow [2022-12-13 13:44:00,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=60779, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60441, PETRI_PLACES=462, PETRI_TRANSITIONS=1688} [2022-12-13 13:44:00,176 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 441 predicate places. [2022-12-13 13:44:00,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:44:00,176 INFO L89 Accepts]: Start accepts. Operand has 462 places, 1688 transitions, 60441 flow [2022-12-13 13:44:00,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:44:00,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:44:00,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 462 places, 1688 transitions, 60441 flow [2022-12-13 13:44:00,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 1688 transitions, 60441 flow [2022-12-13 13:44:01,858 INFO L130 PetriNetUnfolder]: 1481/4695 cut-off events. [2022-12-13 13:44:01,859 INFO L131 PetriNetUnfolder]: For 223799/223955 co-relation queries the response was YES. [2022-12-13 13:44:01,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60400 conditions, 4695 events. 1481/4695 cut-off events. For 223799/223955 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 51499 event pairs, 0 based on Foata normal form. 55/4746 useless extension candidates. Maximal degree in co-relation 60101. Up to 1782 conditions per place. [2022-12-13 13:44:01,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 460 places, 1688 transitions, 60441 flow [2022-12-13 13:44:01,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 5554 [2022-12-13 13:44:01,993 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [951] L65-2-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_1053| v_~q~0.base_734)) (.cse2 (* v_~q_front~0_1584 4))) (let ((.cse3 (+ 3 v_~q_back~0_1673)) (.cse0 (select .cse1 (+ .cse2 v_~q~0.offset_733))) (.cse5 (* v_~q_back~0_1673 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_936| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_936|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1017| .cse0 v_~s~0_1563 (select .cse1 (+ .cse2 v_~q~0.offset_733 4))) v_~s~0_1561) (= (ite (and (< v_~q_front~0_1582 .cse3) (<= 1 v_~q_front~0_1582) (< v_~q_front~0_1582 (+ v_~n~0_725 1))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_936|) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1017| .cse0 v_~s~0_1563) v_~s~0_1561)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_925| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_925|) (not (= (ite (let ((.cse4 (+ 2 v_~q_back~0_1673))) (and (< .cse4 v_~n~0_725) (<= 0 .cse4))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_992| 3) |v_thread1Thread1of1ForFork0_~i~0#1_990|) (= (+ v_~q_front~0_1584 3) v_~q_front~0_1582) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_992| 2) v_~N~0_589) (= (ite (= (select .cse1 (+ .cse5 8 v_~q~0.offset_733)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_925|) (= |v_thread2Thread1of1ForFork1_~j~0#1_1017| (select .cse1 (+ (* v_~q_front~0_1582 4) (- 4) v_~q~0.offset_733))) (= v_~q_back~0_1671 .cse3) (not (= (ite (= (select .cse1 (+ .cse5 v_~q~0.offset_733)) 1) 1 0) 0)) (not (= .cse0 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1017| 0)) (not (= (ite (and (< v_~q_front~0_1584 v_~n~0_725) (<= 0 v_~q_front~0_1584) (< v_~q_front~0_1584 v_~q_back~0_1673)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_925| 0)) (not (= (ite (= (select .cse1 (+ .cse5 v_~q~0.offset_733 4)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1673, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_992|, #memory_int=|v_#memory_int_1053|, ~N~0=v_~N~0_589, ~q~0.base=v_~q~0.base_734, ~n~0=v_~n~0_725, ~q~0.offset=v_~q~0.offset_733, ~s~0=v_~s~0_1563, ~q_front~0=v_~q_front~0_1584} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1017|, ~q_back~0=v_~q_back~0_1671, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_936|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_688|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_936|, ~N~0=v_~N~0_589, ~q~0.base=v_~q~0.base_734, ~q~0.offset=v_~q~0.offset_733, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_936|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_936|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_925|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_692|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_688|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_990|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_925|, #memory_int=|v_#memory_int_1053|, ~n~0=v_~n~0_725, ~s~0=v_~s~0_1561, ~q_front~0=v_~q_front~0_1582} 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-13 13:44:01,993 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:01,993 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:01,993 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:01,993 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:01,994 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:01,994 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,431 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,432 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,432 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,432 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,432 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,432 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:02,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:44:03,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (ite (and (< v_~q_front~0_In_1 v_~n~0_In_3) (< v_~q_front~0_In_1 v_~q_back~0_In_3) (<= 0 v_~q_front~0_In_1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|) (= (select (select |v_#memory_int_In_3| v_~q~0.base_In_3) (+ (* v_~q_front~0_In_1 4) v_~q~0.offset_In_3)) |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|)) (= (+ v_~q_front~0_In_1 1) v_~q_front~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_2| 0) (= (+ v_~s~0_In_1 |v_thread2Thread1of1ForFork1_~j~0#1_Out_2|) v_~s~0_Out_2) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~q_back~0=v_~q_back~0_In_3, ~q~0.base=v_~q~0.base_In_3, ~q~0.offset=v_~q~0.offset_In_3, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_In_1, ~q_front~0=v_~q_front~0_In_1} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_2|, ~q_back~0=v_~q_back~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_2|, ~q~0.base=v_~q~0.base_In_3, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_2|, ~q~0.offset=v_~q~0.offset_In_3, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~s~0=v_~s~0_Out_2, ~q_front~0=v_~q_front~0_Out_2} 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-13 13:44:03,194 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,195 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,317 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,317 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,403 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,403 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,403 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,403 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,708 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,708 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,708 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:03,708 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,329 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,330 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,508 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,508 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,664 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,665 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,874 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:04,874 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:05,056 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 13:44:05,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4881 [2022-12-13 13:44:05,057 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 1684 transitions, 60575 flow [2022-12-13 13:44:05,057 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-13 13:44:05,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:05,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:05,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-13 13:44:05,057 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-13 13:44:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash -403610662, now seen corresponding path program 1 times [2022-12-13 13:44:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:05,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177544710] [2022-12-13 13:44:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:05,905 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-13 13:44:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:05,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177544710] [2022-12-13 13:44:05,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177544710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:44:05,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444627037] [2022-12-13 13:44:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:05,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:44:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:44:05,907 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-13 13:44:05,908 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-13 13:44:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:06,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 13:44:06,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:44:06,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:44:06,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 112 treesize of output 24 [2022-12-13 13:44:06,310 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-13 13:44:06,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:44:06,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:44:06,456 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 382 [2022-12-13 13:44:06,607 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-13 13:44:06,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444627037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:44:06,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:44:06,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-13 13:44:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209209099] [2022-12-13 13:44:06,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:44:06,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:44:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:44:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:44:06,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 91 [2022-12-13 13:44:06,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 1684 transitions, 60575 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-13 13:44:06,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:06,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 91 [2022-12-13 13:44:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:14,898 INFO L130 PetriNetUnfolder]: 6194/11866 cut-off events. [2022-12-13 13:44:14,898 INFO L131 PetriNetUnfolder]: For 671118/671180 co-relation queries the response was YES. [2022-12-13 13:44:15,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162200 conditions, 11866 events. 6194/11866 cut-off events. For 671118/671180 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 103193 event pairs, 1781 based on Foata normal form. 36/11898 useless extension candidates. Maximal degree in co-relation 161753. Up to 11729 conditions per place. [2022-12-13 13:44:15,088 INFO L137 encePairwiseOnDemand]: 45/91 looper letters, 1623 selfloop transitions, 71 changer transitions 7/1702 dead transitions. [2022-12-13 13:44:15,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1702 transitions, 64039 flow [2022-12-13 13:44:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:44:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:44:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-12-13 13:44:15,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14285714285714285 [2022-12-13 13:44:15,089 INFO L175 Difference]: Start difference. First operand has 455 places, 1684 transitions, 60575 flow. Second operand 10 states and 130 transitions. [2022-12-13 13:44:15,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1702 transitions, 64039 flow [2022-12-13 13:44:23,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 1702 transitions, 63579 flow, removed 106 selfloop flow, removed 8 redundant places. [2022-12-13 13:44:23,865 INFO L231 Difference]: Finished difference. Result has 458 places, 1683 transitions, 60143 flow [2022-12-13 13:44:23,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=60016, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=60143, PETRI_PLACES=458, PETRI_TRANSITIONS=1683} [2022-12-13 13:44:23,866 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 437 predicate places. [2022-12-13 13:44:23,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:44:23,867 INFO L89 Accepts]: Start accepts. Operand has 458 places, 1683 transitions, 60143 flow [2022-12-13 13:44:23,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:44:23,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:44:23,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 1683 transitions, 60143 flow [2022-12-13 13:44:23,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 1683 transitions, 60143 flow [2022-12-13 13:44:25,629 INFO L130 PetriNetUnfolder]: 1481/4690 cut-off events. [2022-12-13 13:44:25,629 INFO L131 PetriNetUnfolder]: For 220267/220423 co-relation queries the response was YES. [2022-12-13 13:44:25,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60191 conditions, 4690 events. 1481/4690 cut-off events. For 220267/220423 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 51421 event pairs, 0 based on Foata normal form. 55/4740 useless extension candidates. Maximal degree in co-relation 59999. Up to 1782 conditions per place. [2022-12-13 13:44:25,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 456 places, 1683 transitions, 60143 flow [2022-12-13 13:44:25,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 5524 [2022-12-13 13:44:25,746 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:25,746 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:25,746 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:25,746 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:25,746 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:25,746 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:26,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [972] $Ultimate##0-->L47-4: Formula: (let ((.cse3 (select |v_#memory_int_1085| v_~q~0.base_762)) (.cse5 (* v_~q_front~0_1645 4))) (let ((.cse0 (< v_~q_front~0_1645 (+ v_~q_back~0_1743 1))) (.cse4 (* v_~q_back~0_1743 4)) (.cse6 (select .cse3 (+ v_~q~0.offset_761 .cse5))) (.cse7 (select .cse3 (+ 8 v_~q~0.offset_761 .cse5)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_974| (ite (let ((.cse1 (+ v_~q_front~0_1645 3))) (and .cse0 (< .cse1 v_~n~0_753) (<= 0 .cse1))) 1 0)) (= v_~q_front~0_1644 (+ v_~q_front~0_1645 4)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1743 4))) (and (< .cse2 v_~n~0_753) (<= 0 .cse2))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1055| 0)) (= (+ 5 v_~q_back~0_1743) v_~q_back~0_1741) (= (ite (= 1 (select .cse3 (+ .cse4 16 v_~q~0.offset_761))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_967|) (not (= (ite (= (select .cse3 (+ .cse4 v_~q~0.offset_761)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_1040| (+ v_~N~0_617 1)) (not (= (ite (= (select .cse3 (+ .cse4 8 v_~q~0.offset_761)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1055| (select .cse3 (+ 12 v_~q~0.offset_761 .cse5))) (not (= v_~s~0_1623 (+ |v_thread2Thread1of1ForFork1_~j~0#1_1055| .cse6 .cse7 v_~s~0_1624))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_967| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_967|) (not (= (ite (= (select .cse3 (+ .cse4 v_~q~0.offset_761 4)) 1) 1 0) 0)) (not (= (ite (and .cse0 (<= 0 v_~q_front~0_1645) (< v_~q_front~0_1645 v_~n~0_753)) 1 0) 0)) (not (= (ite (= (select .cse3 (+ .cse4 12 v_~q~0.offset_761)) 1) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1055| .cse6 (select .cse3 (+ v_~q~0.offset_761 4 .cse5)) .cse7 v_~s~0_1624) v_~s~0_1623) (not (= .cse6 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_967| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_974| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_974|) (= |v_thread1Thread1of1ForFork0_~i~0#1_1040| 5) (not (= .cse7 0))))) InVars {~q_back~0=v_~q_back~0_1743, #memory_int=|v_#memory_int_1085|, ~N~0=v_~N~0_617, ~q~0.base=v_~q~0.base_762, ~n~0=v_~n~0_753, ~q~0.offset=v_~q~0.offset_761, ~s~0=v_~s~0_1624, ~q_front~0=v_~q_front~0_1645} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1055|, ~q_back~0=v_~q_back~0_1741, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_974|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_730|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_974|, ~N~0=v_~N~0_617, ~q~0.base=v_~q~0.base_762, ~q~0.offset=v_~q~0.offset_761, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_974|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_974|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_967|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_734|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_730|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1040|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_967|, #memory_int=|v_#memory_int_1085|, ~n~0=v_~n~0_753, ~s~0=v_~s~0_1623, ~q_front~0=v_~q_front~0_1644} 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-13 13:44:26,503 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:26,503 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:26,503 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:26,503 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:26,504 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:26,504 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:44:27,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1032] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1180| v_~q~0.base_836)) (.cse5 (* v_~q_front~0_1825 4))) (let ((.cse6 (select .cse0 (+ .cse5 12 v_~q~0.offset_835))) (.cse2 (select .cse0 (+ .cse5 v_~q~0.offset_835))) (.cse3 (select .cse0 (+ .cse5 8 v_~q~0.offset_835))) (.cse1 (* v_~q_back~0_1921 4))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_1173| 5) (= v_~q_front~0_1823 (+ v_~q_front~0_1825 5)) (= (+ 5 v_~q_back~0_1921) v_~q_back~0_1920) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1174| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_835 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1072| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1072|) (not (= .cse2 0)) (not (= .cse3 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1174| (select .cse0 (+ (* v_~q_front~0_1823 4) (- 4) v_~q~0.offset_835))) (not (= (ite (let ((.cse4 (+ v_~q_back~0_1921 4))) (and (<= 0 .cse4) (< .cse4 v_~n~0_827))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1072| (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_835)) 1) 1 0)) (= (ite (and (< v_~q_front~0_1823 (+ v_~n~0_827 1)) (< v_~q_front~0_1823 (+ v_~q_back~0_1920 1)) (<= 1 v_~q_front~0_1823)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1087|) (= (+ (select .cse0 (+ .cse5 v_~q~0.offset_835 4)) |v_thread2Thread1of1ForFork1_~j~0#1_1174| .cse6 .cse2 .cse3 v_~s~0_1808) v_~s~0_1806) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_835)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_835)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1087| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1087|) (not (= .cse6 0)) (not (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1174| .cse6 .cse2 .cse3 v_~s~0_1808) v_~s~0_1806)) (not (= 0 (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_835)) 1) 1 0))) (< |v_thread1Thread1of1ForFork0_~i~0#1_1173| (+ v_~N~0_677 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1072| 0)) (not (= (ite (and (< v_~q_front~0_1825 v_~n~0_827) (<= 0 v_~q_front~0_1825) (< v_~q_front~0_1825 (+ v_~q_back~0_1921 1))) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1921, #memory_int=|v_#memory_int_1180|, ~N~0=v_~N~0_677, ~q~0.base=v_~q~0.base_836, ~n~0=v_~n~0_827, ~q~0.offset=v_~q~0.offset_835, ~s~0=v_~s~0_1808, ~q_front~0=v_~q_front~0_1825} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1174|, ~q_back~0=v_~q_back~0_1920, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1087|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1087|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_811|, ~N~0=v_~N~0_677, ~q~0.base=v_~q~0.base_836, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1087|, ~q~0.offset=v_~q~0.offset_835, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1087|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1072|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_815|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_811|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1173|, #memory_int=|v_#memory_int_1180|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1072|, ~n~0=v_~n~0_827, ~s~0=v_~s~0_1806, ~q_front~0=v_~q_front~0_1823} 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-13 13:44:27,834 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-13 13:44:27,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1008] L65-2-->L65-2: Formula: (let ((.cse5 (* v_~q_front~0_1761 4)) (.cse4 (select |v_#memory_int_1149| v_~q~0.base_810)) (.cse7 (* v_~q_front~0_1763 4))) (let ((.cse0 (select .cse4 (+ .cse7 v_~q~0.offset_809))) (.cse2 (select .cse4 (+ v_~q~0.offset_809 .cse5 (- 8)))) (.cse1 (select .cse4 (+ .cse7 v_~q~0.offset_809 4))) (.cse6 (* v_~q_back~0_1871 4))) (and (not (= .cse0 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1133| .cse1 .cse0 v_~s~0_1744 .cse2) v_~s~0_1742) (= v_~q_front~0_1761 (+ v_~q_front~0_1763 4)) (not (= (ite (and (<= 0 v_~q_front~0_1763) (< v_~q_front~0_1763 v_~q_back~0_1871) (< v_~q_front~0_1763 v_~n~0_801)) 1 0) 0)) (not (= (ite (let ((.cse3 (+ 2 v_~q_back~0_1871))) (and (<= 0 .cse3) (< .cse3 v_~n~0_801))) 1 0) 0)) (not (= .cse2 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1047| (ite (and (< v_~q_front~0_1761 (+ v_~q_back~0_1870 1)) (< v_~q_front~0_1761 (+ v_~n~0_801 1)) (<= 1 v_~q_front~0_1761)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1047| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1047|) (not (= .cse1 0)) (= (select .cse4 (+ (- 4) v_~q~0.offset_809 .cse5)) |v_thread2Thread1of1ForFork1_~j~0#1_1133|) (not (= (ite (= (select .cse4 (+ v_~q~0.offset_809 .cse6)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1047| (ite (= 1 (select .cse4 (+ 8 v_~q~0.offset_809 .cse6))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_1145| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1146| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1047| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1047|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_1146| 2) v_~N~0_663) (= (+ 3 v_~q_back~0_1871) v_~q_back~0_1870) (not (= (ite (= (select .cse4 (+ v_~q~0.offset_809 4 .cse6)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1133| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1047| 0))))) InVars {~q_back~0=v_~q_back~0_1871, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1146|, #memory_int=|v_#memory_int_1149|, ~N~0=v_~N~0_663, ~q~0.base=v_~q~0.base_810, ~n~0=v_~n~0_801, ~q~0.offset=v_~q~0.offset_809, ~s~0=v_~s~0_1744, ~q_front~0=v_~q_front~0_1763} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1133|, ~q_back~0=v_~q_back~0_1870, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1047|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1047|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_791|, ~N~0=v_~N~0_663, ~q~0.base=v_~q~0.base_810, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1047|, ~q~0.offset=v_~q~0.offset_809, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1047|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1047|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_795|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_791|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1145|, #memory_int=|v_#memory_int_1149|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1047|, ~n~0=v_~n~0_801, ~s~0=v_~s~0_1742, ~q_front~0=v_~q_front~0_1761} 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-13 13:44:28,396 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:44:28,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4529 [2022-12-13 13:44:28,396 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 1680 transitions, 60141 flow [2022-12-13 13:44:28,396 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-13 13:44:28,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:28,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:28,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-12-13 13:44:28,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-12-13 13:44:28,603 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-13 13:44:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 354870101, now seen corresponding path program 1 times [2022-12-13 13:44:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:28,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209941833] [2022-12-13 13:44:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:28,964 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-13 13:44:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:28,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209941833] [2022-12-13 13:44:28,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209941833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:44:28,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:44:28,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:44:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382114247] [2022-12-13 13:44:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:44:28,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:44:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:44:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:44:28,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 92 [2022-12-13 13:44:28,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 1680 transitions, 60141 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 13:44:28,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:28,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 92 [2022-12-13 13:44:28,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:36,850 INFO L130 PetriNetUnfolder]: 6185/11845 cut-off events. [2022-12-13 13:44:36,851 INFO L131 PetriNetUnfolder]: For 675692/675755 co-relation queries the response was YES. [2022-12-13 13:44:36,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161365 conditions, 11845 events. 6185/11845 cut-off events. For 675692/675755 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 102891 event pairs, 2439 based on Foata normal form. 10/11851 useless extension candidates. Maximal degree in co-relation 161148. Up to 11774 conditions per place. [2022-12-13 13:44:37,045 INFO L137 encePairwiseOnDemand]: 86/92 looper letters, 1678 selfloop transitions, 5 changer transitions 6/1690 dead transitions. [2022-12-13 13:44:37,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1690 transitions, 63544 flow [2022-12-13 13:44:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:44:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:44:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-13 13:44:37,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2391304347826087 [2022-12-13 13:44:37,046 INFO L175 Difference]: Start difference. First operand has 453 places, 1680 transitions, 60141 flow. Second operand 5 states and 110 transitions. [2022-12-13 13:44:37,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1690 transitions, 63544 flow [2022-12-13 13:44:44,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 1690 transitions, 63281 flow, removed 49 selfloop flow, removed 10 redundant places. [2022-12-13 13:44:44,940 INFO L231 Difference]: Finished difference. Result has 448 places, 1678 transitions, 59798 flow [2022-12-13 13:44:44,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=59878, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=59798, PETRI_PLACES=448, PETRI_TRANSITIONS=1678} [2022-12-13 13:44:44,941 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 427 predicate places. [2022-12-13 13:44:44,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:44:44,942 INFO L89 Accepts]: Start accepts. Operand has 448 places, 1678 transitions, 59798 flow [2022-12-13 13:44:44,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:44:44,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:44:44,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 448 places, 1678 transitions, 59798 flow [2022-12-13 13:44:44,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 1678 transitions, 59798 flow [2022-12-13 13:44:46,646 INFO L130 PetriNetUnfolder]: 1480/4685 cut-off events. [2022-12-13 13:44:46,646 INFO L131 PetriNetUnfolder]: For 218723/218933 co-relation queries the response was YES. [2022-12-13 13:44:46,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60023 conditions, 4685 events. 1480/4685 cut-off events. For 218723/218933 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 51289 event pairs, 0 based on Foata normal form. 67/4748 useless extension candidates. Maximal degree in co-relation 59735. Up to 1782 conditions per place. [2022-12-13 13:44:46,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 446 places, 1678 transitions, 59798 flow [2022-12-13 13:44:46,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 5510 [2022-12-13 13:44:46,753 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:44:46,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1812 [2022-12-13 13:44:46,753 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 1678 transitions, 59798 flow [2022-12-13 13:44:46,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 13:44:46,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:46,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:46,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-13 13:44:46,754 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-13 13:44:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -106395032, now seen corresponding path program 1 times [2022-12-13 13:44:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:46,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165046444] [2022-12-13 13:44:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:46,809 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-13 13:44:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165046444] [2022-12-13 13:44:46,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165046444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:44:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234117548] [2022-12-13 13:44:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:46,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:44:46,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:44:46,811 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-13 13:44:46,811 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-13 13:44:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:47,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:44:47,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:44:47,122 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-13 13:44:47,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:44:47,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234117548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:44:47,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:44:47,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:44:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058356225] [2022-12-13 13:44:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:44:47,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:44:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:44:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:44:47,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 90 [2022-12-13 13:44:47,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 1678 transitions, 59798 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-13 13:44:47,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:47,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 90 [2022-12-13 13:44:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:54,712 INFO L130 PetriNetUnfolder]: 6174/11823 cut-off events. [2022-12-13 13:44:54,713 INFO L131 PetriNetUnfolder]: For 670935/670994 co-relation queries the response was YES. [2022-12-13 13:44:54,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160748 conditions, 11823 events. 6174/11823 cut-off events. For 670935/670994 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 102477 event pairs, 2437 based on Foata normal form. 18/11841 useless extension candidates. Maximal degree in co-relation 160318. Up to 9456 conditions per place. [2022-12-13 13:44:54,887 INFO L137 encePairwiseOnDemand]: 86/90 looper letters, 1720 selfloop transitions, 1 changer transitions 5/1727 dead transitions. [2022-12-13 13:44:54,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 1727 transitions, 64762 flow [2022-12-13 13:44:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:44:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:44:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-13 13:44:54,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-13 13:44:54,888 INFO L175 Difference]: Start difference. First operand has 446 places, 1678 transitions, 59798 flow. Second operand 4 states and 111 transitions. [2022-12-13 13:44:54,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 1727 transitions, 64762 flow [2022-12-13 13:45:01,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1727 transitions, 64708 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 13:45:01,920 INFO L231 Difference]: Finished difference. Result has 445 places, 1676 transitions, 59651 flow [2022-12-13 13:45:01,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=59746, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59651, PETRI_PLACES=445, PETRI_TRANSITIONS=1676} [2022-12-13 13:45:01,920 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 424 predicate places. [2022-12-13 13:45:01,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:45:01,921 INFO L89 Accepts]: Start accepts. Operand has 445 places, 1676 transitions, 59651 flow [2022-12-13 13:45:01,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:45:01,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:45:01,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 445 places, 1676 transitions, 59651 flow [2022-12-13 13:45:01,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 442 places, 1676 transitions, 59651 flow [2022-12-13 13:45:03,619 INFO L130 PetriNetUnfolder]: 1479/4674 cut-off events. [2022-12-13 13:45:03,620 INFO L131 PetriNetUnfolder]: For 217039/217221 co-relation queries the response was YES. [2022-12-13 13:45:03,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59696 conditions, 4674 events. 1479/4674 cut-off events. For 217039/217221 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 50988 event pairs, 0 based on Foata normal form. 61/4733 useless extension candidates. Maximal degree in co-relation 59409. Up to 1779 conditions per place. [2022-12-13 13:45:03,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 1676 transitions, 59651 flow [2022-12-13 13:45:03,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 5504 [2022-12-13 13:45:03,727 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:45:03,727 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1806 [2022-12-13 13:45:03,727 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1676 transitions, 59651 flow [2022-12-13 13:45:03,727 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-13 13:45:03,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:03,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:03,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-12-13 13:45:03,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:45:03,928 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-13 13:45:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1010816791, now seen corresponding path program 1 times [2022-12-13 13:45:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112610452] [2022-12-13 13:45:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:04,578 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-13 13:45:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112610452] [2022-12-13 13:45:04,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112610452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:45:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626781010] [2022-12-13 13:45:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:04,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:45:04,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:45:04,580 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-13 13:45:04,581 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-13 13:45:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:04,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 13:45:04,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:45:04,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:45:04,962 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-13 13:45:04,997 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-13 13:45:04,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:45:05,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:45:05,205 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 207 treesize of output 540 [2022-12-13 13:45:05,428 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-13 13:45:05,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626781010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:45:05,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:45:05,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 13:45:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946758140] [2022-12-13 13:45:05,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:45:05,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:45:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:45:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:45:05,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 88 [2022-12-13 13:45:05,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1676 transitions, 59651 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-13 13:45:05,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:05,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 88 [2022-12-13 13:45:05,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:13,562 INFO L130 PetriNetUnfolder]: 6201/11894 cut-off events. [2022-12-13 13:45:13,562 INFO L131 PetriNetUnfolder]: For 659491/659554 co-relation queries the response was YES. [2022-12-13 13:45:13,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161365 conditions, 11894 events. 6201/11894 cut-off events. For 659491/659554 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 103605 event pairs, 1766 based on Foata normal form. 38/11932 useless extension candidates. Maximal degree in co-relation 160936. Up to 11698 conditions per place. [2022-12-13 13:45:13,734 INFO L137 encePairwiseOnDemand]: 41/88 looper letters, 1635 selfloop transitions, 79 changer transitions 12/1727 dead transitions. [2022-12-13 13:45:13,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1727 transitions, 63799 flow [2022-12-13 13:45:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:45:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:45:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 162 transitions. [2022-12-13 13:45:13,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11505681818181818 [2022-12-13 13:45:13,735 INFO L175 Difference]: Start difference. First operand has 442 places, 1676 transitions, 59651 flow. Second operand 16 states and 162 transitions. [2022-12-13 13:45:13,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1727 transitions, 63799 flow [2022-12-13 13:45:21,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 1727 transitions, 63794 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 13:45:21,107 INFO L231 Difference]: Finished difference. Result has 461 places, 1688 transitions, 60251 flow [2022-12-13 13:45:21,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=59646, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=60251, PETRI_PLACES=461, PETRI_TRANSITIONS=1688} [2022-12-13 13:45:21,108 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 440 predicate places. [2022-12-13 13:45:21,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:45:21,108 INFO L89 Accepts]: Start accepts. Operand has 461 places, 1688 transitions, 60251 flow [2022-12-13 13:45:21,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:45:21,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:45:21,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 461 places, 1688 transitions, 60251 flow [2022-12-13 13:45:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 459 places, 1688 transitions, 60251 flow [2022-12-13 13:45:22,901 INFO L130 PetriNetUnfolder]: 1481/4694 cut-off events. [2022-12-13 13:45:22,901 INFO L131 PetriNetUnfolder]: For 220775/220957 co-relation queries the response was YES. [2022-12-13 13:45:22,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60222 conditions, 4694 events. 1481/4694 cut-off events. For 220775/220957 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 51519 event pairs, 0 based on Foata normal form. 61/4753 useless extension candidates. Maximal degree in co-relation 59930. Up to 1779 conditions per place. [2022-12-13 13:45:23,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 1688 transitions, 60251 flow [2022-12-13 13:45:23,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 5532 [2022-12-13 13:45:23,038 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-13 13:45:23,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_In_1| v_~q~0.base_In_1) (+ v_~q~0.offset_In_1 (* v_~q_back~0_In_1 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~N~0_In_1)) (= v_~q_back~0_Out_2 (+ v_~q_back~0_In_1 1)) (not (= (ite (and (< v_~q_back~0_In_1 v_~n~0_In_1) (<= 0 v_~q_back~0_In_1)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_1|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~n~0=v_~n~0_In_1, ~q~0.offset=v_~q~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~q_back~0=v_~q_back~0_Out_2, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_2|, ~N~0=v_~N~0_In_1, ~q~0.base=v_~q~0.base_In_1, ~q~0.offset=v_~q~0.offset_In_1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} 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-13 13:45:23,290 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-13 13:45:23,394 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:45:23,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2286 [2022-12-13 13:45:23,394 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 1685 transitions, 60171 flow [2022-12-13 13:45:23,394 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-13 13:45:23,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:23,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:23,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-12-13 13:45:23,595 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,SelfDestructingSolverStorable136 [2022-12-13 13:45:23,595 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-13 13:45:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1299855142, now seen corresponding path program 1 times [2022-12-13 13:45:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:23,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397803320] [2022-12-13 13:45:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:24,499 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-13 13:45:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:24,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397803320] [2022-12-13 13:45:24,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397803320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:24,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:24,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:45:24,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905691722] [2022-12-13 13:45:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:24,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:45:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:24,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:45:24,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:45:24,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 91 [2022-12-13 13:45:24,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1685 transitions, 60171 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-13 13:45:24,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:24,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 91 [2022-12-13 13:45:24,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:31,823 INFO L130 PetriNetUnfolder]: 6188/11856 cut-off events. [2022-12-13 13:45:31,823 INFO L131 PetriNetUnfolder]: For 674098/674133 co-relation queries the response was YES. [2022-12-13 13:45:31,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161309 conditions, 11856 events. 6188/11856 cut-off events. For 674098/674133 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 102913 event pairs, 2419 based on Foata normal form. 5/11861 useless extension candidates. Maximal degree in co-relation 160875. Up to 11754 conditions per place. [2022-12-13 13:45:32,174 INFO L137 encePairwiseOnDemand]: 57/91 looper letters, 1644 selfloop transitions, 43 changer transitions 6/1694 dead transitions. [2022-12-13 13:45:32,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 1694 transitions, 63602 flow [2022-12-13 13:45:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:45:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:45:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-13 13:45:32,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24175824175824176 [2022-12-13 13:45:32,175 INFO L175 Difference]: Start difference. First operand has 456 places, 1685 transitions, 60171 flow. Second operand 5 states and 110 transitions. [2022-12-13 13:45:32,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 1694 transitions, 63602 flow [2022-12-13 13:45:39,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 1694 transitions, 63434 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-12-13 13:45:39,710 INFO L231 Difference]: Finished difference. Result has 454 places, 1683 transitions, 60043 flow [2022-12-13 13:45:39,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=59989, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60043, PETRI_PLACES=454, PETRI_TRANSITIONS=1683} [2022-12-13 13:45:39,711 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 433 predicate places. [2022-12-13 13:45:39,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:45:39,711 INFO L89 Accepts]: Start accepts. Operand has 454 places, 1683 transitions, 60043 flow [2022-12-13 13:45:39,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:45:39,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:45:39,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 1683 transitions, 60043 flow [2022-12-13 13:45:39,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 1683 transitions, 60043 flow [2022-12-13 13:45:41,370 INFO L130 PetriNetUnfolder]: 1481/4685 cut-off events. [2022-12-13 13:45:41,371 INFO L131 PetriNetUnfolder]: For 219388/219537 co-relation queries the response was YES. [2022-12-13 13:45:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60112 conditions, 4685 events. 1481/4685 cut-off events. For 219388/219537 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 51230 event pairs, 0 based on Foata normal form. 56/4736 useless extension candidates. Maximal degree in co-relation 59822. Up to 1779 conditions per place. [2022-12-13 13:45:41,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 452 places, 1683 transitions, 60043 flow [2022-12-13 13:45:41,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 5520 [2022-12-13 13:45:41,485 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:45:41,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1774 [2022-12-13 13:45:41,485 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 1683 transitions, 60043 flow [2022-12-13 13:45:41,485 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-13 13:45:41,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:41,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:41,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-13 13:45:41,486 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-13 13:45:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2053018937, now seen corresponding path program 1 times [2022-12-13 13:45:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:41,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223341731] [2022-12-13 13:45:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:42,422 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-13 13:45:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:42,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223341731] [2022-12-13 13:45:42,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223341731] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:45:42,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924172440] [2022-12-13 13:45:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:45:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:45:42,424 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-13 13:45:42,425 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-13 13:45:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:42,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 13:45:42,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:45:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:45:42,748 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-13 13:45:42,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:45:42,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 112 treesize of output 24 [2022-12-13 13:45:42,901 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-13 13:45:42,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:45:43,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:45:43,134 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 362 treesize of output 570 [2022-12-13 13:45:43,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:45:43,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 226 treesize of output 402 Received shutdown request... [2022-12-13 13:45:59,295 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 13:45:59,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 13:45:59,304 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-13 13:45:59,333 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 13:45:59,333 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-13 13:45:59,504 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,SelfDestructingSolverStorable138 [2022-12-13 13:45:59,504 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. [2022-12-13 13:45:59,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 13:45:59,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 13:45:59,506 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 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] [2022-12-13 13:45:59,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:45:59,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:45:59,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:45:59 BasicIcfg [2022-12-13 13:45:59,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:45:59,509 INFO L158 Benchmark]: Toolchain (without parser) took 788202.22ms. Allocated memory was 187.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 165.0MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-13 13:45:59,509 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:45:59,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.38ms. Allocated memory is still 187.7MB. Free memory was 164.4MB in the beginning and 152.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 13:45:59,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 187.7MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:45:59,510 INFO L158 Benchmark]: Boogie Preprocessor took 28.83ms. Allocated memory is still 187.7MB. Free memory was 150.3MB in the beginning and 148.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:45:59,510 INFO L158 Benchmark]: RCFGBuilder took 471.98ms. Allocated memory is still 187.7MB. Free memory was 148.7MB in the beginning and 125.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 13:45:59,510 INFO L158 Benchmark]: TraceAbstraction took 787454.80ms. Allocated memory was 187.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 124.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 13:45:59,510 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 187.7MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.38ms. Allocated memory is still 187.7MB. Free memory was 164.4MB in the beginning and 152.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 187.7MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.83ms. Allocated memory is still 187.7MB. Free memory was 150.3MB in the beginning and 148.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 471.98ms. Allocated memory is still 187.7MB. Free memory was 148.7MB in the beginning and 125.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 787454.80ms. Allocated memory was 187.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 124.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 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: 58, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, 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.9s, 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.7s, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 12, independent: 9, independent conditional: 9, 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): 8, Positive cache size: 8, Positive conditional cache size: 4, 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.0s, 35 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 102 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): 8, Positive cache size: 8, Positive conditional cache size: 4, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 128 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): 8, Positive cache size: 8, Positive conditional cache size: 4, 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.3s, 38 PlacesBefore, 38 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 122 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: 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): 14, Positive cache size: 14, Positive conditional cache size: 10, 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.0s, 38 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 116 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): 14, Positive cache size: 14, Positive conditional cache size: 10, 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.3s, 44 PlacesBefore, 43 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 26, Positive cache size: 26, Positive conditional cache size: 22, 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, 43 PlacesBefore, 43 PlacesAfterwards, 44 TransitionsBefore, 44 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): 29, Positive cache size: 29, Positive conditional cache size: 25, 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.6s, 64 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 62 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 11, independent: 0, independent conditional: 0, 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): 40, Positive cache size: 40, Positive conditional cache size: 36, 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.0s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 78 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): 40, Positive cache size: 40, Positive conditional cache size: 36, 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: 1.4s, 35 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 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: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 11, independent conditional: 11, 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): 47, Positive cache size: 47, Positive conditional cache size: 43, 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.0s, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 136 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): 47, Positive cache size: 47, Positive conditional cache size: 43, 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: 1.5s, 49 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 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): 69, Positive cache size: 69, Positive conditional cache size: 65, 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.0s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 132 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): 69, Positive cache size: 69, Positive conditional cache size: 65, 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.1s, 44 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 144 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): 91, Positive cache size: 91, Positive conditional cache size: 87, 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.0s, 43 PlacesBefore, 43 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 144 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): 91, Positive cache size: 91, Positive conditional cache size: 87, 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.2s, 42 PlacesBefore, 41 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 142 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): 92, Positive cache size: 92, Positive conditional cache size: 88, 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.1s, 42 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 146 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): 95, Positive cache size: 95, Positive conditional cache size: 91, 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.7s, 51 PlacesBefore, 51 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 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: 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: 4, independent: 3, independent conditional: 3, 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): 96, Positive cache size: 96, Positive conditional cache size: 92, 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, 56 PlacesBefore, 55 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 202 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): 97, Positive cache size: 97, Positive conditional cache size: 93, 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.0s, 52 PlacesBefore, 52 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 192 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): 97, Positive cache size: 97, Positive conditional cache size: 93, 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.5s, 61 PlacesBefore, 61 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 108, Positive conditional cache size: 104, Positive unconditional cache size: 4, Negative cache size: 6, Negative conditional cache size: 6, 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: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 77 PlacesBefore, 74 PlacesAfterwards, 103 TransitionsBefore, 100 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 26, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 26, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 180, Positive conditional cache size: 176, Positive unconditional cache size: 4, Negative cache size: 6, Negative conditional cache size: 6, 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, 76 PlacesBefore, 74 PlacesAfterwards, 102 TransitionsBefore, 100 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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): 254, Positive cache size: 248, Positive conditional cache size: 244, Positive unconditional cache size: 4, Negative cache size: 6, Negative conditional cache size: 6, 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, 80 PlacesBefore, 78 PlacesAfterwards, 116 TransitionsBefore, 114 TransitionsAfterwards, 364 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): 325, Positive cache size: 319, Positive conditional cache size: 315, Positive unconditional cache size: 4, Negative cache size: 6, Negative conditional cache size: 6, 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, 75 PlacesBefore, 75 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 334 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 323, Positive conditional cache size: 319, 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, 75 PlacesBefore, 75 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 410 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): 330, Positive cache size: 323, Positive conditional cache size: 319, 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.4s, 72 PlacesBefore, 71 PlacesAfterwards, 96 TransitionsBefore, 95 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 334, Positive cache size: 327, Positive conditional cache size: 323, 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.4s, 70 PlacesBefore, 69 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 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): 371, Positive cache size: 364, Positive conditional cache size: 360, 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, 66 PlacesBefore, 66 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 230 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): 371, Positive cache size: 364, Positive conditional cache size: 360, 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: 4.0s, 67 PlacesBefore, 67 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 375, Positive cache size: 368, Positive conditional cache size: 364, 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.0s, 57 PlacesBefore, 57 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 375, Positive cache size: 368, Positive conditional cache size: 364, 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, 63 PlacesBefore, 60 PlacesAfterwards, 78 TransitionsBefore, 75 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 378, Positive conditional cache size: 374, 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, 59 PlacesBefore, 59 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 240 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): 385, Positive cache size: 378, Positive conditional cache size: 374, 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, 65 PlacesBefore, 65 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 272 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): 386, Positive cache size: 379, Positive conditional cache size: 375, 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, 65 PlacesBefore, 65 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 246 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): 386, Positive cache size: 379, Positive conditional cache size: 375, 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, 65 PlacesBefore, 65 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 272 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): 386, Positive cache size: 379, Positive conditional cache size: 375, 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.7s, 70 PlacesBefore, 67 PlacesAfterwards, 85 TransitionsBefore, 82 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 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: 4, independent: 1, independent conditional: 1, 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): 389, Positive cache size: 382, Positive conditional cache size: 378, 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, 66 PlacesBefore, 66 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 268 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): 389, Positive cache size: 382, Positive conditional cache size: 378, 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, 74 PlacesBefore, 73 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 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: 9, independent: 2, independent conditional: 2, 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): 396, Positive cache size: 389, Positive conditional cache size: 385, 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: 1.1s, 103 PlacesBefore, 100 PlacesAfterwards, 181 TransitionsBefore, 178 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 12, independent conditional: 12, 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): 428, Positive cache size: 421, Positive conditional cache size: 417, 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: 1.3s, 100 PlacesBefore, 98 PlacesAfterwards, 178 TransitionsBefore, 176 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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): 437, Positive cache size: 430, Positive conditional cache size: 426, 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, 191 TransitionsBefore, 191 TransitionsAfterwards, 618 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): 437, Positive cache size: 430, Positive conditional cache size: 426, 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, 116 PlacesBefore, 116 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 670 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): 440, Positive cache size: 433, Positive conditional cache size: 429, 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, 118 PlacesBefore, 118 PlacesAfterwards, 211 TransitionsBefore, 211 TransitionsAfterwards, 662 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): 440, Positive cache size: 433, Positive conditional cache size: 429, 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.4s, 128 PlacesBefore, 126 PlacesAfterwards, 214 TransitionsBefore, 212 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 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: 7, independent: 5, independent conditional: 5, 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): 442, Positive cache size: 435, Positive conditional cache size: 431, 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, 118 PlacesBefore, 118 PlacesAfterwards, 209 TransitionsBefore, 209 TransitionsAfterwards, 654 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): 442, Positive cache size: 435, Positive conditional cache size: 431, 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.4s, 129 PlacesBefore, 127 PlacesAfterwards, 215 TransitionsBefore, 213 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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): 446, Positive cache size: 439, Positive conditional cache size: 435, 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, 120 PlacesBefore, 120 PlacesAfterwards, 211 TransitionsBefore, 211 TransitionsAfterwards, 658 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): 446, Positive cache size: 439, Positive conditional cache size: 435, 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.5s, 115 PlacesBefore, 114 PlacesAfterwards, 187 TransitionsBefore, 186 TransitionsAfterwards, 586 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: 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: 7, independent: 3, independent conditional: 3, 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): 450, Positive cache size: 443, Positive conditional cache size: 439, 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, 124 PlacesBefore, 124 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 670 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): 450, Positive cache size: 443, Positive conditional cache size: 439, 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.9s, 110 PlacesBefore, 109 PlacesAfterwards, 162 TransitionsBefore, 161 TransitionsAfterwards, 546 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: 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): 451, Positive cache size: 444, Positive conditional cache size: 440, 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, 112 PlacesBefore, 112 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 568 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): 451, Positive cache size: 444, Positive conditional cache size: 440, 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.3s, 120 PlacesBefore, 118 PlacesAfterwards, 172 TransitionsBefore, 170 TransitionsAfterwards, 590 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: 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): 520, Positive cache size: 513, Positive conditional cache size: 509, 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.5s, 115 PlacesBefore, 114 PlacesAfterwards, 170 TransitionsBefore, 169 TransitionsAfterwards, 578 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): 521, Positive cache size: 514, Positive conditional cache size: 510, 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, 114 PlacesBefore, 114 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 574 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): 521, Positive cache size: 514, Positive conditional cache size: 510, 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, 119 PlacesBefore, 119 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 572 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): 521, Positive cache size: 514, Positive conditional cache size: 510, 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, 115 PlacesBefore, 115 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 554 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): 521, Positive cache size: 514, Positive conditional cache size: 510, 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: 4.5s, 126 PlacesBefore, 119 PlacesAfterwards, 169 TransitionsBefore, 162 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 723, Positive cache size: 716, Positive conditional cache size: 712, 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: 6.1s, 141 PlacesBefore, 139 PlacesAfterwards, 222 TransitionsBefore, 220 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 8, independent: 2, independent conditional: 2, 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): 729, Positive cache size: 722, Positive conditional cache size: 718, 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, 142 PlacesBefore, 142 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 754 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): 729, Positive cache size: 722, Positive conditional cache size: 718, 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, 145 PlacesBefore, 144 PlacesAfterwards, 227 TransitionsBefore, 226 TransitionsAfterwards, 758 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): 730, Positive cache size: 723, Positive conditional cache size: 719, 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, 146 PlacesBefore, 146 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 800 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): 731, Positive cache size: 724, Positive conditional cache size: 720, 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, 146 PlacesBefore, 146 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 794 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): 731, Positive cache size: 724, Positive conditional cache size: 720, 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, 153 PlacesBefore, 153 PlacesAfterwards, 236 TransitionsBefore, 236 TransitionsAfterwards, 794 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): 734, Positive cache size: 727, Positive conditional cache size: 723, 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.7s, 139 PlacesBefore, 138 PlacesAfterwards, 184 TransitionsBefore, 183 TransitionsAfterwards, 628 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: 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): 735, Positive cache size: 728, Positive conditional cache size: 724, 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, 135 PlacesBefore, 135 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 735, Positive cache size: 728, Positive conditional cache size: 724, 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: 8.2s, 138 PlacesBefore, 138 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 735, Positive cache size: 728, Positive conditional cache size: 724, 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, 148 PlacesBefore, 147 PlacesAfterwards, 217 TransitionsBefore, 216 TransitionsAfterwards, 726 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): 736, Positive cache size: 729, Positive conditional cache size: 725, 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, 149 PlacesBefore, 149 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 758 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): 736, Positive cache size: 729, Positive conditional cache size: 725, 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, 155 PlacesBefore, 155 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 802 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): 736, Positive cache size: 729, Positive conditional cache size: 725, 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.8s, 157 PlacesBefore, 157 PlacesAfterwards, 237 TransitionsBefore, 237 TransitionsAfterwards, 808 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): 737, Positive cache size: 730, Positive conditional cache size: 726, 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.7s, 175 PlacesBefore, 172 PlacesAfterwards, 266 TransitionsBefore, 263 TransitionsAfterwards, 942 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 12, independent conditional: 12, 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): 1208, Positive cache size: 1201, Positive conditional cache size: 1197, 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, 193 PlacesBefore, 192 PlacesAfterwards, 292 TransitionsBefore, 291 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 12, independent: 6, independent conditional: 6, 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): 1218, Positive cache size: 1211, Positive conditional cache size: 1207, 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.5s, 188 PlacesBefore, 187 PlacesAfterwards, 336 TransitionsBefore, 335 TransitionsAfterwards, 1190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 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: 7, independent: 3, independent conditional: 3, 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): 1222, Positive cache size: 1215, Positive conditional cache size: 1211, 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, 185 PlacesBefore, 185 PlacesAfterwards, 332 TransitionsBefore, 332 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): 1222, Positive cache size: 1215, Positive conditional cache size: 1211, 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.7s, 195 PlacesBefore, 191 PlacesAfterwards, 338 TransitionsBefore, 334 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 9, independent: 7, independent conditional: 7, 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): 1225, Positive cache size: 1218, Positive conditional cache size: 1214, 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: 1.8s, 191 PlacesBefore, 190 PlacesAfterwards, 339 TransitionsBefore, 338 TransitionsAfterwards, 1192 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: 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: 6, independent: 5, independent conditional: 5, 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): 1227, Positive cache size: 1220, Positive conditional cache size: 1216, 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.1s, 205 PlacesBefore, 199 PlacesAfterwards, 350 TransitionsBefore, 344 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 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: 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: 27, independent: 18, independent conditional: 18, 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): 1648, Positive cache size: 1641, Positive conditional cache size: 1637, 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.5s, 197 PlacesBefore, 196 PlacesAfterwards, 343 TransitionsBefore, 342 TransitionsAfterwards, 1200 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): 1649, Positive cache size: 1642, Positive conditional cache size: 1638, 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, 194 PlacesBefore, 194 PlacesAfterwards, 362 TransitionsBefore, 362 TransitionsAfterwards, 1248 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): 1649, Positive cache size: 1642, Positive conditional cache size: 1638, 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: 2.9s, 200 PlacesBefore, 200 PlacesAfterwards, 367 TransitionsBefore, 367 TransitionsAfterwards, 1254 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: 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): 1683, Positive cache size: 1676, Positive conditional cache size: 1672, 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.7s, 198 PlacesBefore, 197 PlacesAfterwards, 367 TransitionsBefore, 366 TransitionsAfterwards, 1254 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): 1684, Positive cache size: 1677, Positive conditional cache size: 1673, 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, 195 PlacesBefore, 195 PlacesAfterwards, 371 TransitionsBefore, 371 TransitionsAfterwards, 1270 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): 1684, Positive cache size: 1677, Positive conditional cache size: 1673, 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, 197 PlacesBefore, 197 PlacesAfterwards, 361 TransitionsBefore, 361 TransitionsAfterwards, 1246 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): 1684, Positive cache size: 1677, Positive conditional cache size: 1673, 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, 209 PlacesBefore, 209 PlacesAfterwards, 396 TransitionsBefore, 396 TransitionsAfterwards, 1350 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): 1684, Positive cache size: 1677, Positive conditional cache size: 1673, 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, 218 PlacesBefore, 218 PlacesAfterwards, 422 TransitionsBefore, 422 TransitionsAfterwards, 1474 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): 1684, Positive cache size: 1677, Positive conditional cache size: 1673, 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: 4.4s, 233 PlacesBefore, 231 PlacesAfterwards, 530 TransitionsBefore, 528 TransitionsAfterwards, 1768 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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): 1693, Positive cache size: 1686, Positive conditional cache size: 1682, 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, 239 PlacesBefore, 237 PlacesAfterwards, 533 TransitionsBefore, 531 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 4, independent: 3, independent conditional: 3, 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): 1696, Positive cache size: 1689, Positive conditional cache size: 1685, 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: 1.0s, 225 PlacesBefore, 222 PlacesAfterwards, 523 TransitionsBefore, 520 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 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): 1699, Positive cache size: 1692, Positive conditional cache size: 1688, 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, 219 PlacesBefore, 219 PlacesAfterwards, 544 TransitionsBefore, 544 TransitionsAfterwards, 1832 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): 1699, Positive cache size: 1692, Positive conditional cache size: 1688, 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, 223 PlacesBefore, 223 PlacesAfterwards, 544 TransitionsBefore, 544 TransitionsAfterwards, 1828 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): 1699, Positive cache size: 1692, Positive conditional cache size: 1688, 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.6s, 228 PlacesBefore, 228 PlacesAfterwards, 548 TransitionsBefore, 548 TransitionsAfterwards, 1836 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 1699, Positive cache size: 1692, Positive conditional cache size: 1688, 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, 230 PlacesBefore, 229 PlacesAfterwards, 549 TransitionsBefore, 548 TransitionsAfterwards, 1838 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): 1700, Positive cache size: 1693, Positive conditional cache size: 1689, 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, 234 PlacesBefore, 234 PlacesAfterwards, 553 TransitionsBefore, 553 TransitionsAfterwards, 1846 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): 1700, Positive cache size: 1693, Positive conditional cache size: 1689, 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, 241 PlacesBefore, 240 PlacesAfterwards, 556 TransitionsBefore, 555 TransitionsAfterwards, 1852 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): 1701, Positive cache size: 1694, Positive conditional cache size: 1690, 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, 235 PlacesBefore, 235 PlacesAfterwards, 577 TransitionsBefore, 577 TransitionsAfterwards, 1946 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): 1701, Positive cache size: 1694, Positive conditional cache size: 1690, 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.4s, 248 PlacesBefore, 246 PlacesAfterwards, 587 TransitionsBefore, 585 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 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): 1986, Positive cache size: 1979, Positive conditional cache size: 1975, 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.5s, 263 PlacesBefore, 260 PlacesAfterwards, 613 TransitionsBefore, 610 TransitionsAfterwards, 2074 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 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: 7, independent: 0, independent conditional: 0, 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): 1996, Positive cache size: 1989, Positive conditional cache size: 1985, 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, 264 PlacesBefore, 262 PlacesAfterwards, 656 TransitionsBefore, 655 TransitionsAfterwards, 2184 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): 1999, Positive cache size: 1992, Positive conditional cache size: 1988, 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, 260 PlacesBefore, 260 PlacesAfterwards, 653 TransitionsBefore, 653 TransitionsAfterwards, 2176 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): 1999, Positive cache size: 1992, Positive conditional cache size: 1988, 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.4s, 267 PlacesBefore, 265 PlacesAfterwards, 656 TransitionsBefore, 654 TransitionsAfterwards, 2190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 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): 2320, Positive cache size: 2313, Positive conditional cache size: 2309, 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, 281 PlacesBefore, 281 PlacesAfterwards, 657 TransitionsBefore, 657 TransitionsAfterwards, 2172 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): 2320, Positive cache size: 2313, Positive conditional cache size: 2309, 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, 272 PlacesBefore, 272 PlacesAfterwards, 653 TransitionsBefore, 653 TransitionsAfterwards, 2154 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): 2320, Positive cache size: 2313, Positive conditional cache size: 2309, 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.9s, 286 PlacesBefore, 283 PlacesAfterwards, 661 TransitionsBefore, 658 TransitionsAfterwards, 2172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 2326, Positive cache size: 2319, Positive conditional cache size: 2315, 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: 1.5s, 294 PlacesBefore, 294 PlacesAfterwards, 743 TransitionsBefore, 743 TransitionsAfterwards, 2428 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): 2327, Positive cache size: 2320, Positive conditional cache size: 2316, 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.5s, 313 PlacesBefore, 311 PlacesAfterwards, 746 TransitionsBefore, 744 TransitionsAfterwards, 2434 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): 2335, Positive cache size: 2328, Positive conditional cache size: 2324, 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, 313 PlacesBefore, 313 PlacesAfterwards, 750 TransitionsBefore, 750 TransitionsAfterwards, 2430 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): 2335, Positive cache size: 2328, Positive conditional cache size: 2324, 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, 311 PlacesBefore, 311 PlacesAfterwards, 779 TransitionsBefore, 779 TransitionsAfterwards, 2520 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): 2335, Positive cache size: 2328, Positive conditional cache size: 2324, 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, 325 PlacesBefore, 325 PlacesAfterwards, 779 TransitionsBefore, 779 TransitionsAfterwards, 2520 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): 2335, Positive cache size: 2328, Positive conditional cache size: 2324, 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, 341 PlacesBefore, 341 PlacesAfterwards, 794 TransitionsBefore, 794 TransitionsAfterwards, 2606 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): 2335, Positive cache size: 2328, Positive conditional cache size: 2324, 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, 368 PlacesBefore, 368 PlacesAfterwards, 861 TransitionsBefore, 861 TransitionsAfterwards, 2826 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): 2335, Positive cache size: 2328, Positive conditional cache size: 2324, 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, 388 PlacesBefore, 388 PlacesAfterwards, 969 TransitionsBefore, 969 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 2343, Positive cache size: 2336, Positive conditional cache size: 2332, 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.5s, 415 PlacesBefore, 415 PlacesAfterwards, 1077 TransitionsBefore, 1077 TransitionsAfterwards, 3634 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): 2348, Positive cache size: 2341, Positive conditional cache size: 2337, 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.7s, 435 PlacesBefore, 430 PlacesAfterwards, 1106 TransitionsBefore, 1101 TransitionsAfterwards, 3722 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 10, independent: 5, independent conditional: 5, 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): 2359, Positive cache size: 2352, Positive conditional cache size: 2348, 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, 454 PlacesBefore, 450 PlacesAfterwards, 1181 TransitionsBefore, 1177 TransitionsAfterwards, 3952 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: 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: 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): 2381, Positive cache size: 2374, Positive conditional cache size: 2370, 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, 454 PlacesBefore, 454 PlacesAfterwards, 1181 TransitionsBefore, 1181 TransitionsAfterwards, 3944 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): 2381, Positive cache size: 2374, Positive conditional cache size: 2370, 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, 460 PlacesBefore, 459 PlacesAfterwards, 1177 TransitionsBefore, 1176 TransitionsAfterwards, 3940 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): 2383, Positive cache size: 2376, Positive conditional cache size: 2372, 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: 7.2s, 466 PlacesBefore, 458 PlacesAfterwards, 1184 TransitionsBefore, 1176 TransitionsAfterwards, 3982 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 35, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2936, Positive cache size: 2929, Positive conditional cache size: 2925, 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: 5.3s, 475 PlacesBefore, 474 PlacesAfterwards, 1214 TransitionsBefore, 1213 TransitionsAfterwards, 4070 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 13, independent: 5, independent conditional: 5, 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): 2945, Positive cache size: 2938, Positive conditional cache size: 2934, 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: 3.6s, 457 PlacesBefore, 456 PlacesAfterwards, 1186 TransitionsBefore, 1185 TransitionsAfterwards, 3958 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): 2947, Positive cache size: 2940, Positive conditional cache size: 2936, 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, 452 PlacesBefore, 452 PlacesAfterwards, 1165 TransitionsBefore, 1165 TransitionsAfterwards, 3884 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): 2947, Positive cache size: 2940, Positive conditional cache size: 2936, 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: 2.1s, 436 PlacesBefore, 432 PlacesAfterwards, 1421 TransitionsBefore, 1418 TransitionsAfterwards, 4638 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 18, independent: 7, independent conditional: 7, 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): 2958, Positive cache size: 2951, Positive conditional cache size: 2947, 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.5s, 437 PlacesBefore, 434 PlacesAfterwards, 1472 TransitionsBefore, 1469 TransitionsAfterwards, 4828 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: 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): 3106, Positive cache size: 3099, Positive conditional cache size: 3095, 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.4s, 431 PlacesBefore, 431 PlacesAfterwards, 1468 TransitionsBefore, 1468 TransitionsAfterwards, 4798 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: 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): 3112, Positive cache size: 3105, Positive conditional cache size: 3101, 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, 431 PlacesBefore, 431 PlacesAfterwards, 1468 TransitionsBefore, 1468 TransitionsAfterwards, 4782 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): 3112, Positive cache size: 3105, Positive conditional cache size: 3101, 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: 2.8s, 481 PlacesBefore, 479 PlacesAfterwards, 1816 TransitionsBefore, 1814 TransitionsAfterwards, 5970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 14, independent: 11, independent conditional: 11, 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): 3173, Positive cache size: 3166, Positive conditional cache size: 3162, 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: 1.3s, 490 PlacesBefore, 488 PlacesAfterwards, 1830 TransitionsBefore, 1827 TransitionsAfterwards, 6024 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 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: 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: 8, independent: 4, independent conditional: 4, 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): 3198, Positive cache size: 3191, Positive conditional cache size: 3187, 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.5s, 478 PlacesBefore, 478 PlacesAfterwards, 1808 TransitionsBefore, 1808 TransitionsAfterwards, 5944 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): 3199, Positive cache size: 3192, Positive conditional cache size: 3188, 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: 3.1s, 460 PlacesBefore, 455 PlacesAfterwards, 1688 TransitionsBefore, 1684 TransitionsAfterwards, 5554 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 29, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 29, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3682, Positive cache size: 3675, Positive conditional cache size: 3671, 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.7s, 456 PlacesBefore, 453 PlacesAfterwards, 1683 TransitionsBefore, 1680 TransitionsAfterwards, 5524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 3687, Positive cache size: 3680, Positive conditional cache size: 3676, 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, 446 PlacesBefore, 446 PlacesAfterwards, 1678 TransitionsBefore, 1678 TransitionsAfterwards, 5510 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): 3687, Positive cache size: 3680, Positive conditional cache size: 3676, 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, 442 PlacesBefore, 442 PlacesAfterwards, 1676 TransitionsBefore, 1676 TransitionsAfterwards, 5504 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): 3687, Positive cache size: 3680, Positive conditional cache size: 3676, 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.4s, 459 PlacesBefore, 456 PlacesAfterwards, 1688 TransitionsBefore, 1685 TransitionsAfterwards, 5532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 3692, Positive cache size: 3685, Positive conditional cache size: 3681, 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, 452 PlacesBefore, 452 PlacesAfterwards, 1683 TransitionsBefore, 1683 TransitionsAfterwards, 5520 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): 3692, Positive cache size: 3685, Positive conditional cache size: 3681, 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 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - 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 CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - 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 CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - 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: 787.4s, OverallIterations: 139, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 433.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 95 mSolverCounterUnknown, 5565 SdHoareTripleChecker+Valid, 43.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5565 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 38.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 262 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 4870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69778 IncrementalHoareTripleChecker+Invalid, 75005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4870 mSolverCounterUnsat, 1 mSDtfsCounter, 69778 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3579 GetRequests, 1517 SyntacticMatches, 89 SemanticMatches, 1973 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5364 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66855occurred in iteration=130, InterpolantAutomatonStates: 1362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 126.3s InterpolantComputationTime, 3119 NumberOfCodeBlocks, 3119 NumberOfCodeBlocksAsserted, 243 NumberOfCheckSat, 3938 ConstructedInterpolants, 71 QuantifiedInterpolants, 106871 SizeOfPredicates, 1482 NumberOfNonLiveVariables, 20829 ConjunctsInSsa, 3630 ConjunctsInUnsatCore, 306 InterpolantComputations, 58 PerfectInterpolantSequences, 33/593 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