/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:20:37,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:20:37,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:20:38,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:20:38,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:20:38,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:20:38,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:20:38,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:20:38,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:20:38,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:20:38,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:20:38,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:20:38,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:20:38,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:20:38,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:20:38,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:20:38,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:20:38,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:20:38,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:20:38,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:20:38,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:20:38,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:20:38,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:20:38,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:20:38,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:20:38,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:20:38,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:20:38,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:20:38,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:20:38,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:20:38,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:20:38,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:20:38,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:20:38,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:20:38,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:20:38,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:20:38,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:20:38,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:20:38,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:20:38,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:20:38,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:20:38,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:20:38,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:20:38,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:20:38,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:20:38,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:20:38,178 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:20:38,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:20:38,179 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:20:38,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:20:38,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:20:38,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:20:38,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:20:38,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:20:38,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:20:38,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:20:38,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:20:38,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:20:38,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:20:38,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:20:38,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:20:38,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:20:38,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:20:38,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:20:38,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:20:38,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:20:38,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:20:38,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:20:38,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:20:38,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:20:38,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:20:38,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:20:38,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:20:38,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:20:38,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:20:38,743 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:20:38,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2022-12-06 00:20:40,344 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:20:40,758 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:20:40,758 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2022-12-06 00:20:40,783 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993eccfa7/35904c5ce0de4a3299c02a61e24f4e96/FLAGacbd19354 [2022-12-06 00:20:40,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993eccfa7/35904c5ce0de4a3299c02a61e24f4e96 [2022-12-06 00:20:40,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:20:40,822 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:20:40,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:20:40,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:20:40,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:20:40,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:20:40" (1/1) ... [2022-12-06 00:20:40,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e5745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:40, skipping insertion in model container [2022-12-06 00:20:40,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:20:40" (1/1) ... [2022-12-06 00:20:40,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:20:40,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:20:41,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c[3615,3628] [2022-12-06 00:20:41,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:20:41,221 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:20:41,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:41,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:41,269 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c[3615,3628] [2022-12-06 00:20:41,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:20:41,289 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:20:41,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41 WrapperNode [2022-12-06 00:20:41,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:20:41,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:20:41,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:20:41,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:20:41,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,356 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 257 [2022-12-06 00:20:41,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:20:41,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:20:41,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:20:41,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:20:41,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:20:41,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:20:41,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:20:41,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:20:41,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (1/1) ... [2022-12-06 00:20:41,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:20:41,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:41,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:20:41,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:20:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:20:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:20:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:20:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:20:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:20:41,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:20:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:20:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:20:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:20:41,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:20:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:20:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:20:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:20:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:20:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:20:41,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:20:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:20:41,591 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:20:41,784 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:20:41,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:20:42,515 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:20:42,763 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:20:42,763 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 00:20:42,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:20:42 BoogieIcfgContainer [2022-12-06 00:20:42,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:20:42,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:20:42,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:20:42,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:20:42,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:20:40" (1/3) ... [2022-12-06 00:20:42,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c900d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:20:42, skipping insertion in model container [2022-12-06 00:20:42,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:41" (2/3) ... [2022-12-06 00:20:42,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c900d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:20:42, skipping insertion in model container [2022-12-06 00:20:42,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:20:42" (3/3) ... [2022-12-06 00:20:42,788 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2022-12-06 00:20:42,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:20:42,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:20:42,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:20:42,941 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:20:43,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 206 transitions, 436 flow [2022-12-06 00:20:43,206 INFO L130 PetriNetUnfolder]: 18/203 cut-off events. [2022-12-06 00:20:43,207 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:20:43,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 18/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 122 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 165. Up to 3 conditions per place. [2022-12-06 00:20:43,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 206 transitions, 436 flow [2022-12-06 00:20:43,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 193 transitions, 404 flow [2022-12-06 00:20:43,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:43,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 193 transitions, 404 flow [2022-12-06 00:20:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 193 transitions, 404 flow [2022-12-06 00:20:43,384 INFO L130 PetriNetUnfolder]: 18/193 cut-off events. [2022-12-06 00:20:43,385 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:20:43,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 18/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 165. Up to 3 conditions per place. [2022-12-06 00:20:43,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 193 transitions, 404 flow [2022-12-06 00:20:43,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 1880 [2022-12-06 00:20:54,061 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-06 00:20:54,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:20:54,081 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;@e38357f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:20:54,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:20:54,087 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 00:20:54,087 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:20:54,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:54,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:54,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:20:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1670425582, now seen corresponding path program 1 times [2022-12-06 00:20:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:54,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486266759] [2022-12-06 00:20:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486266759] [2022-12-06 00:20:54,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486266759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:54,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:54,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:20:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400087967] [2022-12-06 00:20:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:54,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 00:20:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 00:20:54,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 00:20:54,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 00:20:54,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:54,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:54,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 00:20:54,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:54,514 INFO L130 PetriNetUnfolder]: 323/460 cut-off events. [2022-12-06 00:20:54,515 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-06 00:20:54,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 460 events. 323/460 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1315 event pairs, 190 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 765. Up to 460 conditions per place. [2022-12-06 00:20:54,523 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-06 00:20:54,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 124 flow [2022-12-06 00:20:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 00:20:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 00:20:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2022-12-06 00:20:54,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-06 00:20:54,536 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 2 states and 29 transitions. [2022-12-06 00:20:54,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 124 flow [2022-12-06 00:20:54,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:54,543 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 60 flow [2022-12-06 00:20:54,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-06 00:20:54,548 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2022-12-06 00:20:54,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:54,549 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 60 flow [2022-12-06 00:20:54,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:54,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:54,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 60 flow [2022-12-06 00:20:54,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 27 transitions, 60 flow [2022-12-06 00:20:54,568 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 00:20:54,569 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:20:54,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 5/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2022-12-06 00:20:54,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 27 transitions, 60 flow [2022-12-06 00:20:54,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 00:20:54,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:54,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 00:20:54,650 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 27 transitions, 60 flow [2022-12-06 00:20:54,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:54,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:54,651 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:54,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:20:54,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:20:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 704626681, now seen corresponding path program 1 times [2022-12-06 00:20:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:54,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140965963] [2022-12-06 00:20:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:54,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140965963] [2022-12-06 00:20:54,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140965963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:54,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:54,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:54,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640184593] [2022-12-06 00:20:54,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:54,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:54,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:54,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:54,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 00:20:54,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:54,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:54,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 00:20:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:55,104 INFO L130 PetriNetUnfolder]: 328/479 cut-off events. [2022-12-06 00:20:55,104 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 00:20:55,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 479 events. 328/479 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1428 event pairs, 192 based on Foata normal form. 18/360 useless extension candidates. Maximal degree in co-relation 161. Up to 460 conditions per place. [2022-12-06 00:20:55,108 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 25 selfloop transitions, 2 changer transitions 12/40 dead transitions. [2022-12-06 00:20:55,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 167 flow [2022-12-06 00:20:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 00:20:55,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-06 00:20:55,112 INFO L175 Difference]: Start difference. First operand has 26 places, 27 transitions, 60 flow. Second operand 4 states and 46 transitions. [2022-12-06 00:20:55,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 167 flow [2022-12-06 00:20:55,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 00:20:55,114 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 78 flow [2022-12-06 00:20:55,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2022-12-06 00:20:55,115 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-06 00:20:55,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:55,116 INFO L89 Accepts]: Start accepts. Operand has 31 places, 28 transitions, 78 flow [2022-12-06 00:20:55,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:55,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:55,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 28 transitions, 78 flow [2022-12-06 00:20:55,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 78 flow [2022-12-06 00:20:55,123 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-06 00:20:55,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:20:55,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 35 events. 8/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 46. Up to 9 conditions per place. [2022-12-06 00:20:55,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 78 flow [2022-12-06 00:20:55,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 00:20:56,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:56,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1438 [2022-12-06 00:20:56,553 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 74 flow [2022-12-06 00:20:56,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:56,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:56,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:56,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:20:56,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:20:56,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1044683586, now seen corresponding path program 1 times [2022-12-06 00:20:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:56,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459901263] [2022-12-06 00:20:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:56,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-06 00:20:56,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:56,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459901263] [2022-12-06 00:20:56,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459901263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:56,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:56,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574339744] [2022-12-06 00:20:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:56,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:56,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 00:20:56,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:56,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:56,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 00:20:56,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:56,814 INFO L130 PetriNetUnfolder]: 404/593 cut-off events. [2022-12-06 00:20:56,814 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-06 00:20:56,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 593 events. 404/593 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2008 event pairs, 244 based on Foata normal form. 38/470 useless extension candidates. Maximal degree in co-relation 1450. Up to 460 conditions per place. [2022-12-06 00:20:56,817 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 25 selfloop transitions, 2 changer transitions 13/41 dead transitions. [2022-12-06 00:20:56,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 192 flow [2022-12-06 00:20:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:20:56,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 00:20:56,819 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 74 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:20:56,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 192 flow [2022-12-06 00:20:56,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 184 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:56,820 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 86 flow [2022-12-06 00:20:56,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 00:20:56,821 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2022-12-06 00:20:56,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:56,821 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 86 flow [2022-12-06 00:20:56,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:56,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:56,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 86 flow [2022-12-06 00:20:56,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 86 flow [2022-12-06 00:20:56,830 INFO L130 PetriNetUnfolder]: 16/50 cut-off events. [2022-12-06 00:20:56,830 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:20:56,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 50 events. 16/50 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 3 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 75. Up to 17 conditions per place. [2022-12-06 00:20:56,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 86 flow [2022-12-06 00:20:56,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 00:20:57,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:57,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-06 00:20:57,085 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 82 flow [2022-12-06 00:20:57,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:57,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:57,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:57,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:20:57,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:20:57,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2023811035, now seen corresponding path program 1 times [2022-12-06 00:20:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:57,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735724289] [2022-12-06 00:20:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:57,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735724289] [2022-12-06 00:20:57,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735724289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:57,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:57,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:20:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281434107] [2022-12-06 00:20:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:57,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:20:57,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:57,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:20:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:20:57,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:57,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 82 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:57,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:57,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:57,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:58,501 INFO L130 PetriNetUnfolder]: 536/780 cut-off events. [2022-12-06 00:20:58,502 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-06 00:20:58,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 780 events. 536/780 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2614 event pairs, 7 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 2022. Up to 554 conditions per place. [2022-12-06 00:20:58,506 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 66 selfloop transitions, 28 changer transitions 3/97 dead transitions. [2022-12-06 00:20:58,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 97 transitions, 485 flow [2022-12-06 00:20:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:20:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:20:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-12-06 00:20:58,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40329218106995884 [2022-12-06 00:20:58,509 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 82 flow. Second operand 9 states and 98 transitions. [2022-12-06 00:20:58,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 97 transitions, 485 flow [2022-12-06 00:20:58,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 97 transitions, 477 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:58,514 INFO L231 Difference]: Finished difference. Result has 40 places, 53 transitions, 271 flow [2022-12-06 00:20:58,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=40, PETRI_TRANSITIONS=53} [2022-12-06 00:20:58,516 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-06 00:20:58,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:58,516 INFO L89 Accepts]: Start accepts. Operand has 40 places, 53 transitions, 271 flow [2022-12-06 00:20:58,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:58,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:58,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 53 transitions, 271 flow [2022-12-06 00:20:58,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 53 transitions, 271 flow [2022-12-06 00:20:58,538 INFO L130 PetriNetUnfolder]: 85/163 cut-off events. [2022-12-06 00:20:58,538 INFO L131 PetriNetUnfolder]: For 34/82 co-relation queries the response was YES. [2022-12-06 00:20:58,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 163 events. 85/163 cut-off events. For 34/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 521 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 417. Up to 95 conditions per place. [2022-12-06 00:20:58,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 53 transitions, 271 flow [2022-12-06 00:20:58,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 00:20:58,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-06 00:20:59,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-06 00:20:59,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-06 00:21:00,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-06 00:21:00,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-06 00:21:00,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:00,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-06 00:21:00,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:00,958 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:21:00,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2443 [2022-12-06 00:21:00,959 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 51 transitions, 294 flow [2022-12-06 00:21:00,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:00,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:00,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:00,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:21:00,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash -640341962, now seen corresponding path program 1 times [2022-12-06 00:21:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574493737] [2022-12-06 00:21:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:01,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574493737] [2022-12-06 00:21:01,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574493737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:01,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:01,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:21:01,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557866193] [2022-12-06 00:21:01,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:01,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:01,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:01,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 00:21:01,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 51 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:01,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:01,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 00:21:01,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:01,439 INFO L130 PetriNetUnfolder]: 385/561 cut-off events. [2022-12-06 00:21:01,439 INFO L131 PetriNetUnfolder]: For 467/474 co-relation queries the response was YES. [2022-12-06 00:21:01,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 561 events. 385/561 cut-off events. For 467/474 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1719 event pairs, 73 based on Foata normal form. 21/429 useless extension candidates. Maximal degree in co-relation 1940. Up to 523 conditions per place. [2022-12-06 00:21:01,443 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 50 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2022-12-06 00:21:01,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 408 flow [2022-12-06 00:21:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 00:21:01,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-06 00:21:01,446 INFO L175 Difference]: Start difference. First operand has 38 places, 51 transitions, 294 flow. Second operand 3 states and 49 transitions. [2022-12-06 00:21:01,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 408 flow [2022-12-06 00:21:01,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 342 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:01,463 INFO L231 Difference]: Finished difference. Result has 38 places, 49 transitions, 229 flow [2022-12-06 00:21:01,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=38, PETRI_TRANSITIONS=49} [2022-12-06 00:21:01,466 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-06 00:21:01,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:01,466 INFO L89 Accepts]: Start accepts. Operand has 38 places, 49 transitions, 229 flow [2022-12-06 00:21:01,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:01,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:01,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 49 transitions, 229 flow [2022-12-06 00:21:01,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 49 transitions, 229 flow [2022-12-06 00:21:01,502 INFO L130 PetriNetUnfolder]: 57/120 cut-off events. [2022-12-06 00:21:01,502 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-12-06 00:21:01,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 120 events. 57/120 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 357 event pairs, 5 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 226. Up to 62 conditions per place. [2022-12-06 00:21:01,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 49 transitions, 229 flow [2022-12-06 00:21:01,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 00:21:01,505 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:01,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 00:21:01,507 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 49 transitions, 229 flow [2022-12-06 00:21:01,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:01,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:01,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:01,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:21:01,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash -405527460, now seen corresponding path program 2 times [2022-12-06 00:21:01,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:01,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939501644] [2022-12-06 00:21:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:01,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:02,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:02,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939501644] [2022-12-06 00:21:02,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939501644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:02,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:02,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:02,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977537114] [2022-12-06 00:21:02,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:02,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:02,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:02,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:02,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:02,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 00:21:02,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 49 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:02,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:02,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 00:21:02,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:03,054 INFO L130 PetriNetUnfolder]: 457/670 cut-off events. [2022-12-06 00:21:03,054 INFO L131 PetriNetUnfolder]: For 431/438 co-relation queries the response was YES. [2022-12-06 00:21:03,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 670 events. 457/670 cut-off events. For 431/438 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2120 event pairs, 82 based on Foata normal form. 8/487 useless extension candidates. Maximal degree in co-relation 1636. Up to 587 conditions per place. [2022-12-06 00:21:03,059 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 59 selfloop transitions, 21 changer transitions 3/85 dead transitions. [2022-12-06 00:21:03,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 519 flow [2022-12-06 00:21:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-06 00:21:03,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2847222222222222 [2022-12-06 00:21:03,077 INFO L175 Difference]: Start difference. First operand has 38 places, 49 transitions, 229 flow. Second operand 8 states and 82 transitions. [2022-12-06 00:21:03,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 85 transitions, 519 flow [2022-12-06 00:21:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 496 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 00:21:03,080 INFO L231 Difference]: Finished difference. Result has 47 places, 62 transitions, 358 flow [2022-12-06 00:21:03,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=47, PETRI_TRANSITIONS=62} [2022-12-06 00:21:03,083 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-12-06 00:21:03,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:03,083 INFO L89 Accepts]: Start accepts. Operand has 47 places, 62 transitions, 358 flow [2022-12-06 00:21:03,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:03,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:03,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 62 transitions, 358 flow [2022-12-06 00:21:03,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 62 transitions, 358 flow [2022-12-06 00:21:03,113 INFO L130 PetriNetUnfolder]: 61/134 cut-off events. [2022-12-06 00:21:03,113 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-06 00:21:03,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 134 events. 61/134 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 440 event pairs, 3 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 332. Up to 67 conditions per place. [2022-12-06 00:21:03,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 62 transitions, 358 flow [2022-12-06 00:21:03,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 00:21:03,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [933] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (not (= (ite (and (<= 0 v_~q1_back~0_203) (< v_~q1_back~0_203 v_~n1~0_123)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_53| v_~N~0_97)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (+ v_~q1_back~0_203 1) v_~q1_back~0_202) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (= (select (select |v_#memory_int_291| v_~q1~0.base_120) (+ (* v_~q1_back~0_203 4) v_~q1~0.offset_120)) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= (+ v_~x~0_106 v_~C~0_137) v_~x~0_105) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|)) InVars {~q1~0.offset=v_~q1~0.offset_120, ~C~0=v_~C~0_137, ~q1_back~0=v_~q1_back~0_203, ~n1~0=v_~n1~0_123, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_97, ~x~0=v_~x~0_106} OutVars{~q1~0.offset=v_~q1~0.offset_120, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_19|, ~C~0=v_~C~0_137, ~n1~0=v_~n1~0_123, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, ~N~0=v_~N~0_97, ~q1_back~0=v_~q1_back~0_202, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~x~0=v_~x~0_105, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:03,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [933] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (not (= (ite (and (<= 0 v_~q1_back~0_203) (< v_~q1_back~0_203 v_~n1~0_123)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_53| v_~N~0_97)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (+ v_~q1_back~0_203 1) v_~q1_back~0_202) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (= (select (select |v_#memory_int_291| v_~q1~0.base_120) (+ (* v_~q1_back~0_203 4) v_~q1~0.offset_120)) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= (+ v_~x~0_106 v_~C~0_137) v_~x~0_105) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|)) InVars {~q1~0.offset=v_~q1~0.offset_120, ~C~0=v_~C~0_137, ~q1_back~0=v_~q1_back~0_203, ~n1~0=v_~n1~0_123, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_97, ~x~0=v_~x~0_106} OutVars{~q1~0.offset=v_~q1~0.offset_120, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_19|, ~C~0=v_~C~0_137, ~n1~0=v_~n1~0_123, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, ~N~0=v_~N~0_97, ~q1_back~0=v_~q1_back~0_202, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~x~0=v_~x~0_105, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:03,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [934] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_55| 0) (= v_~z~0_127 (+ v_~z~0_128 v_~C~0_139)) (= v_~t~0_138 (+ v_~t~0_139 |v_thread3Thread1of1ForFork0_~k~0#1_77|)) (= |v_thread3Thread1of1ForFork0_#res#1.base_35| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_35| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_77| 0) (= (+ v_~q2_front~0_169 1) v_~q2_front~0_168) (= (select (select |v_#memory_int_293| v_~q2~0.base_131) (+ v_~q2~0.offset_131 (* v_~q2_front~0_169 4))) |v_thread3Thread1of1ForFork0_~k~0#1_77|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (and (< v_~q2_front~0_169 v_~q2_back~0_206) (< v_~q2_front~0_169 v_~n2~0_158) (<= 0 v_~q2_front~0_169)) 1 0))) InVars {~n2~0=v_~n2~0_158, ~C~0=v_~C~0_139, ~q2~0.offset=v_~q2~0.offset_131, #memory_int=|v_#memory_int_293|, ~q2_front~0=v_~q2_front~0_169, ~q2~0.base=v_~q2~0.base_131, ~z~0=v_~z~0_128, ~q2_back~0=v_~q2_back~0_206, ~t~0=v_~t~0_139} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_49|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~n2~0=v_~n2~0_158, ~C~0=v_~C~0_139, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, ~q2~0.offset=v_~q2~0.offset_131, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_35|, ~q2_front~0=v_~q2_front~0_168, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_35|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_55|, #memory_int=|v_#memory_int_293|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_49|, ~q2~0.base=v_~q2~0.base_131, ~z~0=v_~z~0_127, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_77|, ~q2_back~0=v_~q2_back~0_206, ~t~0=v_~t~0_138} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:03,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [930] $Ultimate##0-->L94-2: Formula: (and (= v_~t~0_134 (+ v_~t~0_135 |v_thread3Thread1of1ForFork0_~k~0#1_75|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| (ite (and (<= 0 v_~q2_front~0_165) (< v_~q2_front~0_165 v_~n2~0_154) (< v_~q2_front~0_165 v_~q2_back~0_200)) 1 0)) (= v_~q2_front~0_164 (+ v_~q2_front~0_165 1)) (= (+ v_~z~0_124 v_~C~0_131) v_~z~0_123) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_75| 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_75| (select (select |v_#memory_int_285| v_~q2~0.base_127) (+ v_~q2~0.offset_127 (* v_~q2_front~0_165 4)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_45| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_47|)) InVars {~n2~0=v_~n2~0_154, ~C~0=v_~C~0_131, ~q2~0.offset=v_~q2~0.offset_127, #memory_int=|v_#memory_int_285|, ~q2_front~0=v_~q2_front~0_165, ~q2~0.base=v_~q2~0.base_127, ~z~0=v_~z~0_124, ~q2_back~0=v_~q2_back~0_200, ~t~0=v_~t~0_135} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_47|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|, ~n2~0=v_~n2~0_154, ~C~0=v_~C~0_131, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_47|, ~q2~0.offset=v_~q2~0.offset_127, ~q2_front~0=v_~q2_front~0_164, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_45|, #memory_int=|v_#memory_int_285|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_47|, ~q2~0.base=v_~q2~0.base_127, ~z~0=v_~z~0_123, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_75|, ~q2_back~0=v_~q2_back~0_200, ~t~0=v_~t~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:03,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [933] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (not (= (ite (and (<= 0 v_~q1_back~0_203) (< v_~q1_back~0_203 v_~n1~0_123)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_53| v_~N~0_97)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (+ v_~q1_back~0_203 1) v_~q1_back~0_202) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (= (select (select |v_#memory_int_291| v_~q1~0.base_120) (+ (* v_~q1_back~0_203 4) v_~q1~0.offset_120)) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= (+ v_~x~0_106 v_~C~0_137) v_~x~0_105) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|)) InVars {~q1~0.offset=v_~q1~0.offset_120, ~C~0=v_~C~0_137, ~q1_back~0=v_~q1_back~0_203, ~n1~0=v_~n1~0_123, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_97, ~x~0=v_~x~0_106} OutVars{~q1~0.offset=v_~q1~0.offset_120, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_19|, ~C~0=v_~C~0_137, ~n1~0=v_~n1~0_123, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, ~N~0=v_~N~0_97, ~q1_back~0=v_~q1_back~0_202, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~x~0=v_~x~0_105, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:21:04,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [931] $Ultimate##0-->L49-5: Formula: (and (not (= (ite (and (< v_~q1_back~0_199 v_~n1~0_121) (<= 0 v_~q1_back~0_199)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_287| v_~q1~0.base_118) (+ (* v_~q1_back~0_199 4) v_~q1~0.offset_118)) 1) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (= |v_thread1Thread1of1ForFork1_~i~0#1_47| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= (+ v_~q1_back~0_199 1) v_~q1_back~0_198) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_47| (+ 1 v_~N~0_95)) (= (+ v_~x~0_102 v_~C~0_133) v_~x~0_101)) InVars {~q1~0.offset=v_~q1~0.offset_118, ~C~0=v_~C~0_133, ~q1_back~0=v_~q1_back~0_199, ~n1~0=v_~n1~0_121, ~q1~0.base=v_~q1~0.base_118, #memory_int=|v_#memory_int_287|, ~N~0=v_~N~0_95, ~x~0=v_~x~0_102} OutVars{~q1~0.offset=v_~q1~0.offset_118, ~C~0=v_~C~0_133, ~n1~0=v_~n1~0_121, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_23|, ~N~0=v_~N~0_95, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_25|, ~q1_back~0=v_~q1_back~0_198, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_23|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~q1~0.base=v_~q1~0.base_118, #memory_int=|v_#memory_int_287|, ~x~0=v_~x~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:21:04,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [935] $Ultimate##0-->L94-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_21| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|) (= v_~t~0_142 (+ v_~t~0_143 |v_thread3Thread1of1ForFork0_~k~0#1_79|)) (= (+ v_~x~0_110 v_~C~0_141) v_~x~0_109) (= (+ v_~q1_back~0_207 1) v_~q1_back~0_206) (= (select (select |v_#memory_int_295| v_~q2~0.base_133) (+ v_~q2~0.offset_133 (* v_~q2_front~0_173 4))) |v_thread3Thread1of1ForFork0_~k~0#1_79|) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_57| v_~N~0_99)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| (ite (= (select (select |v_#memory_int_295| v_~q1~0.base_122) (+ (* v_~q1_back~0_207 4) v_~q1~0.offset_122)) 0) 1 0)) (= (+ v_~q2_front~0_173 1) v_~q2_front~0_172) (= (+ v_~z~0_132 v_~C~0_141) v_~z~0_131) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_79| 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_57| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_21| 0) (not (= (ite (and (<= 0 v_~q1_back~0_207) (< v_~q1_back~0_207 v_~n1~0_125)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (and (<= 0 v_~q2_front~0_173) (< v_~q2_front~0_173 v_~n2~0_160) (< v_~q2_front~0_173 v_~q2_back~0_208)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0))) InVars {~q1~0.offset=v_~q1~0.offset_122, ~n2~0=v_~n2~0_160, ~C~0=v_~C~0_141, ~q2~0.offset=v_~q2~0.offset_133, ~n1~0=v_~n1~0_125, ~q2_front~0=v_~q2_front~0_173, ~N~0=v_~N~0_99, ~q1_back~0=v_~q1_back~0_207, ~q1~0.base=v_~q1~0.base_122, #memory_int=|v_#memory_int_295|, ~q2~0.base=v_~q2~0.base_133, ~z~0=v_~z~0_132, ~x~0=v_~x~0_110, ~q2_back~0=v_~q2_back~0_208, ~t~0=v_~t~0_143} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_51|, ~q2~0.offset=v_~q2~0.offset_133, ~n1~0=v_~n1~0_125, ~q1_back~0=v_~q1_back~0_206, ~q1~0.base=v_~q1~0.base_122, ~q2~0.base=v_~q2~0.base_133, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_21|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_79|, ~q2_back~0=v_~q2_back~0_208, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1~0.offset=v_~q1~0.offset_122, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_21|, ~n2~0=v_~n2~0_160, ~C~0=v_~C~0_141, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_21|, ~q2_front~0=v_~q2_front~0_172, ~N~0=v_~N~0_99, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_57|, #memory_int=|v_#memory_int_295|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_51|, ~z~0=v_~z~0_131, ~x~0=v_~x~0_109, ~t~0=v_~t~0_142} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post5#1, ~q2_front~0, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#t~post11#1, thread1Thread1of1ForFork1_#res#1.offset, ~z~0, thread1Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork0_~k~0#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] [2022-12-06 00:21:04,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [936] $Ultimate##0-->thread3EXIT: Formula: (and (= v_~z~0_135 (+ v_~z~0_136 v_~C~0_143)) (= |v_thread3Thread1of1ForFork0_~k~0#1_81| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= (ite (and (<= 0 v_~q2_front~0_177) (< v_~q2_front~0_177 v_~n2~0_162) (< v_~q2_front~0_177 v_~q2_back~0_210)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread3Thread1of1ForFork0_#res#1.base_37| 0) (= v_~t~0_146 (+ v_~t~0_147 |v_thread3Thread1of1ForFork0_~k~0#1_81|)) (= |v_thread1Thread1of1ForFork1_~i~0#1_59| 0) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_59| v_~N~0_101)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| (ite (= (select (select |v_#memory_int_297| v_~q1~0.base_124) (+ (* v_~q1_back~0_211 4) v_~q1~0.offset_124)) 0) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_81| (select (select |v_#memory_int_297| v_~q2~0.base_135) (+ (* v_~q2_front~0_177 4) v_~q2~0.offset_135))) (= (+ v_~q1_back~0_211 1) v_~q1_back~0_210) (= |v_thread3Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~q2_front~0_176 (+ v_~q2_front~0_177 1)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_23| 0) (= v_~x~0_113 (+ v_~x~0_114 v_~C~0_143)) (not (= (ite (and (<= 0 v_~q1_back~0_211) (< v_~q1_back~0_211 v_~n1~0_127)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_23| 0)) InVars {~q1~0.offset=v_~q1~0.offset_124, ~n2~0=v_~n2~0_162, ~C~0=v_~C~0_143, ~q2~0.offset=v_~q2~0.offset_135, ~n1~0=v_~n1~0_127, ~q2_front~0=v_~q2_front~0_177, ~N~0=v_~N~0_101, ~q1_back~0=v_~q1_back~0_211, ~q1~0.base=v_~q1~0.base_124, #memory_int=|v_#memory_int_297|, ~q2~0.base=v_~q2~0.base_135, ~z~0=v_~z~0_136, ~x~0=v_~x~0_114, ~q2_back~0=v_~q2_back~0_210, ~t~0=v_~t~0_147} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_53|, ~q2~0.offset=v_~q2~0.offset_135, ~n1~0=v_~n1~0_127, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_37|, ~q1_back~0=v_~q1_back~0_210, ~q1~0.base=v_~q1~0.base_124, ~q2~0.base=v_~q2~0.base_135, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_23|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_23|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_81|, ~q2_back~0=v_~q2_back~0_210, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~q1~0.offset=v_~q1~0.offset_124, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_23|, ~n2~0=v_~n2~0_162, ~C~0=v_~C~0_143, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_23|, ~q2_front~0=v_~q2_front~0_176, ~N~0=v_~N~0_101, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_37|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_59|, #memory_int=|v_#memory_int_297|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_53|, ~z~0=v_~z~0_135, ~x~0=v_~x~0_113, ~t~0=v_~t~0_146} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#t~post11#1, thread1Thread1of1ForFork1_#res#1.offset, ~z~0, thread1Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork0_~k~0#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] [2022-12-06 00:21:04,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-06 00:21:05,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-06 00:21:05,579 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:21:05,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2497 [2022-12-06 00:21:05,580 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 61 transitions, 399 flow [2022-12-06 00:21:05,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:05,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:05,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:05,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:21:05,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 630358944, now seen corresponding path program 3 times [2022-12-06 00:21:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:05,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243171325] [2022-12-06 00:21:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:05,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:06,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243171325] [2022-12-06 00:21:06,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243171325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:06,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:06,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349240689] [2022-12-06 00:21:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:06,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:06,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:06,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:06,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 00:21:06,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 61 transitions, 399 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:06,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:06,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 00:21:06,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:06,988 INFO L130 PetriNetUnfolder]: 439/652 cut-off events. [2022-12-06 00:21:06,988 INFO L131 PetriNetUnfolder]: For 515/522 co-relation queries the response was YES. [2022-12-06 00:21:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 652 events. 439/652 cut-off events. For 515/522 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2174 event pairs, 35 based on Foata normal form. 8/485 useless extension candidates. Maximal degree in co-relation 2186. Up to 504 conditions per place. [2022-12-06 00:21:06,994 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 60 selfloop transitions, 32 changer transitions 5/98 dead transitions. [2022-12-06 00:21:06,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 712 flow [2022-12-06 00:21:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 00:21:06,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 00:21:06,997 INFO L175 Difference]: Start difference. First operand has 46 places, 61 transitions, 399 flow. Second operand 8 states and 96 transitions. [2022-12-06 00:21:06,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 712 flow [2022-12-06 00:21:07,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 657 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:07,006 INFO L231 Difference]: Finished difference. Result has 53 places, 66 transitions, 475 flow [2022-12-06 00:21:07,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=53, PETRI_TRANSITIONS=66} [2022-12-06 00:21:07,007 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-06 00:21:07,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:07,007 INFO L89 Accepts]: Start accepts. Operand has 53 places, 66 transitions, 475 flow [2022-12-06 00:21:07,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:07,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:07,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 66 transitions, 475 flow [2022-12-06 00:21:07,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 66 transitions, 475 flow [2022-12-06 00:21:07,029 INFO L130 PetriNetUnfolder]: 64/144 cut-off events. [2022-12-06 00:21:07,029 INFO L131 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2022-12-06 00:21:07,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 144 events. 64/144 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 500 event pairs, 1 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 374. Up to 59 conditions per place. [2022-12-06 00:21:07,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 66 transitions, 475 flow [2022-12-06 00:21:07,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-06 00:21:07,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-06 00:21:07,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= v_~q2_front~0_Out_26 (+ v_~q2_front~0_In_3 1)) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| (select (select |v_#memory_int_In_26| v_~q2~0.base_In_2) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_2))) (= (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| v_~t~0_In_6) v_~t~0_Out_24) (= (+ v_~C~0_In_10 v_~z~0_In_7) v_~z~0_Out_18) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_6) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_2)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, ~q2~0.offset=v_~q2~0.offset_In_2, ~q2_front~0=v_~q2_front~0_In_3, #memory_int=|v_#memory_int_In_26|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_In_7, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_In_6} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_4|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~n2~0=v_~n2~0_In_6, ~C~0=v_~C~0_In_10, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, ~q2~0.offset=v_~q2~0.offset_In_2, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, ~q2_front~0=v_~q2_front~0_Out_26, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, #memory_int=|v_#memory_int_In_26|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_4|, ~q2~0.base=v_~q2~0.base_In_2, ~z~0=v_~z~0_Out_18, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_2, ~t~0=v_~t~0_Out_24} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-06 00:21:07,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:07,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 490 [2022-12-06 00:21:07,497 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 65 transitions, 478 flow [2022-12-06 00:21:07,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:07,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:07,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:07,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:21:07,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 896236631, now seen corresponding path program 1 times [2022-12-06 00:21:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:07,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475098061] [2022-12-06 00:21:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:07,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-06 00:21:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475098061] [2022-12-06 00:21:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475098061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:07,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:07,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:21:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473699182] [2022-12-06 00:21:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:07,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 00:21:07,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 65 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:07,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:07,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 00:21:07,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:07,831 INFO L130 PetriNetUnfolder]: 405/602 cut-off events. [2022-12-06 00:21:07,831 INFO L131 PetriNetUnfolder]: For 968/968 co-relation queries the response was YES. [2022-12-06 00:21:07,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 602 events. 405/602 cut-off events. For 968/968 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1914 event pairs, 64 based on Foata normal form. 24/481 useless extension candidates. Maximal degree in co-relation 2281. Up to 446 conditions per place. [2022-12-06 00:21:07,835 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 55 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2022-12-06 00:21:07,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 548 flow [2022-12-06 00:21:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 00:21:07,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-06 00:21:07,837 INFO L175 Difference]: Start difference. First operand has 50 places, 65 transitions, 478 flow. Second operand 3 states and 60 transitions. [2022-12-06 00:21:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 548 flow [2022-12-06 00:21:07,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 470 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-06 00:21:07,841 INFO L231 Difference]: Finished difference. Result has 44 places, 56 transitions, 349 flow [2022-12-06 00:21:07,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=44, PETRI_TRANSITIONS=56} [2022-12-06 00:21:07,841 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-12-06 00:21:07,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:07,842 INFO L89 Accepts]: Start accepts. Operand has 44 places, 56 transitions, 349 flow [2022-12-06 00:21:07,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:07,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:07,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 56 transitions, 349 flow [2022-12-06 00:21:07,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 56 transitions, 349 flow [2022-12-06 00:21:07,857 INFO L130 PetriNetUnfolder]: 46/113 cut-off events. [2022-12-06 00:21:07,857 INFO L131 PetriNetUnfolder]: For 67/68 co-relation queries the response was YES. [2022-12-06 00:21:07,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 113 events. 46/113 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 379 event pairs, 2 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 279. Up to 49 conditions per place. [2022-12-06 00:21:07,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 56 transitions, 349 flow [2022-12-06 00:21:07,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 00:21:07,860 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:07,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 00:21:07,861 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 56 transitions, 349 flow [2022-12-06 00:21:07,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:07,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:07,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:21:07,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2137701280, now seen corresponding path program 1 times [2022-12-06 00:21:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:07,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531081894] [2022-12-06 00:21:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:07,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531081894] [2022-12-06 00:21:07,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531081894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:07,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:07,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:07,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427540779] [2022-12-06 00:21:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:08,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:08,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:08,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:08,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:21:08,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 56 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:08,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:08,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:21:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:08,292 INFO L130 PetriNetUnfolder]: 609/922 cut-off events. [2022-12-06 00:21:08,292 INFO L131 PetriNetUnfolder]: For 852/852 co-relation queries the response was YES. [2022-12-06 00:21:08,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 922 events. 609/922 cut-off events. For 852/852 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3422 event pairs, 92 based on Foata normal form. 20/707 useless extension candidates. Maximal degree in co-relation 2790. Up to 335 conditions per place. [2022-12-06 00:21:08,298 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 62 selfloop transitions, 23 changer transitions 3/88 dead transitions. [2022-12-06 00:21:08,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 88 transitions, 641 flow [2022-12-06 00:21:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 00:21:08,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-06 00:21:08,300 INFO L175 Difference]: Start difference. First operand has 43 places, 56 transitions, 349 flow. Second operand 4 states and 73 transitions. [2022-12-06 00:21:08,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 88 transitions, 641 flow [2022-12-06 00:21:08,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 88 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:21:08,303 INFO L231 Difference]: Finished difference. Result has 47 places, 59 transitions, 437 flow [2022-12-06 00:21:08,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=437, PETRI_PLACES=47, PETRI_TRANSITIONS=59} [2022-12-06 00:21:08,306 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-12-06 00:21:08,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:08,306 INFO L89 Accepts]: Start accepts. Operand has 47 places, 59 transitions, 437 flow [2022-12-06 00:21:08,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:08,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:08,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 59 transitions, 437 flow [2022-12-06 00:21:08,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 59 transitions, 437 flow [2022-12-06 00:21:08,353 INFO L130 PetriNetUnfolder]: 51/144 cut-off events. [2022-12-06 00:21:08,353 INFO L131 PetriNetUnfolder]: For 153/154 co-relation queries the response was YES. [2022-12-06 00:21:08,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 144 events. 51/144 cut-off events. For 153/154 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 563 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 444. Up to 72 conditions per place. [2022-12-06 00:21:08,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 59 transitions, 437 flow [2022-12-06 00:21:08,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 00:21:08,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-06 00:21:08,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:08,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 00:21:08,585 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 59 transitions, 444 flow [2022-12-06 00:21:08,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:08,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:08,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:08,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:21:08,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -206947744, now seen corresponding path program 1 times [2022-12-06 00:21:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:08,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56446010] [2022-12-06 00:21:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:08,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:08,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56446010] [2022-12-06 00:21:08,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56446010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:08,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:08,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852459047] [2022-12-06 00:21:08,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:08,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:08,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:21:08,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 59 transitions, 444 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:08,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:08,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:21:08,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:09,168 INFO L130 PetriNetUnfolder]: 854/1343 cut-off events. [2022-12-06 00:21:09,168 INFO L131 PetriNetUnfolder]: For 2541/2541 co-relation queries the response was YES. [2022-12-06 00:21:09,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5248 conditions, 1343 events. 854/1343 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5618 event pairs, 308 based on Foata normal form. 58/1096 useless extension candidates. Maximal degree in co-relation 4602. Up to 870 conditions per place. [2022-12-06 00:21:09,178 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 85 selfloop transitions, 4 changer transitions 12/101 dead transitions. [2022-12-06 00:21:09,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 101 transitions, 885 flow [2022-12-06 00:21:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 00:21:09,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.435 [2022-12-06 00:21:09,192 INFO L175 Difference]: Start difference. First operand has 47 places, 59 transitions, 444 flow. Second operand 5 states and 87 transitions. [2022-12-06 00:21:09,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 101 transitions, 885 flow [2022-12-06 00:21:09,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 853 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-12-06 00:21:09,223 INFO L231 Difference]: Finished difference. Result has 54 places, 62 transitions, 507 flow [2022-12-06 00:21:09,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=54, PETRI_TRANSITIONS=62} [2022-12-06 00:21:09,224 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2022-12-06 00:21:09,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:09,225 INFO L89 Accepts]: Start accepts. Operand has 54 places, 62 transitions, 507 flow [2022-12-06 00:21:09,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:09,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:09,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 62 transitions, 507 flow [2022-12-06 00:21:09,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 62 transitions, 507 flow [2022-12-06 00:21:09,283 INFO L130 PetriNetUnfolder]: 58/196 cut-off events. [2022-12-06 00:21:09,283 INFO L131 PetriNetUnfolder]: For 289/291 co-relation queries the response was YES. [2022-12-06 00:21:09,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 196 events. 58/196 cut-off events. For 289/291 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 934 event pairs, 4 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 559. Up to 81 conditions per place. [2022-12-06 00:21:09,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 62 transitions, 507 flow [2022-12-06 00:21:09,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 00:21:10,399 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:10,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1175 [2022-12-06 00:21:10,400 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 504 flow [2022-12-06 00:21:10,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:10,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:10,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:10,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:21:10,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2133579193, now seen corresponding path program 1 times [2022-12-06 00:21:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:10,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45118104] [2022-12-06 00:21:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:10,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45118104] [2022-12-06 00:21:10,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45118104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:10,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:10,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851187850] [2022-12-06 00:21:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:10,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:10,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:21:10,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:10,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:10,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:21:10,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:10,930 INFO L130 PetriNetUnfolder]: 1118/1834 cut-off events. [2022-12-06 00:21:10,930 INFO L131 PetriNetUnfolder]: For 3870/3870 co-relation queries the response was YES. [2022-12-06 00:21:10,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7538 conditions, 1834 events. 1118/1834 cut-off events. For 3870/3870 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8767 event pairs, 428 based on Foata normal form. 98/1556 useless extension candidates. Maximal degree in co-relation 6744. Up to 1113 conditions per place. [2022-12-06 00:21:10,944 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 5 changer transitions 28/146 dead transitions. [2022-12-06 00:21:10,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 146 transitions, 1387 flow [2022-12-06 00:21:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-06 00:21:10,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3832752613240418 [2022-12-06 00:21:10,945 INFO L175 Difference]: Start difference. First operand has 53 places, 61 transitions, 504 flow. Second operand 7 states and 110 transitions. [2022-12-06 00:21:10,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 146 transitions, 1387 flow [2022-12-06 00:21:10,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 146 transitions, 1291 flow, removed 46 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:10,964 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 523 flow [2022-12-06 00:21:10,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=523, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2022-12-06 00:21:10,965 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2022-12-06 00:21:10,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:10,965 INFO L89 Accepts]: Start accepts. Operand has 61 places, 65 transitions, 523 flow [2022-12-06 00:21:10,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:10,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:10,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 65 transitions, 523 flow [2022-12-06 00:21:10,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 523 flow [2022-12-06 00:21:11,000 INFO L130 PetriNetUnfolder]: 86/280 cut-off events. [2022-12-06 00:21:11,000 INFO L131 PetriNetUnfolder]: For 429/466 co-relation queries the response was YES. [2022-12-06 00:21:11,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 280 events. 86/280 cut-off events. For 429/466 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1498 event pairs, 4 based on Foata normal form. 3/212 useless extension candidates. Maximal degree in co-relation 804. Up to 120 conditions per place. [2022-12-06 00:21:11,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 65 transitions, 523 flow [2022-12-06 00:21:11,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 00:21:15,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:15,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4279 [2022-12-06 00:21:15,244 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 65 transitions, 539 flow [2022-12-06 00:21:15,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:15,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:15,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:15,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:21:15,245 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1107048929, now seen corresponding path program 1 times [2022-12-06 00:21:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:15,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117409362] [2022-12-06 00:21:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:15,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117409362] [2022-12-06 00:21:15,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117409362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:15,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:15,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403008211] [2022-12-06 00:21:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:15,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:15,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:15,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:15,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:21:15,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 65 transitions, 539 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:15,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:15,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:21:15,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:16,256 INFO L130 PetriNetUnfolder]: 1163/1848 cut-off events. [2022-12-06 00:21:16,256 INFO L131 PetriNetUnfolder]: For 4220/4220 co-relation queries the response was YES. [2022-12-06 00:21:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7941 conditions, 1848 events. 1163/1848 cut-off events. For 4220/4220 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8445 event pairs, 162 based on Foata normal form. 16/1481 useless extension candidates. Maximal degree in co-relation 7208. Up to 1192 conditions per place. [2022-12-06 00:21:16,272 INFO L137 encePairwiseOnDemand]: 21/43 looper letters, 79 selfloop transitions, 35 changer transitions 1/115 dead transitions. [2022-12-06 00:21:16,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 1036 flow [2022-12-06 00:21:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 00:21:16,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3023255813953488 [2022-12-06 00:21:16,274 INFO L175 Difference]: Start difference. First operand has 59 places, 65 transitions, 539 flow. Second operand 7 states and 91 transitions. [2022-12-06 00:21:16,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 1036 flow [2022-12-06 00:21:16,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 115 transitions, 978 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-12-06 00:21:16,287 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 762 flow [2022-12-06 00:21:16,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=762, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2022-12-06 00:21:16,288 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2022-12-06 00:21:16,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:16,288 INFO L89 Accepts]: Start accepts. Operand has 67 places, 80 transitions, 762 flow [2022-12-06 00:21:16,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:16,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:16,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 80 transitions, 762 flow [2022-12-06 00:21:16,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 80 transitions, 762 flow [2022-12-06 00:21:16,347 INFO L130 PetriNetUnfolder]: 181/465 cut-off events. [2022-12-06 00:21:16,347 INFO L131 PetriNetUnfolder]: For 1037/1097 co-relation queries the response was YES. [2022-12-06 00:21:16,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 465 events. 181/465 cut-off events. For 1037/1097 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2556 event pairs, 12 based on Foata normal form. 10/410 useless extension candidates. Maximal degree in co-relation 1606. Up to 145 conditions per place. [2022-12-06 00:21:16,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 80 transitions, 762 flow [2022-12-06 00:21:16,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-06 00:21:25,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:25,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9426 [2022-12-06 00:21:25,714 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 787 flow [2022-12-06 00:21:25,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:25,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:25,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:25,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:21:25,715 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1531388098, now seen corresponding path program 1 times [2022-12-06 00:21:25,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:25,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826489892] [2022-12-06 00:21:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:25,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826489892] [2022-12-06 00:21:25,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826489892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:25,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:25,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582716805] [2022-12-06 00:21:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:25,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:25,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:21:25,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 787 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:25,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:25,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:21:25,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:26,578 INFO L130 PetriNetUnfolder]: 1741/2765 cut-off events. [2022-12-06 00:21:26,578 INFO L131 PetriNetUnfolder]: For 9167/9167 co-relation queries the response was YES. [2022-12-06 00:21:26,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12406 conditions, 2765 events. 1741/2765 cut-off events. For 9167/9167 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13579 event pairs, 252 based on Foata normal form. 82/2386 useless extension candidates. Maximal degree in co-relation 12219. Up to 1253 conditions per place. [2022-12-06 00:21:26,623 INFO L137 encePairwiseOnDemand]: 32/45 looper letters, 91 selfloop transitions, 16 changer transitions 16/123 dead transitions. [2022-12-06 00:21:26,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1272 flow [2022-12-06 00:21:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 00:21:26,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 00:21:26,624 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 787 flow. Second operand 4 states and 76 transitions. [2022-12-06 00:21:26,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1272 flow [2022-12-06 00:21:26,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 123 transitions, 1214 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:26,663 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 469 flow [2022-12-06 00:21:26,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2022-12-06 00:21:26,664 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2022-12-06 00:21:26,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:26,665 INFO L89 Accepts]: Start accepts. Operand has 68 places, 57 transitions, 469 flow [2022-12-06 00:21:26,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:26,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:26,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 57 transitions, 469 flow [2022-12-06 00:21:26,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 469 flow [2022-12-06 00:21:26,782 INFO L130 PetriNetUnfolder]: 199/559 cut-off events. [2022-12-06 00:21:26,782 INFO L131 PetriNetUnfolder]: For 1159/1269 co-relation queries the response was YES. [2022-12-06 00:21:26,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 559 events. 199/559 cut-off events. For 1159/1269 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3220 event pairs, 14 based on Foata normal form. 13/465 useless extension candidates. Maximal degree in co-relation 2144. Up to 187 conditions per place. [2022-12-06 00:21:26,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 57 transitions, 469 flow [2022-12-06 00:21:26,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 00:21:26,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:26,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 00:21:26,806 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 469 flow [2022-12-06 00:21:26,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:26,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:26,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:26,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:21:26,807 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash -607988281, now seen corresponding path program 1 times [2022-12-06 00:21:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:26,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136388042] [2022-12-06 00:21:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:27,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136388042] [2022-12-06 00:21:27,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136388042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:27,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087434313] [2022-12-06 00:21:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:27,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:27,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:21:27,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:27,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:27,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:21:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:28,128 INFO L130 PetriNetUnfolder]: 2007/3214 cut-off events. [2022-12-06 00:21:28,129 INFO L131 PetriNetUnfolder]: For 12863/12863 co-relation queries the response was YES. [2022-12-06 00:21:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15624 conditions, 3214 events. 2007/3214 cut-off events. For 12863/12863 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16359 event pairs, 505 based on Foata normal form. 60/2713 useless extension candidates. Maximal degree in co-relation 15350. Up to 2293 conditions per place. [2022-12-06 00:21:28,155 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 89 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2022-12-06 00:21:28,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 948 flow [2022-12-06 00:21:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 00:21:28,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2022-12-06 00:21:28,156 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 469 flow. Second operand 6 states and 79 transitions. [2022-12-06 00:21:28,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 948 flow [2022-12-06 00:21:28,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 896 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 00:21:28,170 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 544 flow [2022-12-06 00:21:28,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2022-12-06 00:21:28,170 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2022-12-06 00:21:28,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:28,171 INFO L89 Accepts]: Start accepts. Operand has 60 places, 61 transitions, 544 flow [2022-12-06 00:21:28,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:28,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:28,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 61 transitions, 544 flow [2022-12-06 00:21:28,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 544 flow [2022-12-06 00:21:28,262 INFO L130 PetriNetUnfolder]: 211/685 cut-off events. [2022-12-06 00:21:28,262 INFO L131 PetriNetUnfolder]: For 2293/2385 co-relation queries the response was YES. [2022-12-06 00:21:28,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 685 events. 211/685 cut-off events. For 2293/2385 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4682 event pairs, 18 based on Foata normal form. 18/566 useless extension candidates. Maximal degree in co-relation 1202. Up to 207 conditions per place. [2022-12-06 00:21:28,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 61 transitions, 544 flow [2022-12-06 00:21:28,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 00:21:28,274 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:28,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 00:21:28,274 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 544 flow [2022-12-06 00:21:28,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:28,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:28,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:28,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:21:28,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash 613842401, now seen corresponding path program 2 times [2022-12-06 00:21:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:28,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172475443] [2022-12-06 00:21:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:28,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:28,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172475443] [2022-12-06 00:21:28,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172475443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:28,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:28,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865338914] [2022-12-06 00:21:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:28,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:28,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:28,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:21:28,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:28,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:28,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:21:28,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:29,165 INFO L130 PetriNetUnfolder]: 1927/3032 cut-off events. [2022-12-06 00:21:29,165 INFO L131 PetriNetUnfolder]: For 14249/14249 co-relation queries the response was YES. [2022-12-06 00:21:29,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14824 conditions, 3032 events. 1927/3032 cut-off events. For 14249/14249 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14951 event pairs, 330 based on Foata normal form. 64/2551 useless extension candidates. Maximal degree in co-relation 4885. Up to 1748 conditions per place. [2022-12-06 00:21:29,189 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 94 selfloop transitions, 24 changer transitions 10/128 dead transitions. [2022-12-06 00:21:29,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 128 transitions, 1220 flow [2022-12-06 00:21:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-12-06 00:21:29,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 00:21:29,191 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 544 flow. Second operand 8 states and 93 transitions. [2022-12-06 00:21:29,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 128 transitions, 1220 flow [2022-12-06 00:21:29,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 128 transitions, 1152 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:29,208 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 621 flow [2022-12-06 00:21:29,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=621, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2022-12-06 00:21:29,209 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-12-06 00:21:29,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:29,209 INFO L89 Accepts]: Start accepts. Operand has 66 places, 66 transitions, 621 flow [2022-12-06 00:21:29,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:29,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:29,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 66 transitions, 621 flow [2022-12-06 00:21:29,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 621 flow [2022-12-06 00:21:29,281 INFO L130 PetriNetUnfolder]: 233/663 cut-off events. [2022-12-06 00:21:29,281 INFO L131 PetriNetUnfolder]: For 1945/1986 co-relation queries the response was YES. [2022-12-06 00:21:29,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 663 events. 233/663 cut-off events. For 1945/1986 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4235 event pairs, 22 based on Foata normal form. 15/546 useless extension candidates. Maximal degree in co-relation 1728. Up to 235 conditions per place. [2022-12-06 00:21:29,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 621 flow [2022-12-06 00:21:29,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 00:21:29,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:29,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 00:21:29,293 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 621 flow [2022-12-06 00:21:29,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:29,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:29,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:29,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:21:29,293 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1356895717, now seen corresponding path program 1 times [2022-12-06 00:21:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684963648] [2022-12-06 00:21:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:29,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684963648] [2022-12-06 00:21:29,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684963648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:29,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:29,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500493920] [2022-12-06 00:21:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:29,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:29,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:21:29,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 621 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:29,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:29,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:21:29,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:30,284 INFO L130 PetriNetUnfolder]: 2027/3160 cut-off events. [2022-12-06 00:21:30,284 INFO L131 PetriNetUnfolder]: For 14099/14099 co-relation queries the response was YES. [2022-12-06 00:21:30,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15630 conditions, 3160 events. 2027/3160 cut-off events. For 14099/14099 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15615 event pairs, 282 based on Foata normal form. 28/2621 useless extension candidates. Maximal degree in co-relation 8103. Up to 1920 conditions per place. [2022-12-06 00:21:30,307 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 24 changer transitions 0/107 dead transitions. [2022-12-06 00:21:30,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 1073 flow [2022-12-06 00:21:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 00:21:30,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2022-12-06 00:21:30,309 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 621 flow. Second operand 6 states and 73 transitions. [2022-12-06 00:21:30,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 1073 flow [2022-12-06 00:21:30,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 107 transitions, 1004 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-12-06 00:21:30,333 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 713 flow [2022-12-06 00:21:30,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2022-12-06 00:21:30,334 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2022-12-06 00:21:30,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:30,334 INFO L89 Accepts]: Start accepts. Operand has 67 places, 71 transitions, 713 flow [2022-12-06 00:21:30,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:30,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:30,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 71 transitions, 713 flow [2022-12-06 00:21:30,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 713 flow [2022-12-06 00:21:30,412 INFO L130 PetriNetUnfolder]: 255/701 cut-off events. [2022-12-06 00:21:30,412 INFO L131 PetriNetUnfolder]: For 2123/2169 co-relation queries the response was YES. [2022-12-06 00:21:30,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 701 events. 255/701 cut-off events. For 2123/2169 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4527 event pairs, 26 based on Foata normal form. 17/570 useless extension candidates. Maximal degree in co-relation 1785. Up to 255 conditions per place. [2022-12-06 00:21:30,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 71 transitions, 713 flow [2022-12-06 00:21:30,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-06 00:21:30,423 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:30,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 00:21:30,424 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 713 flow [2022-12-06 00:21:30,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:30,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:30,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:30,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:21:30,424 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1652770943, now seen corresponding path program 2 times [2022-12-06 00:21:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943409081] [2022-12-06 00:21:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:30,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943409081] [2022-12-06 00:21:30,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943409081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:30,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:30,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111155423] [2022-12-06 00:21:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:30,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:30,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:21:30,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:30,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:30,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:21:30,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:31,535 INFO L130 PetriNetUnfolder]: 2480/3930 cut-off events. [2022-12-06 00:21:31,536 INFO L131 PetriNetUnfolder]: For 20919/20919 co-relation queries the response was YES. [2022-12-06 00:21:31,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20089 conditions, 3930 events. 2480/3930 cut-off events. For 20919/20919 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20633 event pairs, 378 based on Foata normal form. 56/3248 useless extension candidates. Maximal degree in co-relation 12205. Up to 1794 conditions per place. [2022-12-06 00:21:31,566 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 36 changer transitions 2/156 dead transitions. [2022-12-06 00:21:31,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 156 transitions, 1595 flow [2022-12-06 00:21:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:21:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:21:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-06 00:21:31,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2022-12-06 00:21:31,568 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 713 flow. Second operand 9 states and 105 transitions. [2022-12-06 00:21:31,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 156 transitions, 1595 flow [2022-12-06 00:21:31,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 156 transitions, 1563 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:21:31,595 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 1001 flow [2022-12-06 00:21:31,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1001, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2022-12-06 00:21:31,596 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2022-12-06 00:21:31,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:31,596 INFO L89 Accepts]: Start accepts. Operand has 76 places, 84 transitions, 1001 flow [2022-12-06 00:21:31,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:31,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:31,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 84 transitions, 1001 flow [2022-12-06 00:21:31,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 84 transitions, 1001 flow [2022-12-06 00:21:31,690 INFO L130 PetriNetUnfolder]: 287/861 cut-off events. [2022-12-06 00:21:31,690 INFO L131 PetriNetUnfolder]: For 3293/3358 co-relation queries the response was YES. [2022-12-06 00:21:31,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 861 events. 287/861 cut-off events. For 3293/3358 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6246 event pairs, 36 based on Foata normal form. 26/692 useless extension candidates. Maximal degree in co-relation 3080. Up to 307 conditions per place. [2022-12-06 00:21:31,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 84 transitions, 1001 flow [2022-12-06 00:21:31,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:21:31,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:31,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 00:21:31,703 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 1001 flow [2022-12-06 00:21:31,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:31,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:31,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:31,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:21:31,703 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash 906262035, now seen corresponding path program 3 times [2022-12-06 00:21:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:31,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114423618] [2022-12-06 00:21:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114423618] [2022-12-06 00:21:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114423618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:32,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:32,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497798175] [2022-12-06 00:21:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:32,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:32,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:21:32,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 1001 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:32,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:32,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:21:32,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:32,848 INFO L130 PetriNetUnfolder]: 2308/3614 cut-off events. [2022-12-06 00:21:32,849 INFO L131 PetriNetUnfolder]: For 23918/23918 co-relation queries the response was YES. [2022-12-06 00:21:32,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20252 conditions, 3614 events. 2308/3614 cut-off events. For 23918/23918 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18414 event pairs, 430 based on Foata normal form. 18/2990 useless extension candidates. Maximal degree in co-relation 13989. Up to 2339 conditions per place. [2022-12-06 00:21:32,880 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 96 selfloop transitions, 14 changer transitions 7/117 dead transitions. [2022-12-06 00:21:32,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 1401 flow [2022-12-06 00:21:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 00:21:32,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 00:21:32,882 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 1001 flow. Second operand 6 states and 72 transitions. [2022-12-06 00:21:32,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 1401 flow [2022-12-06 00:21:32,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 1364 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:32,932 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 925 flow [2022-12-06 00:21:32,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2022-12-06 00:21:32,933 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-06 00:21:32,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:32,933 INFO L89 Accepts]: Start accepts. Operand has 77 places, 80 transitions, 925 flow [2022-12-06 00:21:32,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:32,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:32,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 80 transitions, 925 flow [2022-12-06 00:21:32,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 925 flow [2022-12-06 00:21:33,034 INFO L130 PetriNetUnfolder]: 297/852 cut-off events. [2022-12-06 00:21:33,034 INFO L131 PetriNetUnfolder]: For 3485/3525 co-relation queries the response was YES. [2022-12-06 00:21:33,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 852 events. 297/852 cut-off events. For 3485/3525 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6020 event pairs, 40 based on Foata normal form. 16/687 useless extension candidates. Maximal degree in co-relation 3190. Up to 325 conditions per place. [2022-12-06 00:21:33,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 80 transitions, 925 flow [2022-12-06 00:21:33,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-06 00:21:33,049 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:33,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 00:21:33,052 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 925 flow [2022-12-06 00:21:33,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:33,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:33,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:33,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:21:33,053 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 456854165, now seen corresponding path program 1 times [2022-12-06 00:21:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619526559] [2022-12-06 00:21:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619526559] [2022-12-06 00:21:33,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619526559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:33,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:33,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373791778] [2022-12-06 00:21:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:33,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:33,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:21:33,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 925 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:33,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:33,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:21:33,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:34,527 INFO L130 PetriNetUnfolder]: 2449/3845 cut-off events. [2022-12-06 00:21:34,527 INFO L131 PetriNetUnfolder]: For 24880/24880 co-relation queries the response was YES. [2022-12-06 00:21:34,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21568 conditions, 3845 events. 2449/3845 cut-off events. For 24880/24880 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19722 event pairs, 752 based on Foata normal form. 12/3174 useless extension candidates. Maximal degree in co-relation 15034. Up to 3617 conditions per place. [2022-12-06 00:21:34,596 INFO L137 encePairwiseOnDemand]: 17/31 looper letters, 98 selfloop transitions, 23 changer transitions 0/121 dead transitions. [2022-12-06 00:21:34,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 121 transitions, 1513 flow [2022-12-06 00:21:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 00:21:34,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29493087557603687 [2022-12-06 00:21:34,597 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 925 flow. Second operand 7 states and 64 transitions. [2022-12-06 00:21:34,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 121 transitions, 1513 flow [2022-12-06 00:21:34,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 1475 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:34,639 INFO L231 Difference]: Finished difference. Result has 81 places, 96 transitions, 1169 flow [2022-12-06 00:21:34,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1169, PETRI_PLACES=81, PETRI_TRANSITIONS=96} [2022-12-06 00:21:34,640 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2022-12-06 00:21:34,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:34,640 INFO L89 Accepts]: Start accepts. Operand has 81 places, 96 transitions, 1169 flow [2022-12-06 00:21:34,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:34,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:34,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 96 transitions, 1169 flow [2022-12-06 00:21:34,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 96 transitions, 1169 flow [2022-12-06 00:21:34,754 INFO L130 PetriNetUnfolder]: 344/921 cut-off events. [2022-12-06 00:21:34,754 INFO L131 PetriNetUnfolder]: For 3952/4018 co-relation queries the response was YES. [2022-12-06 00:21:34,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 921 events. 344/921 cut-off events. For 3952/4018 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6406 event pairs, 38 based on Foata normal form. 22/777 useless extension candidates. Maximal degree in co-relation 3862. Up to 329 conditions per place. [2022-12-06 00:21:34,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 96 transitions, 1169 flow [2022-12-06 00:21:34,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-06 00:21:45,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:45,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10442 [2022-12-06 00:21:45,082 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 96 transitions, 1199 flow [2022-12-06 00:21:45,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:45,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:45,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:45,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:21:45,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1124439091, now seen corresponding path program 4 times [2022-12-06 00:21:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:45,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858397562] [2022-12-06 00:21:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:46,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858397562] [2022-12-06 00:21:46,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858397562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:46,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:46,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:21:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038421873] [2022-12-06 00:21:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:46,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:46,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:46,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:21:46,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 96 transitions, 1199 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:46,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:46,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:21:46,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:47,386 INFO L130 PetriNetUnfolder]: 2515/3952 cut-off events. [2022-12-06 00:21:47,387 INFO L131 PetriNetUnfolder]: For 27161/27161 co-relation queries the response was YES. [2022-12-06 00:21:47,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22619 conditions, 3952 events. 2515/3952 cut-off events. For 27161/27161 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20693 event pairs, 968 based on Foata normal form. 16/3384 useless extension candidates. Maximal degree in co-relation 18813. Up to 3557 conditions per place. [2022-12-06 00:21:47,422 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 101 selfloop transitions, 3 changer transitions 46/150 dead transitions. [2022-12-06 00:21:47,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 1984 flow [2022-12-06 00:21:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-06 00:21:47,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3480392156862745 [2022-12-06 00:21:47,424 INFO L175 Difference]: Start difference. First operand has 81 places, 96 transitions, 1199 flow. Second operand 6 states and 71 transitions. [2022-12-06 00:21:47,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 1984 flow [2022-12-06 00:21:47,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 150 transitions, 1945 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 00:21:47,484 INFO L231 Difference]: Finished difference. Result has 89 places, 97 transitions, 1225 flow [2022-12-06 00:21:47,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1225, PETRI_PLACES=89, PETRI_TRANSITIONS=97} [2022-12-06 00:21:47,485 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2022-12-06 00:21:47,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:47,485 INFO L89 Accepts]: Start accepts. Operand has 89 places, 97 transitions, 1225 flow [2022-12-06 00:21:47,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:47,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:47,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 97 transitions, 1225 flow [2022-12-06 00:21:47,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 97 transitions, 1225 flow [2022-12-06 00:21:47,604 INFO L130 PetriNetUnfolder]: 319/836 cut-off events. [2022-12-06 00:21:47,604 INFO L131 PetriNetUnfolder]: For 4013/4088 co-relation queries the response was YES. [2022-12-06 00:21:47,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 836 events. 319/836 cut-off events. For 4013/4088 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5685 event pairs, 33 based on Foata normal form. 25/709 useless extension candidates. Maximal degree in co-relation 4216. Up to 269 conditions per place. [2022-12-06 00:21:47,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 97 transitions, 1225 flow [2022-12-06 00:21:47,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-06 00:21:47,618 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:47,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 00:21:47,619 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 1225 flow [2022-12-06 00:21:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:47,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:47,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:47,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:21:47,620 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:21:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 10430314, now seen corresponding path program 1 times [2022-12-06 00:21:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580912629] [2022-12-06 00:21:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:48,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:48,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580912629] [2022-12-06 00:21:48,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580912629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:48,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:48,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815028681] [2022-12-06 00:21:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:48,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:48,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:21:48,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 97 transitions, 1225 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:48,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:48,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:21:48,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:48,960 INFO L130 PetriNetUnfolder]: 3045/4920 cut-off events. [2022-12-06 00:21:48,960 INFO L131 PetriNetUnfolder]: For 35311/35311 co-relation queries the response was YES. [2022-12-06 00:21:48,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27727 conditions, 4920 events. 3045/4920 cut-off events. For 35311/35311 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 28353 event pairs, 522 based on Foata normal form. 64/4262 useless extension candidates. Maximal degree in co-relation 27688. Up to 2029 conditions per place. [2022-12-06 00:21:49,000 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 130 selfloop transitions, 58 changer transitions 3/191 dead transitions. [2022-12-06 00:21:49,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 191 transitions, 2247 flow [2022-12-06 00:21:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 00:21:49,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-06 00:21:49,003 INFO L175 Difference]: Start difference. First operand has 86 places, 97 transitions, 1225 flow. Second operand 8 states and 114 transitions. [2022-12-06 00:21:49,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 191 transitions, 2247 flow [2022-12-06 00:21:49,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 191 transitions, 2201 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-06 00:21:49,071 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 1651 flow [2022-12-06 00:21:49,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1651, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2022-12-06 00:21:49,071 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2022-12-06 00:21:49,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:49,072 INFO L89 Accepts]: Start accepts. Operand has 94 places, 115 transitions, 1651 flow [2022-12-06 00:21:49,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:49,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:49,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 115 transitions, 1651 flow [2022-12-06 00:21:49,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 115 transitions, 1651 flow [2022-12-06 00:21:49,304 INFO L130 PetriNetUnfolder]: 428/1183 cut-off events. [2022-12-06 00:21:49,304 INFO L131 PetriNetUnfolder]: For 7808/7879 co-relation queries the response was YES. [2022-12-06 00:21:49,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6788 conditions, 1183 events. 428/1183 cut-off events. For 7808/7879 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8958 event pairs, 51 based on Foata normal form. 32/1013 useless extension candidates. Maximal degree in co-relation 4292. Up to 433 conditions per place. [2022-12-06 00:21:49,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 115 transitions, 1651 flow [2022-12-06 00:21:49,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-06 00:21:49,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] L49-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_8| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= (select (select |v_#memory_int_In_22| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0)) (= (+ v_~C~0_In_8 v_~x~0_In_5) v_~x~0_Out_18) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_16) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_In_2| v_~N~0_In_4)) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_8|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~C~0=v_~C~0_In_8, ~q1_back~0=v_~q1_back~0_In_4, ~n1~0=v_~n1~0_In_5, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_2|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_22|, ~N~0=v_~N~0_In_4, ~x~0=v_~x~0_In_5} OutVars{~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_4|, ~C~0=v_~C~0_In_8, ~n1~0=v_~n1~0_In_5, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_4|, ~N~0=v_~N~0_In_4, ~q1_back~0=v_~q1_back~0_Out_16, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_2|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_8|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_8|, ~x~0=v_~x~0_Out_18, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:21:49,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] L49-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_8| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= (select (select |v_#memory_int_In_22| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0)) (= (+ v_~C~0_In_8 v_~x~0_In_5) v_~x~0_Out_18) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_16) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_In_2| v_~N~0_In_4)) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_8|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~C~0=v_~C~0_In_8, ~q1_back~0=v_~q1_back~0_In_4, ~n1~0=v_~n1~0_In_5, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_2|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_22|, ~N~0=v_~N~0_In_4, ~x~0=v_~x~0_In_5} OutVars{~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_4|, ~C~0=v_~C~0_In_8, ~n1~0=v_~n1~0_In_5, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_4|, ~N~0=v_~N~0_In_4, ~q1_back~0=v_~q1_back~0_Out_16, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_2|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_8|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_8|, ~x~0=v_~x~0_Out_18, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:21:49,616 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 00:21:49,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:49,618 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 00:21:49,619 INFO L89 Accepts]: Start accepts. Operand has 94 places, 115 transitions, 1663 flow [2022-12-06 00:21:49,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:49,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:21:49,620 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:21:49,626 INFO L158 Benchmark]: Toolchain (without parser) took 68803.89ms. Allocated memory was 183.5MB in the beginning and 763.4MB in the end (delta: 579.9MB). Free memory was 159.6MB in the beginning and 305.7MB in the end (delta: -146.1MB). Peak memory consumption was 434.8MB. Max. memory is 8.0GB. [2022-12-06 00:21:49,626 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:21:49,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.05ms. Allocated memory is still 183.5MB. Free memory was 159.1MB in the beginning and 145.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:21:49,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.52ms. Allocated memory is still 183.5MB. Free memory was 145.8MB in the beginning and 143.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:21:49,626 INFO L158 Benchmark]: Boogie Preprocessor took 70.87ms. Allocated memory is still 183.5MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:21:49,627 INFO L158 Benchmark]: RCFGBuilder took 1343.98ms. Allocated memory is still 183.5MB. Free memory was 141.3MB in the beginning and 107.1MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 00:21:49,627 INFO L158 Benchmark]: TraceAbstraction took 66843.20ms. Allocated memory was 183.5MB in the beginning and 763.4MB in the end (delta: 579.9MB). Free memory was 106.6MB in the beginning and 305.7MB in the end (delta: -199.0MB). Peak memory consumption was 382.3MB. Max. memory is 8.0GB. [2022-12-06 00:21:49,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.05ms. Allocated memory is still 183.5MB. Free memory was 159.1MB in the beginning and 145.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.52ms. Allocated memory is still 183.5MB. Free memory was 145.8MB in the beginning and 143.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.87ms. Allocated memory is still 183.5MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1343.98ms. Allocated memory is still 183.5MB. Free memory was 141.3MB in the beginning and 107.1MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 66843.20ms. Allocated memory was 183.5MB in the beginning and 763.4MB in the end (delta: 579.9MB). Free memory was 106.6MB in the beginning and 305.7MB in the end (delta: -199.0MB). Peak memory consumption was 382.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.7s, 185 PlacesBefore, 32 PlacesAfterwards, 193 TransitionsBefore, 28 TransitionsAfterwards, 1880 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 118 TrivialYvCompositions, 35 ConcurrentYvCompositions, 11 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1132, independent conditional: 1132, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1151, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1151, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1016, independent: 1003, independent conditional: 0, independent unconditional: 1003, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1016, independent: 993, independent conditional: 0, independent unconditional: 993, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1151, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1016, unknown conditional: 0, unknown unconditional: 1016] , Statistics on independence cache: Total cache size (in pairs): 1692, Positive cache size: 1679, Positive conditional cache size: 0, Positive unconditional cache size: 1679, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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, 26 PlacesBefore, 26 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 29, 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: 33, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 33, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 33, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 30 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 18, 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: 22, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 22, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 22, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 0, 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: 22, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 31 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 154 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): 22, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 40 PlacesBefore, 38 PlacesAfterwards, 53 TransitionsBefore, 51 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 144, independent conditional: 104, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 144, independent conditional: 27, independent unconditional: 117, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 144, independent conditional: 27, independent unconditional: 117, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 127, independent conditional: 22, independent unconditional: 105, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 48, Positive conditional cache size: 5, Positive unconditional cache size: 43, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 24, independent conditional: 24, 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: 28, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 28, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 28, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 0, 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: 28, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 48, Positive conditional cache size: 5, Positive unconditional cache size: 43, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 47 PlacesBefore, 46 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 64, independent conditional: 36, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 64, independent conditional: 20, independent unconditional: 44, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 64, independent conditional: 20, independent unconditional: 44, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 13, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 50, independent conditional: 7, independent unconditional: 43, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 14, unknown conditional: 13, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 76, Positive conditional cache size: 18, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 12, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 60, independent conditional: 12, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 12, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 72, independent: 55, independent conditional: 7, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 81, Positive conditional cache size: 23, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 50, independent conditional: 20, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 50, independent conditional: 20, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 50, independent conditional: 20, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 60, independent: 50, independent conditional: 20, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 81, Positive conditional cache size: 23, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 47 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 118, independent conditional: 61, independent unconditional: 57, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 118, independent conditional: 61, independent unconditional: 57, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 118, independent conditional: 61, independent unconditional: 57, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 137, independent: 114, independent conditional: 57, independent unconditional: 57, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 54 PlacesBefore, 53 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 54, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 72, independent conditional: 54, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 54, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, 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: 90, independent: 72, independent conditional: 54, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 59 PlacesBefore, 59 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 56, independent conditional: 42, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 56, independent conditional: 42, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 56, independent conditional: 42, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 70, independent: 56, independent conditional: 42, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 66 PlacesBefore, 66 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 224, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 196, independent conditional: 28, independent unconditional: 168, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 196, independent conditional: 28, independent unconditional: 168, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 224, independent: 196, independent conditional: 28, independent unconditional: 168, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 196, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 546 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): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 582 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): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 624 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): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 726 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): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 694 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): 87, Positive cache size: 85, Positive conditional cache size: 27, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3s, 81 PlacesBefore, 81 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, 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: 18, independent: 12, independent conditional: 12, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 91, Positive conditional cache size: 33, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 774 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): 96, Positive cache size: 91, Positive conditional cache size: 33, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 94 PlacesBefore, 94 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 10, independent: 0, independent conditional: 0, 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): 108, Positive cache size: 103, Positive conditional cache size: 43, Positive unconditional cache size: 60, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:21:49,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...