/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-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:08:27,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:08:27,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:08:27,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:08:27,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:08:27,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:08:27,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:08:27,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:08:27,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:08:27,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:08:27,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:08:27,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:08:27,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:08:27,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:08:27,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:08:27,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:08:27,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:08:27,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:08:27,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:08:27,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:08:27,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:08:27,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:08:27,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:08:27,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:08:27,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:08:27,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:08:27,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:08:27,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:08:27,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:08:27,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:08:27,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:08:27,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:08:27,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:08:27,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:08:27,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:08:27,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:08:27,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:08:27,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:08:27,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:08:27,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:08:27,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:08:27,812 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-13 02:08:27,829 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:08:27,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:08:27,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:08:27,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:08:27,831 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:08:27,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:08:27,835 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:08:27,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:08:27,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:08:27,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:08:27,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:08:27,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:08:27,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:08:27,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:08:27,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:08:27,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:08:27,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:08:27,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:08:27,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:08:27,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:08:27,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 02:08:28,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:08:28,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:08:28,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:08:28,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:08:28,075 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:08:28,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-13 02:08:29,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:08:29,252 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:08:29,253 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-13 02:08:29,258 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86ae4948/d5972380d5f24b4db356a4c2b39f5d85/FLAG4aafc5b87 [2022-12-13 02:08:29,275 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86ae4948/d5972380d5f24b4db356a4c2b39f5d85 [2022-12-13 02:08:29,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:08:29,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:08:29,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:08:29,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:08:29,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:08:29,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cfe2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29, skipping insertion in model container [2022-12-13 02:08:29,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:08:29,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:08:29,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:08:29,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:08:29,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:08:29,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:08:29,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:08:29,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:08:29,452 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-min-array-hom.wvr.c[2586,2599] [2022-12-13 02:08:29,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:08:29,471 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:08:29,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:08:29,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:08:29,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:08:29,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:08:29,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:08:29,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:08:29,502 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-min-array-hom.wvr.c[2586,2599] [2022-12-13 02:08:29,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:08:29,518 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:08:29,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29 WrapperNode [2022-12-13 02:08:29,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:08:29,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:08:29,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:08:29,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:08:29,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,570 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-13 02:08:29,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:08:29,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:08:29,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:08:29,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:08:29,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:08:29,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:08:29,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:08:29,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:08:29,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (1/1) ... [2022-12-13 02:08:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:08:29,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:29,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 02:08:29,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 02:08:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:08:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:08:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 02:08:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:08:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:08:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:08:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:08:29,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:08:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:08:29,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:08:29,693 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:08:29,774 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:08:29,776 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:08:30,082 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:08:30,138 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:08:30,138 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 02:08:30,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:08:30 BoogieIcfgContainer [2022-12-13 02:08:30,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:08:30,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:08:30,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:08:30,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:08:30,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:08:29" (1/3) ... [2022-12-13 02:08:30,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f430af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:08:30, skipping insertion in model container [2022-12-13 02:08:30,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:08:29" (2/3) ... [2022-12-13 02:08:30,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f430af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:08:30, skipping insertion in model container [2022-12-13 02:08:30,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:08:30" (3/3) ... [2022-12-13 02:08:30,147 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-12-13 02:08:30,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:08:30,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:08:30,160 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:08:30,221 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 02:08:30,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 308 flow [2022-12-13 02:08:30,325 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-13 02:08:30,325 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:08:30,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 12/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-13 02:08:30,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 142 transitions, 308 flow [2022-12-13 02:08:30,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 276 flow [2022-12-13 02:08:30,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:30,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-13 02:08:30,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 276 flow [2022-12-13 02:08:30,397 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-13 02:08:30,397 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:08:30,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 12/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-13 02:08:30,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-13 02:08:30,400 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 02:08:34,546 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-13 02:08:34,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:08:34,561 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;@655e1ef2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:08:34,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 02:08:34,566 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-13 02:08:34,566 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:08:34,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:34,567 INFO L214 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-13 02:08:34,567 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-13 02:08:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1106873309, now seen corresponding path program 1 times [2022-12-13 02:08:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:34,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54059306] [2022-12-13 02:08:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:35,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54059306] [2022-12-13 02:08:35,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54059306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:35,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:35,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120042302] [2022-12-13 02:08:35,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:35,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 02:08:35,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:35,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:35,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 02:08:35,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:35,148 INFO L130 PetriNetUnfolder]: 269/376 cut-off events. [2022-12-13 02:08:35,148 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 02:08:35,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 376 events. 269/376 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 133 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 615. Up to 373 conditions per place. [2022-12-13 02:08:35,152 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 02:08:35,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-13 02:08:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:08:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:08:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 02:08:35,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 02:08:35,164 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-13 02:08:35,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-13 02:08:35,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 02:08:35,169 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-13 02:08:35,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-13 02:08:35,173 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-13 02:08:35,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:35,174 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 02:08:35,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:35,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:35,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 02:08:35,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 02:08:35,183 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 02:08:35,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:08:35,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 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/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-13 02:08:35,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 02:08:35,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 02:08:36,351 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:36,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1179 [2022-12-13 02:08:36,353 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-13 02:08:36,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:36,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:36,353 INFO L214 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-13 02:08:36,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:08:36,353 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-13 02:08:36,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1795349165, now seen corresponding path program 1 times [2022-12-13 02:08:36,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:36,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381992599] [2022-12-13 02:08:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:36,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381992599] [2022-12-13 02:08:36,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381992599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:36,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:36,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143721070] [2022-12-13 02:08:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:36,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:36,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 02:08:36,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:36,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:36,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 02:08:36,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:36,466 INFO L130 PetriNetUnfolder]: 309/441 cut-off events. [2022-12-13 02:08:36,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:08:36,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 441 events. 309/441 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1405 event pairs, 49 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 889. Up to 335 conditions per place. [2022-12-13 02:08:36,469 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-13 02:08:36,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 148 flow [2022-12-13 02:08:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:08:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:08:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 02:08:36,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-13 02:08:36,470 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 4 states and 41 transitions. [2022-12-13 02:08:36,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 148 flow [2022-12-13 02:08:36,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 140 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 02:08:36,471 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 68 flow [2022-12-13 02:08:36,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-13 02:08:36,472 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-13 02:08:36,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:36,472 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 68 flow [2022-12-13 02:08:36,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:36,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:36,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-13 02:08:36,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 68 flow [2022-12-13 02:08:36,475 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 02:08:36,475 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:08:36,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2022-12-13 02:08:36,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-13 02:08:36,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 02:08:36,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:36,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 02:08:36,533 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 64 flow [2022-12-13 02:08:36,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:36,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:36,534 INFO L214 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-13 02:08:36,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:08:36,534 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-13 02:08:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -257711172, now seen corresponding path program 1 times [2022-12-13 02:08:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:36,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874410663] [2022-12-13 02:08:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:36,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874410663] [2022-12-13 02:08:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874410663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:36,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:36,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:08:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862312348] [2022-12-13 02:08:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:36,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:08:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:08:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:08:36,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 02:08:36,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) 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-13 02:08:36,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:36,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 02:08:36,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:36,849 INFO L130 PetriNetUnfolder]: 464/682 cut-off events. [2022-12-13 02:08:36,849 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-13 02:08:36,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 682 events. 464/682 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2193 event pairs, 138 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1114. Up to 325 conditions per place. [2022-12-13 02:08:36,852 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 54 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2022-12-13 02:08:36,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 64 transitions, 304 flow [2022-12-13 02:08:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:08:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:08:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-13 02:08:36,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 02:08:36,868 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 64 flow. Second operand 7 states and 66 transitions. [2022-12-13 02:08:36,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 64 transitions, 304 flow [2022-12-13 02:08:36,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 64 transitions, 270 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 02:08:36,870 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 110 flow [2022-12-13 02:08:36,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-13 02:08:36,871 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-13 02:08:36,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:36,871 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 110 flow [2022-12-13 02:08:36,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:36,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:36,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-13 02:08:36,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 110 flow [2022-12-13 02:08:36,878 INFO L130 PetriNetUnfolder]: 13/58 cut-off events. [2022-12-13 02:08:36,878 INFO L131 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-12-13 02:08:36,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 58 events. 13/58 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 72. Up to 12 conditions per place. [2022-12-13 02:08:36,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-13 02:08:36,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 02:08:36,879 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:36,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 02:08:36,880 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 110 flow [2022-12-13 02:08:36,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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-13 02:08:36,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:36,881 INFO L214 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-13 02:08:36,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:08:36,881 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-13 02:08:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash 185042541, now seen corresponding path program 1 times [2022-12-13 02:08:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:36,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740335176] [2022-12-13 02:08:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:37,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:37,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740335176] [2022-12-13 02:08:37,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740335176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:37,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039845310] [2022-12-13 02:08:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:37,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:37,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:08:37,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 02:08:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:37,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 02:08:37,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:08:38,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-13 02:08:38,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:08:38,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-12-13 02:08:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:38,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:08:39,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:08:39,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 270 [2022-12-13 02:08:39,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 169 [2022-12-13 02:08:39,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2022-12-13 02:08:39,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 145 [2022-12-13 02:08:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039845310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:08:41,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:08:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 20 [2022-12-13 02:08:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9098195] [2022-12-13 02:08:41,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:08:41,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:08:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:08:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=360, Unknown=4, NotChecked=0, Total=462 [2022-12-13 02:08:41,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 02:08:41,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 110 flow. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:41,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:41,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 02:08:41,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:42,612 INFO L130 PetriNetUnfolder]: 659/1014 cut-off events. [2022-12-13 02:08:42,612 INFO L131 PetriNetUnfolder]: For 565/587 co-relation queries the response was YES. [2022-12-13 02:08:42,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1014 events. 659/1014 cut-off events. For 565/587 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3969 event pairs, 74 based on Foata normal form. 23/901 useless extension candidates. Maximal degree in co-relation 1195. Up to 648 conditions per place. [2022-12-13 02:08:42,617 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 76 selfloop transitions, 29 changer transitions 3/110 dead transitions. [2022-12-13 02:08:42,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 110 transitions, 589 flow [2022-12-13 02:08:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:08:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:08:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-13 02:08:42,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-13 02:08:42,618 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 110 flow. Second operand 9 states and 104 transitions. [2022-12-13 02:08:42,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 110 transitions, 589 flow [2022-12-13 02:08:42,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 110 transitions, 569 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 02:08:42,622 INFO L231 Difference]: Finished difference. Result has 44 places, 57 transitions, 314 flow [2022-12-13 02:08:42,622 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=44, PETRI_TRANSITIONS=57} [2022-12-13 02:08:42,622 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2022-12-13 02:08:42,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:42,622 INFO L89 Accepts]: Start accepts. Operand has 44 places, 57 transitions, 314 flow [2022-12-13 02:08:42,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:42,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:42,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 57 transitions, 314 flow [2022-12-13 02:08:42,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 57 transitions, 314 flow [2022-12-13 02:08:42,633 INFO L130 PetriNetUnfolder]: 61/160 cut-off events. [2022-12-13 02:08:42,633 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 02:08:42,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 160 events. 61/160 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 539 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 370. Up to 58 conditions per place. [2022-12-13 02:08:42,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 57 transitions, 314 flow [2022-12-13 02:08:42,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-13 02:08:42,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-13 02:08:42,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:42,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:42,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-13 02:08:43,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:43,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-13 02:08:45,656 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:08:45,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3035 [2022-12-13 02:08:45,658 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 55 transitions, 343 flow [2022-12-13 02:08:45,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:45,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:45,658 INFO L214 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-13 02:08:45,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 02:08:45,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:45,865 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-13 02:08:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1063716583, now seen corresponding path program 1 times [2022-12-13 02:08:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:45,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999651818] [2022-12-13 02:08:45,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999651818] [2022-12-13 02:08:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999651818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003821920] [2022-12-13 02:08:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:46,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:08:46,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 02:08:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:46,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 02:08:46,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:46,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:08:46,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 89 [2022-12-13 02:08:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:47,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:08:47,638 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 02:08:47,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 67 [2022-12-13 02:08:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:47,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003821920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:08:47,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:08:47,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-13 02:08:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578220459] [2022-12-13 02:08:47,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:08:47,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 02:08:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 02:08:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-12-13 02:08:47,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 02:08:47,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 55 transitions, 343 flow. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:47,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:47,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 02:08:47,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:49,127 INFO L130 PetriNetUnfolder]: 1025/1648 cut-off events. [2022-12-13 02:08:49,128 INFO L131 PetriNetUnfolder]: For 3257/3282 co-relation queries the response was YES. [2022-12-13 02:08:49,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5685 conditions, 1648 events. 1025/1648 cut-off events. For 3257/3282 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7583 event pairs, 237 based on Foata normal form. 27/1670 useless extension candidates. Maximal degree in co-relation 5347. Up to 1075 conditions per place. [2022-12-13 02:08:49,136 INFO L137 encePairwiseOnDemand]: 17/31 looper letters, 122 selfloop transitions, 64 changer transitions 8/196 dead transitions. [2022-12-13 02:08:49,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 196 transitions, 1364 flow [2022-12-13 02:08:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 02:08:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 02:08:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2022-12-13 02:08:49,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30261136712749614 [2022-12-13 02:08:49,138 INFO L175 Difference]: Start difference. First operand has 42 places, 55 transitions, 343 flow. Second operand 21 states and 197 transitions. [2022-12-13 02:08:49,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 196 transitions, 1364 flow [2022-12-13 02:08:49,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 196 transitions, 1322 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 02:08:49,153 INFO L231 Difference]: Finished difference. Result has 71 places, 105 transitions, 902 flow [2022-12-13 02:08:49,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=902, PETRI_PLACES=71, PETRI_TRANSITIONS=105} [2022-12-13 02:08:49,154 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2022-12-13 02:08:49,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:49,154 INFO L89 Accepts]: Start accepts. Operand has 71 places, 105 transitions, 902 flow [2022-12-13 02:08:49,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:49,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:49,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 105 transitions, 902 flow [2022-12-13 02:08:49,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 105 transitions, 902 flow [2022-12-13 02:08:49,179 INFO L130 PetriNetUnfolder]: 125/375 cut-off events. [2022-12-13 02:08:49,179 INFO L131 PetriNetUnfolder]: For 1073/1073 co-relation queries the response was YES. [2022-12-13 02:08:49,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 375 events. 125/375 cut-off events. For 1073/1073 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2026 event pairs, 5 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1261. Up to 113 conditions per place. [2022-12-13 02:08:49,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 105 transitions, 902 flow [2022-12-13 02:08:49,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-13 02:08:49,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_2| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_2| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_1 v_~N~0_In_5))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_1, ~N~0=v_~N~0_In_5} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_1, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_2|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_2|, ~N~0=v_~N~0_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:49,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_2| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_2| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_1 v_~N~0_In_5))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_1, ~N~0=v_~N~0_In_5} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_1, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_2|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_2|, ~N~0=v_~N~0_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-13 02:08:52,377 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:52,378 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:52,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L70-4-->L46-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_85)) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_85)) (= v_thread1Thread1of1ForFork1_~i~0_47 1) (let ((.cse1 (select (select |v_#memory_int_182| v_~A~0.base_98) (+ (- 4) v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse0 (< .cse1 v_~min1~0_85))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse0) (= v_~min1~0_85 v_~min1~0_84)) (and (= v_~min1~0_84 .cse1) .cse0)))) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_85} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_84} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:52,860 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:52,861 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:53,057 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:53,057 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:53,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:53,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [562] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_43 (+ v_thread1Thread1of1ForFork1_~i~0_44 1)) (let ((.cse1 (select (select |v_#memory_int_178| v_~A~0.base_94) (+ v_~A~0.offset_94 (* v_thread1Thread1of1ForFork1_~i~0_44 4))))) (let ((.cse0 (< .cse1 v_~min1~0_81))) (or (and .cse0 (= v_~min1~0_80 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_39| |v_thread1Thread1of1ForFork1_#t~mem3_38|) (= v_~min1~0_81 v_~min1~0_80) (not .cse0))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_21|) (= |v_thread3Thread1of1ForFork0_#res.offset_21| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_43 v_~N~0_81)) (< v_thread1Thread1of1ForFork1_~i~0_44 v_~N~0_81)) InVars {~A~0.base=v_~A~0.base_94, ~A~0.offset=v_~A~0.offset_94, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_39|, #memory_int=|v_#memory_int_178|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_43, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_44, ~N~0=v_~N~0_81, ~min1~0=v_~min1~0_81} OutVars{~A~0.base=v_~A~0.base_94, ~A~0.offset=v_~A~0.offset_94, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_21|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_38|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_29|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_21|, #memory_int=|v_#memory_int_178|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_43, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_21|, ~N~0=v_~N~0_81, ~min1~0=v_~min1~0_80} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] [2022-12-13 02:08:53,311 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:53,311 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:53,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:53,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [563] L70-4-->L58-4: Formula: (and (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_83)) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_57) (let ((.cse0 (select (select |v_#memory_int_180| v_~A~0.base_96) (+ v_~A~0.offset_96 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse1 (< .cse0 v_~min2~0_77))) (or (and (= v_~min2~0_76 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (= v_~min2~0_77 v_~min2~0_76) (not .cse1))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_96, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_96, ~M~0=v_~M~0_57, #memory_int=|v_#memory_int_180|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_83, ~min2~0=v_~min2~0_77} OutVars{~A~0.base=v_~A~0.base_96, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_83, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_28|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_36|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, ~A~0.offset=v_~A~0.offset_96, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_57, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_23|, #memory_int=|v_#memory_int_180|, ~min2~0=v_~min2~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, ~min2~0] [2022-12-13 02:08:53,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [549] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_In_1 v_~N~0_In_3))) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-13 02:08:53,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [576] L70-4-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_218| v_~A~0.base_120)) (.cse3 (* v_thread1Thread1of1ForFork1_~i~0_65 4))) (and (let ((.cse0 (select .cse2 (+ .cse3 v_~A~0.offset_120 4)))) (let ((.cse1 (< .cse0 v_~min1~0_113))) (or (and (= v_~min1~0_112 .cse0) .cse1) (and (= v_~min1~0_113 v_~min1~0_112) (= |v_thread1Thread1of1ForFork1_#t~mem3_64| |v_thread1Thread1of1ForFork1_#t~mem3_63|) (not .cse1))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_37|) (let ((.cse4 (select .cse2 (+ .cse3 v_~A~0.offset_120)))) (let ((.cse5 (< .cse4 v_~min1~0_114))) (or (and (= v_~min1~0_113 .cse4) .cse5) (and (not .cse5) (= v_~min1~0_114 v_~min1~0_113) (= |v_thread1Thread1of1ForFork1_#t~mem3_65| |v_thread1Thread1of1ForFork1_#t~mem3_64|))))) (= v_thread1Thread1of1ForFork1_~i~0_63 (+ v_thread1Thread1of1ForFork1_~i~0_65 2)) (= |v_thread3Thread1of1ForFork0_#res.offset_37| 0) (< (+ v_thread1Thread1of1ForFork1_~i~0_65 1) v_~N~0_105) (not (< v_thread3Thread1of1ForFork0_~i~2_65 v_~N~0_105)))) InVars {~A~0.base=v_~A~0.base_120, ~A~0.offset=v_~A~0.offset_120, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_65|, #memory_int=|v_#memory_int_218|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_65, ~N~0=v_~N~0_105, ~min1~0=v_~min1~0_114} OutVars{~A~0.base=v_~A~0.base_120, ~A~0.offset=v_~A~0.offset_120, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_35|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_63|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_43|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_37|, #memory_int=|v_#memory_int_218|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_65, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_63, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_37|, ~N~0=v_~N~0_105, ~min1~0=v_~min1~0_112} AuxVars[|v_thread1Thread1of1ForFork1_#t~mem3_64|, v_~min1~0_113] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] [2022-12-13 02:08:53,957 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:53,957 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:54,282 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:54,283 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:54,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [562] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_43 (+ v_thread1Thread1of1ForFork1_~i~0_44 1)) (let ((.cse1 (select (select |v_#memory_int_178| v_~A~0.base_94) (+ v_~A~0.offset_94 (* v_thread1Thread1of1ForFork1_~i~0_44 4))))) (let ((.cse0 (< .cse1 v_~min1~0_81))) (or (and .cse0 (= v_~min1~0_80 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_39| |v_thread1Thread1of1ForFork1_#t~mem3_38|) (= v_~min1~0_81 v_~min1~0_80) (not .cse0))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_21|) (= |v_thread3Thread1of1ForFork0_#res.offset_21| 0) (not (< v_thread3Thread1of1ForFork0_~i~2_43 v_~N~0_81)) (< v_thread1Thread1of1ForFork1_~i~0_44 v_~N~0_81)) InVars {~A~0.base=v_~A~0.base_94, ~A~0.offset=v_~A~0.offset_94, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_39|, #memory_int=|v_#memory_int_178|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_43, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_44, ~N~0=v_~N~0_81, ~min1~0=v_~min1~0_81} OutVars{~A~0.base=v_~A~0.base_94, ~A~0.offset=v_~A~0.offset_94, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_21|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_38|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_29|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_21|, #memory_int=|v_#memory_int_178|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_43, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_21|, ~N~0=v_~N~0_81, ~min1~0=v_~min1~0_80} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] [2022-12-13 02:08:54,460 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:54,460 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:54,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:54,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:54,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [563] L70-4-->L58-4: Formula: (and (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_83)) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_57) (let ((.cse0 (select (select |v_#memory_int_180| v_~A~0.base_96) (+ v_~A~0.offset_96 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse1 (< .cse0 v_~min2~0_77))) (or (and (= v_~min2~0_76 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (= v_~min2~0_77 v_~min2~0_76) (not .cse1))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_96, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_96, ~M~0=v_~M~0_57, #memory_int=|v_#memory_int_180|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_83, ~min2~0=v_~min2~0_77} OutVars{~A~0.base=v_~A~0.base_96, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_83, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_28|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_36|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, ~A~0.offset=v_~A~0.offset_96, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_57, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_23|, #memory_int=|v_#memory_int_180|, ~min2~0=v_~min2~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, ~min2~0] [2022-12-13 02:08:55,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_21| 0) (< v_thread1Thread1of1ForFork1_~i~0_103 (+ v_~N~0_131 1)) (not (< v_thread1Thread1of1ForFork1_~i~0_103 v_~N~0_131)) (= v_thread1Thread1of1ForFork1_~i~0_103 1) (let ((.cse0 (select (select |v_#memory_int_244| v_~A~0.base_146) (+ v_~A~0.offset_146 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_103 4))))) (let ((.cse1 (< .cse0 v_~min1~0_180))) (or (and (= v_~min1~0_179 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_131| |v_thread1Thread1of1ForFork1_#t~mem3_130|) (not .cse1) (= v_~min1~0_179 v_~min1~0_180))))) (= |v_thread1Thread1of1ForFork1_#res.offset_21| 0)) InVars {~A~0.base=v_~A~0.base_146, ~A~0.offset=v_~A~0.offset_146, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_131|, #memory_int=|v_#memory_int_244|, ~N~0=v_~N~0_131, ~min1~0=v_~min1~0_180} OutVars{~A~0.base=v_~A~0.base_146, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_21|, ~A~0.offset=v_~A~0.offset_146, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_73|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_130|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_81|, #memory_int=|v_#memory_int_244|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_103, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_21|, ~N~0=v_~N~0_131, ~min1~0=v_~min1~0_179} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:55,273 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 02:08:55,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6120 [2022-12-13 02:08:55,274 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 102 transitions, 961 flow [2022-12-13 02:08:55,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:55,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:55,274 INFO L214 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-13 02:08:55,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 02:08:55,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:55,477 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-13 02:08:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:55,478 INFO L85 PathProgramCache]: Analyzing trace with hash 904746937, now seen corresponding path program 1 times [2022-12-13 02:08:55,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:55,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227837229] [2022-12-13 02:08:55,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:55,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227837229] [2022-12-13 02:08:55,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227837229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:55,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:55,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575117493] [2022-12-13 02:08:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:55,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:55,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 52 [2022-12-13 02:08:55,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 102 transitions, 961 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:55,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:55,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 52 [2022-12-13 02:08:55,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:55,793 INFO L130 PetriNetUnfolder]: 1061/1771 cut-off events. [2022-12-13 02:08:55,793 INFO L131 PetriNetUnfolder]: For 9648/9860 co-relation queries the response was YES. [2022-12-13 02:08:55,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7766 conditions, 1771 events. 1061/1771 cut-off events. For 9648/9860 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9318 event pairs, 410 based on Foata normal form. 245/1979 useless extension candidates. Maximal degree in co-relation 7593. Up to 843 conditions per place. [2022-12-13 02:08:55,803 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 115 selfloop transitions, 12 changer transitions 1/132 dead transitions. [2022-12-13 02:08:55,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 132 transitions, 1409 flow [2022-12-13 02:08:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:08:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:08:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 02:08:55,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-13 02:08:55,805 INFO L175 Difference]: Start difference. First operand has 69 places, 102 transitions, 961 flow. Second operand 4 states and 92 transitions. [2022-12-13 02:08:55,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 132 transitions, 1409 flow [2022-12-13 02:08:55,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 1329 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-13 02:08:55,821 INFO L231 Difference]: Finished difference. Result has 70 places, 94 transitions, 872 flow [2022-12-13 02:08:55,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=872, PETRI_PLACES=70, PETRI_TRANSITIONS=94} [2022-12-13 02:08:55,823 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2022-12-13 02:08:55,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:55,823 INFO L89 Accepts]: Start accepts. Operand has 70 places, 94 transitions, 872 flow [2022-12-13 02:08:55,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:55,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:55,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 94 transitions, 872 flow [2022-12-13 02:08:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 94 transitions, 872 flow [2022-12-13 02:08:55,850 INFO L130 PetriNetUnfolder]: 121/414 cut-off events. [2022-12-13 02:08:55,850 INFO L131 PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES. [2022-12-13 02:08:55,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 414 events. 121/414 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2567 event pairs, 4 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 1466. Up to 112 conditions per place. [2022-12-13 02:08:55,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 94 transitions, 872 flow [2022-12-13 02:08:55,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 02:08:56,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:56,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 02:08:56,082 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 94 transitions, 876 flow [2022-12-13 02:08:56,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:56,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:56,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:08:56,083 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-13 02:08:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -454252050, now seen corresponding path program 1 times [2022-12-13 02:08:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511807464] [2022-12-13 02:08:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:08:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:56,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511807464] [2022-12-13 02:08:56,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511807464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:56,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:56,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:08:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493639158] [2022-12-13 02:08:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:56,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:08:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:08:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:08:56,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-13 02:08:56,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 94 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-13 02:08:56,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:56,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-13 02:08:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:56,314 INFO L130 PetriNetUnfolder]: 1044/1731 cut-off events. [2022-12-13 02:08:56,315 INFO L131 PetriNetUnfolder]: For 9008/9170 co-relation queries the response was YES. [2022-12-13 02:08:56,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7543 conditions, 1731 events. 1044/1731 cut-off events. For 9008/9170 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8889 event pairs, 502 based on Foata normal form. 150/1843 useless extension candidates. Maximal degree in co-relation 7517. Up to 863 conditions per place. [2022-12-13 02:08:56,325 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 108 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-12-13 02:08:56,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 1190 flow [2022-12-13 02:08:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:08:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:08:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 02:08:56,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2022-12-13 02:08:56,326 INFO L175 Difference]: Start difference. First operand has 69 places, 94 transitions, 876 flow. Second operand 3 states and 72 transitions. [2022-12-13 02:08:56,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 1190 flow [2022-12-13 02:08:56,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 1177 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-13 02:08:56,338 INFO L231 Difference]: Finished difference. Result has 63 places, 89 transitions, 806 flow [2022-12-13 02:08:56,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=63, PETRI_TRANSITIONS=89} [2022-12-13 02:08:56,338 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2022-12-13 02:08:56,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:56,338 INFO L89 Accepts]: Start accepts. Operand has 63 places, 89 transitions, 806 flow [2022-12-13 02:08:56,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:56,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:56,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 89 transitions, 806 flow [2022-12-13 02:08:56,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 89 transitions, 806 flow [2022-12-13 02:08:56,371 INFO L130 PetriNetUnfolder]: 116/385 cut-off events. [2022-12-13 02:08:56,372 INFO L131 PetriNetUnfolder]: For 1065/1065 co-relation queries the response was YES. [2022-12-13 02:08:56,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 385 events. 116/385 cut-off events. For 1065/1065 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2279 event pairs, 4 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 1281. Up to 103 conditions per place. [2022-12-13 02:08:56,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 89 transitions, 806 flow [2022-12-13 02:08:56,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 02:08:56,375 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:56,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 02:08:56,375 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 89 transitions, 806 flow [2022-12-13 02:08:56,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-13 02:08:56,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:56,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:56,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:08:56,376 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-13 02:08:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1281792041, now seen corresponding path program 1 times [2022-12-13 02:08:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:56,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857967747] [2022-12-13 02:08:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:56,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:56,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857967747] [2022-12-13 02:08:56,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857967747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:56,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:56,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:08:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020312953] [2022-12-13 02:08:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:08:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:08:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:08:56,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 02:08:56,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 89 transitions, 806 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:56,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:56,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 02:08:56,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:56,777 INFO L130 PetriNetUnfolder]: 1522/2439 cut-off events. [2022-12-13 02:08:56,778 INFO L131 PetriNetUnfolder]: For 10374/10374 co-relation queries the response was YES. [2022-12-13 02:08:56,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10108 conditions, 2439 events. 1522/2439 cut-off events. For 10374/10374 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12408 event pairs, 502 based on Foata normal form. 56/2485 useless extension candidates. Maximal degree in co-relation 9788. Up to 996 conditions per place. [2022-12-13 02:08:56,792 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 159 selfloop transitions, 33 changer transitions 10/202 dead transitions. [2022-12-13 02:08:56,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 202 transitions, 2109 flow [2022-12-13 02:08:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:08:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:08:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2022-12-13 02:08:56,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-13 02:08:56,793 INFO L175 Difference]: Start difference. First operand has 63 places, 89 transitions, 806 flow. Second operand 7 states and 133 transitions. [2022-12-13 02:08:56,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 202 transitions, 2109 flow [2022-12-13 02:08:56,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 2107 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:08:56,811 INFO L231 Difference]: Finished difference. Result has 73 places, 106 transitions, 1101 flow [2022-12-13 02:08:56,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=73, PETRI_TRANSITIONS=106} [2022-12-13 02:08:56,812 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2022-12-13 02:08:56,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:56,813 INFO L89 Accepts]: Start accepts. Operand has 73 places, 106 transitions, 1101 flow [2022-12-13 02:08:56,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:56,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:56,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 106 transitions, 1101 flow [2022-12-13 02:08:56,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 106 transitions, 1101 flow [2022-12-13 02:08:56,843 INFO L130 PetriNetUnfolder]: 129/433 cut-off events. [2022-12-13 02:08:56,843 INFO L131 PetriNetUnfolder]: For 1927/2026 co-relation queries the response was YES. [2022-12-13 02:08:56,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 433 events. 129/433 cut-off events. For 1927/2026 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2761 event pairs, 4 based on Foata normal form. 24/438 useless extension candidates. Maximal degree in co-relation 1624. Up to 119 conditions per place. [2022-12-13 02:08:56,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 106 transitions, 1101 flow [2022-12-13 02:08:56,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-13 02:08:56,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [564] L70-4-->L46-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_85)) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_85)) (= v_thread1Thread1of1ForFork1_~i~0_47 1) (let ((.cse1 (select (select |v_#memory_int_182| v_~A~0.base_98) (+ (- 4) v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse0 (< .cse1 v_~min1~0_85))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse0) (= v_~min1~0_85 v_~min1~0_84)) (and (= v_~min1~0_84 .cse1) .cse0)))) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_85} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_84} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] [2022-12-13 02:08:57,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L70-4-->L46-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_85)) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_85)) (= v_thread1Thread1of1ForFork1_~i~0_47 1) (let ((.cse1 (select (select |v_#memory_int_182| v_~A~0.base_98) (+ (- 4) v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse0 (< .cse1 v_~min1~0_85))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse0) (= v_~min1~0_85 v_~min1~0_84)) (and (= v_~min1~0_84 .cse1) .cse0)))) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_85} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_84} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:57,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] [2022-12-13 02:08:57,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:57,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:57,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:08:57,588 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:08:57,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 776 [2022-12-13 02:08:57,589 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 105 transitions, 1167 flow [2022-12-13 02:08:57,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:57,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:57,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:08:57,589 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-13 02:08:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -308187145, now seen corresponding path program 2 times [2022-12-13 02:08:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:57,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830684285] [2022-12-13 02:08:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830684285] [2022-12-13 02:08:57,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830684285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:57,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:57,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:08:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553238283] [2022-12-13 02:08:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:08:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:08:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:08:57,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 02:08:57,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 105 transitions, 1167 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:57,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:57,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 02:08:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:57,990 INFO L130 PetriNetUnfolder]: 1173/1918 cut-off events. [2022-12-13 02:08:57,990 INFO L131 PetriNetUnfolder]: For 11738/11738 co-relation queries the response was YES. [2022-12-13 02:08:57,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8994 conditions, 1918 events. 1173/1918 cut-off events. For 11738/11738 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9415 event pairs, 424 based on Foata normal form. 108/2016 useless extension candidates. Maximal degree in co-relation 8739. Up to 996 conditions per place. [2022-12-13 02:08:58,007 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 119 selfloop transitions, 10 changer transitions 6/135 dead transitions. [2022-12-13 02:08:58,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 135 transitions, 1449 flow [2022-12-13 02:08:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:08:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:08:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-13 02:08:58,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.330188679245283 [2022-12-13 02:08:58,009 INFO L175 Difference]: Start difference. First operand has 72 places, 105 transitions, 1167 flow. Second operand 6 states and 105 transitions. [2022-12-13 02:08:58,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 135 transitions, 1449 flow [2022-12-13 02:08:58,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 135 transitions, 1445 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 02:08:58,033 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 802 flow [2022-12-13 02:08:58,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=802, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2022-12-13 02:08:58,034 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-13 02:08:58,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:58,034 INFO L89 Accepts]: Start accepts. Operand has 78 places, 83 transitions, 802 flow [2022-12-13 02:08:58,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:58,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:58,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 83 transitions, 802 flow [2022-12-13 02:08:58,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 83 transitions, 802 flow [2022-12-13 02:08:58,056 INFO L130 PetriNetUnfolder]: 83/311 cut-off events. [2022-12-13 02:08:58,056 INFO L131 PetriNetUnfolder]: For 1351/1419 co-relation queries the response was YES. [2022-12-13 02:08:58,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 311 events. 83/311 cut-off events. For 1351/1419 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1826 event pairs, 3 based on Foata normal form. 24/316 useless extension candidates. Maximal degree in co-relation 1136. Up to 82 conditions per place. [2022-12-13 02:08:58,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 83 transitions, 802 flow [2022-12-13 02:08:58,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 02:08:58,060 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [605] $Ultimate##0-->L70-4: Formula: (and (< v_thread3Thread1of1ForFork0_~i~2_113 (+ v_~N~0_147 1)) (let ((.cse0 (select (select |v_#memory_int_264| v_~A~0.base_166) (+ v_~A~0.offset_166 (* v_thread3Thread1of1ForFork0_~i~2_113 4) (- 4))))) (let ((.cse1 (< .cse0 v_~min3~0_93))) (or (and (= v_~min3~0_92 .cse0) .cse1) (and (not .cse1) (= v_~min3~0_93 v_~min3~0_92) (= |v_thread3Thread1of1ForFork0_#t~mem9_46| |v_thread3Thread1of1ForFork0_#t~mem9_45|))))) (= (+ 1 v_~M~0_89) v_thread3Thread1of1ForFork0_~i~2_113)) InVars {~A~0.base=v_~A~0.base_166, ~A~0.offset=v_~A~0.offset_166, ~M~0=v_~M~0_89, #memory_int=|v_#memory_int_264|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_46|, ~N~0=v_~N~0_147, ~min3~0=v_~min3~0_93} OutVars{~A~0.base=v_~A~0.base_166, ~A~0.offset=v_~A~0.offset_166, ~M~0=v_~M~0_89, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_33|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_113, #memory_int=|v_#memory_int_264|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_45|, ~N~0=v_~N~0_147, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_25|, ~min3~0=v_~min3~0_92} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:58,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [606] $Ultimate##0-->L70-4: Formula: (and (< v_~M~0_91 v_~N~0_149) (= v_thread3Thread1of1ForFork0_~i~2_117 (+ 1 v_~M~0_91)) (let ((.cse1 (select (select |v_#memory_int_266| v_~A~0.base_168) (+ (* 4 v_~M~0_91) v_~A~0.offset_168)))) (let ((.cse0 (< .cse1 v_~min3~0_97))) (or (and .cse0 (= v_~min3~0_96 .cse1)) (and (not .cse0) (= v_~min3~0_97 v_~min3~0_96) (= |v_thread3Thread1of1ForFork0_#t~mem9_50| |v_thread3Thread1of1ForFork0_#t~mem9_49|)))))) InVars {~A~0.base=v_~A~0.base_168, ~A~0.offset=v_~A~0.offset_168, ~M~0=v_~M~0_91, #memory_int=|v_#memory_int_266|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_50|, ~N~0=v_~N~0_149, ~min3~0=v_~min3~0_97} OutVars{~A~0.base=v_~A~0.base_168, ~A~0.offset=v_~A~0.offset_168, ~M~0=v_~M~0_91, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_35|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_117, #memory_int=|v_#memory_int_266|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_49|, ~N~0=v_~N~0_149, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_27|, ~min3~0=v_~min3~0_96} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:58,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [603] $Ultimate##0-->L70-4: Formula: (and (< v_thread3Thread1of1ForFork0_~i~2_107 (+ v_~N~0_145 1)) (= (+ 1 v_~M~0_85) v_thread3Thread1of1ForFork0_~i~2_107) (let ((.cse1 (select (select |v_#memory_int_260| v_~A~0.base_162) (+ (* v_thread3Thread1of1ForFork0_~i~2_107 4) v_~A~0.offset_162 (- 4))))) (let ((.cse0 (< .cse1 v_~min3~0_89))) (or (and (not .cse0) (= v_~min3~0_89 v_~min3~0_88) (= |v_thread3Thread1of1ForFork0_#t~mem9_42| |v_thread3Thread1of1ForFork0_#t~mem9_41|)) (and (= v_~min3~0_88 .cse1) .cse0))))) InVars {~A~0.base=v_~A~0.base_162, ~A~0.offset=v_~A~0.offset_162, ~M~0=v_~M~0_85, #memory_int=|v_#memory_int_260|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_42|, ~N~0=v_~N~0_145, ~min3~0=v_~min3~0_89} OutVars{~A~0.base=v_~A~0.base_162, ~A~0.offset=v_~A~0.offset_162, ~M~0=v_~M~0_85, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_107, #memory_int=|v_#memory_int_260|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_41|, ~N~0=v_~N~0_145, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_23|, ~min3~0=v_~min3~0_88} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:08:58,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [601] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_17| 0) (= |v_thread2Thread1of1ForFork2_#res.base_17| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_73 v_~M~0_81)) (= v_thread3Thread1of1ForFork0_~i~2_103 v_~M~0_81)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_73, ~M~0=v_~M~0_81} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_73, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_17|, ~M~0=v_~M~0_81, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_103, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, thread2Thread1of1ForFork2_#res.offset] [2022-12-13 02:08:58,266 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:58,266 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:58,457 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:58,457 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:58,660 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:58,661 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:08:58,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] [2022-12-13 02:08:58,851 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:08:58,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 818 [2022-12-13 02:08:58,852 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 828 flow [2022-12-13 02:08:58,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:58,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:58,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:58,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:08:58,852 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-13 02:08:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1143882013, now seen corresponding path program 1 times [2022-12-13 02:08:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:58,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934670427] [2022-12-13 02:08:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:58,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934670427] [2022-12-13 02:08:58,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934670427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:58,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:58,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215337263] [2022-12-13 02:08:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:58,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:58,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 02:08:58,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 828 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:58,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:58,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 02:08:58,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:59,237 INFO L130 PetriNetUnfolder]: 900/1486 cut-off events. [2022-12-13 02:08:59,237 INFO L131 PetriNetUnfolder]: For 10651/10741 co-relation queries the response was YES. [2022-12-13 02:08:59,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7354 conditions, 1486 events. 900/1486 cut-off events. For 10651/10741 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7250 event pairs, 301 based on Foata normal form. 122/1589 useless extension candidates. Maximal degree in co-relation 7287. Up to 520 conditions per place. [2022-12-13 02:08:59,254 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 97 selfloop transitions, 17 changer transitions 1/119 dead transitions. [2022-12-13 02:08:59,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 119 transitions, 1237 flow [2022-12-13 02:08:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 02:08:59,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3872340425531915 [2022-12-13 02:08:59,255 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 828 flow. Second operand 5 states and 91 transitions. [2022-12-13 02:08:59,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 119 transitions, 1237 flow [2022-12-13 02:08:59,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 1183 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-13 02:08:59,281 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 824 flow [2022-12-13 02:08:59,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=824, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2022-12-13 02:08:59,282 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2022-12-13 02:08:59,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:59,282 INFO L89 Accepts]: Start accepts. Operand has 74 places, 82 transitions, 824 flow [2022-12-13 02:08:59,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:59,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:59,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 82 transitions, 824 flow [2022-12-13 02:08:59,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 82 transitions, 824 flow [2022-12-13 02:08:59,306 INFO L130 PetriNetUnfolder]: 86/312 cut-off events. [2022-12-13 02:08:59,306 INFO L131 PetriNetUnfolder]: For 1502/1515 co-relation queries the response was YES. [2022-12-13 02:08:59,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 312 events. 86/312 cut-off events. For 1502/1515 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1784 event pairs, 3 based on Foata normal form. 12/303 useless extension candidates. Maximal degree in co-relation 1132. Up to 88 conditions per place. [2022-12-13 02:08:59,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 82 transitions, 824 flow [2022-12-13 02:08:59,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-13 02:08:59,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:59,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 02:08:59,312 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 824 flow [2022-12-13 02:08:59,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:59,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:59,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 02:08:59,312 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-13 02:08:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1428130765, now seen corresponding path program 1 times [2022-12-13 02:08:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:59,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529177469] [2022-12-13 02:08:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:59,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529177469] [2022-12-13 02:08:59,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529177469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:59,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:59,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:08:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168087723] [2022-12-13 02:08:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:59,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:59,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 02:08:59,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 824 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-13 02:08:59,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:59,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 02:08:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:59,622 INFO L130 PetriNetUnfolder]: 884/1461 cut-off events. [2022-12-13 02:08:59,622 INFO L131 PetriNetUnfolder]: For 8810/8897 co-relation queries the response was YES. [2022-12-13 02:08:59,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7048 conditions, 1461 events. 884/1461 cut-off events. For 8810/8897 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7150 event pairs, 131 based on Foata normal form. 87/1529 useless extension candidates. Maximal degree in co-relation 6519. Up to 880 conditions per place. [2022-12-13 02:08:59,631 INFO L137 encePairwiseOnDemand]: 34/45 looper letters, 84 selfloop transitions, 18 changer transitions 0/106 dead transitions. [2022-12-13 02:08:59,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 1148 flow [2022-12-13 02:08:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-13 02:08:59,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-13 02:08:59,632 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 824 flow. Second operand 5 states and 70 transitions. [2022-12-13 02:08:59,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 1148 flow [2022-12-13 02:08:59,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 1128 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 02:08:59,650 INFO L231 Difference]: Finished difference. Result has 77 places, 81 transitions, 820 flow [2022-12-13 02:08:59,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=820, PETRI_PLACES=77, PETRI_TRANSITIONS=81} [2022-12-13 02:08:59,651 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2022-12-13 02:08:59,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:59,651 INFO L89 Accepts]: Start accepts. Operand has 77 places, 81 transitions, 820 flow [2022-12-13 02:08:59,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:59,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:59,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 81 transitions, 820 flow [2022-12-13 02:08:59,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 81 transitions, 820 flow [2022-12-13 02:08:59,670 INFO L130 PetriNetUnfolder]: 79/297 cut-off events. [2022-12-13 02:08:59,670 INFO L131 PetriNetUnfolder]: For 1292/1302 co-relation queries the response was YES. [2022-12-13 02:08:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 297 events. 79/297 cut-off events. For 1292/1302 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1689 event pairs, 6 based on Foata normal form. 9/291 useless extension candidates. Maximal degree in co-relation 1014. Up to 76 conditions per place. [2022-12-13 02:08:59,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 81 transitions, 820 flow [2022-12-13 02:08:59,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-13 02:08:59,673 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:59,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 02:08:59,675 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 81 transitions, 820 flow [2022-12-13 02:08:59,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-13 02:08:59,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:59,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:59,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 02:08:59,675 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-13 02:08:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1359577964, now seen corresponding path program 1 times [2022-12-13 02:08:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:59,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179664049] [2022-12-13 02:08:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:59,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179664049] [2022-12-13 02:08:59,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179664049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:59,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:59,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48842616] [2022-12-13 02:08:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:08:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:08:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:08:59,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-13 02:08:59,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 81 transitions, 820 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:59,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:59,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-13 02:08:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:59,981 INFO L130 PetriNetUnfolder]: 855/1435 cut-off events. [2022-12-13 02:08:59,982 INFO L131 PetriNetUnfolder]: For 9095/9185 co-relation queries the response was YES. [2022-12-13 02:08:59,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6914 conditions, 1435 events. 855/1435 cut-off events. For 9095/9185 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7187 event pairs, 241 based on Foata normal form. 118/1536 useless extension candidates. Maximal degree in co-relation 6133. Up to 520 conditions per place. [2022-12-13 02:08:59,990 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 94 selfloop transitions, 17 changer transitions 1/116 dead transitions. [2022-12-13 02:08:59,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 116 transitions, 1203 flow [2022-12-13 02:08:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 02:08:59,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-13 02:08:59,991 INFO L175 Difference]: Start difference. First operand has 77 places, 81 transitions, 820 flow. Second operand 5 states and 85 transitions. [2022-12-13 02:08:59,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 116 transitions, 1203 flow [2022-12-13 02:09:00,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 1176 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 02:09:00,011 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 812 flow [2022-12-13 02:09:00,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=812, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-12-13 02:09:00,012 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2022-12-13 02:09:00,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:00,012 INFO L89 Accepts]: Start accepts. Operand has 78 places, 79 transitions, 812 flow [2022-12-13 02:09:00,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:00,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:00,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 79 transitions, 812 flow [2022-12-13 02:09:00,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 812 flow [2022-12-13 02:09:00,037 INFO L130 PetriNetUnfolder]: 75/301 cut-off events. [2022-12-13 02:09:00,037 INFO L131 PetriNetUnfolder]: For 1346/1356 co-relation queries the response was YES. [2022-12-13 02:09:00,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 301 events. 75/301 cut-off events. For 1346/1356 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1769 event pairs, 6 based on Foata normal form. 9/296 useless extension candidates. Maximal degree in co-relation 1025. Up to 74 conditions per place. [2022-12-13 02:09:00,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 79 transitions, 812 flow [2022-12-13 02:09:00,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 02:09:00,040 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:00,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 02:09:00,041 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 812 flow [2022-12-13 02:09:00,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:00,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:00,041 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:00,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 02:09:00,041 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-13 02:09:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -964971005, now seen corresponding path program 1 times [2022-12-13 02:09:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181719928] [2022-12-13 02:09:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181719928] [2022-12-13 02:09:00,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181719928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:00,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:00,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:09:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441909463] [2022-12-13 02:09:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:00,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:09:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:00,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:09:00,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:09:00,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 02:09:00,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 812 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-13 02:09:00,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:00,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 02:09:00,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:00,330 INFO L130 PetriNetUnfolder]: 783/1315 cut-off events. [2022-12-13 02:09:00,331 INFO L131 PetriNetUnfolder]: For 8920/9010 co-relation queries the response was YES. [2022-12-13 02:09:00,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 1315 events. 783/1315 cut-off events. For 8920/9010 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6449 event pairs, 308 based on Foata normal form. 134/1430 useless extension candidates. Maximal degree in co-relation 5715. Up to 837 conditions per place. [2022-12-13 02:09:00,337 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 89 selfloop transitions, 8 changer transitions 4/105 dead transitions. [2022-12-13 02:09:00,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 1043 flow [2022-12-13 02:09:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:09:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:09:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 02:09:00,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2022-12-13 02:09:00,339 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 812 flow. Second operand 5 states and 79 transitions. [2022-12-13 02:09:00,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 1043 flow [2022-12-13 02:09:00,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 1009 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:00,351 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 721 flow [2022-12-13 02:09:00,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=721, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2022-12-13 02:09:00,351 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2022-12-13 02:09:00,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:00,351 INFO L89 Accepts]: Start accepts. Operand has 80 places, 74 transitions, 721 flow [2022-12-13 02:09:00,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:00,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:00,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 721 flow [2022-12-13 02:09:00,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 721 flow [2022-12-13 02:09:00,366 INFO L130 PetriNetUnfolder]: 60/243 cut-off events. [2022-12-13 02:09:00,367 INFO L131 PetriNetUnfolder]: For 937/947 co-relation queries the response was YES. [2022-12-13 02:09:00,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 243 events. 60/243 cut-off events. For 937/947 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1314 event pairs, 6 based on Foata normal form. 9/235 useless extension candidates. Maximal degree in co-relation 796. Up to 51 conditions per place. [2022-12-13 02:09:00,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 721 flow [2022-12-13 02:09:00,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 02:09:00,399 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:00,399 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:00,596 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:09:00,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 02:09:00,597 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 737 flow [2022-12-13 02:09:00,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-13 02:09:00,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:00,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:00,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:09:00,597 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-13 02:09:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1165745888, now seen corresponding path program 1 times [2022-12-13 02:09:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:00,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830627385] [2022-12-13 02:09:00,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:00,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:01,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830627385] [2022-12-13 02:09:01,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830627385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067071683] [2022-12-13 02:09:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:01,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:01,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:01,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 02:09:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:01,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 02:09:01,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:01,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 02:09:01,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:09:01,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:01,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-13 02:09:01,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:01,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-13 02:09:01,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:01,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-12-13 02:09:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:01,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:07,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067071683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:07,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:07,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-13 02:09:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106059600] [2022-12-13 02:09:07,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:07,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 02:09:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 02:09:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=397, Unknown=16, NotChecked=0, Total=506 [2022-12-13 02:09:07,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 02:09:07,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 737 flow. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:07,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:07,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 02:09:07,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:08,496 INFO L130 PetriNetUnfolder]: 993/1683 cut-off events. [2022-12-13 02:09:08,496 INFO L131 PetriNetUnfolder]: For 10720/10783 co-relation queries the response was YES. [2022-12-13 02:09:08,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8262 conditions, 1683 events. 993/1683 cut-off events. For 10720/10783 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8908 event pairs, 120 based on Foata normal form. 66/1731 useless extension candidates. Maximal degree in co-relation 7638. Up to 1049 conditions per place. [2022-12-13 02:09:08,504 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 101 selfloop transitions, 31 changer transitions 53/188 dead transitions. [2022-12-13 02:09:08,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 188 transitions, 1876 flow [2022-12-13 02:09:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:09:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:09:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2022-12-13 02:09:08,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 02:09:08,505 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 737 flow. Second operand 12 states and 147 transitions. [2022-12-13 02:09:08,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 188 transitions, 1876 flow [2022-12-13 02:09:08,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 188 transitions, 1835 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-13 02:09:08,522 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 997 flow [2022-12-13 02:09:08,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=997, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-12-13 02:09:08,522 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2022-12-13 02:09:08,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:08,522 INFO L89 Accepts]: Start accepts. Operand has 93 places, 91 transitions, 997 flow [2022-12-13 02:09:08,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:08,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:08,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 91 transitions, 997 flow [2022-12-13 02:09:08,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 91 transitions, 997 flow [2022-12-13 02:09:08,542 INFO L130 PetriNetUnfolder]: 77/285 cut-off events. [2022-12-13 02:09:08,542 INFO L131 PetriNetUnfolder]: For 1399/1426 co-relation queries the response was YES. [2022-12-13 02:09:08,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 285 events. 77/285 cut-off events. For 1399/1426 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1548 event pairs, 6 based on Foata normal form. 8/280 useless extension candidates. Maximal degree in co-relation 1163. Up to 72 conditions per place. [2022-12-13 02:09:08,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 91 transitions, 997 flow [2022-12-13 02:09:08,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 02:09:08,546 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:08,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 02:09:08,547 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 997 flow [2022-12-13 02:09:08,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:08,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:08,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:08,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 02:09:08,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:08,752 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-13 02:09:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -804392883, now seen corresponding path program 1 times [2022-12-13 02:09:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:08,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515283974] [2022-12-13 02:09:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:09,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515283974] [2022-12-13 02:09:09,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515283974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:09,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:09,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:09:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712255004] [2022-12-13 02:09:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:09,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:09:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:09,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:09:09,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:09:09,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 02:09:09,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 997 flow. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:09,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:09,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 02:09:09,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:09,909 INFO L130 PetriNetUnfolder]: 1019/1722 cut-off events. [2022-12-13 02:09:09,909 INFO L131 PetriNetUnfolder]: For 11576/11643 co-relation queries the response was YES. [2022-12-13 02:09:09,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9084 conditions, 1722 events. 1019/1722 cut-off events. For 11576/11643 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9101 event pairs, 169 based on Foata normal form. 67/1766 useless extension candidates. Maximal degree in co-relation 9008. Up to 1078 conditions per place. [2022-12-13 02:09:09,919 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 110 selfloop transitions, 40 changer transitions 18/171 dead transitions. [2022-12-13 02:09:09,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 171 transitions, 1825 flow [2022-12-13 02:09:09,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:09:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:09:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-13 02:09:09,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33604336043360433 [2022-12-13 02:09:09,920 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 997 flow. Second operand 9 states and 124 transitions. [2022-12-13 02:09:09,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 171 transitions, 1825 flow [2022-12-13 02:09:09,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 171 transitions, 1747 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:09,948 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 1169 flow [2022-12-13 02:09:09,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1169, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2022-12-13 02:09:09,949 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2022-12-13 02:09:09,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:09,949 INFO L89 Accepts]: Start accepts. Operand has 96 places, 103 transitions, 1169 flow [2022-12-13 02:09:09,950 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:09,950 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:09,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 103 transitions, 1169 flow [2022-12-13 02:09:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 103 transitions, 1169 flow [2022-12-13 02:09:09,973 INFO L130 PetriNetUnfolder]: 104/358 cut-off events. [2022-12-13 02:09:09,973 INFO L131 PetriNetUnfolder]: For 1604/1644 co-relation queries the response was YES. [2022-12-13 02:09:09,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 358 events. 104/358 cut-off events. For 1604/1644 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2085 event pairs, 5 based on Foata normal form. 10/350 useless extension candidates. Maximal degree in co-relation 1472. Up to 95 conditions per place. [2022-12-13 02:09:09,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 103 transitions, 1169 flow [2022-12-13 02:09:09,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-13 02:09:09,977 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:09,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 02:09:09,978 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 1169 flow [2022-12-13 02:09:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:09,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:09,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:09,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 02:09:09,978 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-13 02:09:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 530198447, now seen corresponding path program 2 times [2022-12-13 02:09:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:09,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635968754] [2022-12-13 02:09:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:10,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635968754] [2022-12-13 02:09:10,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635968754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:10,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:10,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:09:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071919560] [2022-12-13 02:09:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:10,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:09:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:10,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:09:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:09:10,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 02:09:10,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 1169 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:10,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:10,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 02:09:10,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:11,140 INFO L130 PetriNetUnfolder]: 1013/1704 cut-off events. [2022-12-13 02:09:11,140 INFO L131 PetriNetUnfolder]: For 11299/11374 co-relation queries the response was YES. [2022-12-13 02:09:11,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8887 conditions, 1704 events. 1013/1704 cut-off events. For 11299/11374 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8952 event pairs, 232 based on Foata normal form. 76/1765 useless extension candidates. Maximal degree in co-relation 8823. Up to 1276 conditions per place. [2022-12-13 02:09:11,151 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 95 selfloop transitions, 16 changer transitions 33/147 dead transitions. [2022-12-13 02:09:11,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1665 flow [2022-12-13 02:09:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:09:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:09:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-13 02:09:11,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34146341463414637 [2022-12-13 02:09:11,152 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 1169 flow. Second operand 7 states and 98 transitions. [2022-12-13 02:09:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1665 flow [2022-12-13 02:09:11,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 147 transitions, 1607 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:11,180 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 1099 flow [2022-12-13 02:09:11,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1099, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2022-12-13 02:09:11,181 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2022-12-13 02:09:11,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:11,181 INFO L89 Accepts]: Start accepts. Operand has 98 places, 100 transitions, 1099 flow [2022-12-13 02:09:11,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:11,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:11,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 100 transitions, 1099 flow [2022-12-13 02:09:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 100 transitions, 1099 flow [2022-12-13 02:09:11,214 INFO L130 PetriNetUnfolder]: 102/341 cut-off events. [2022-12-13 02:09:11,214 INFO L131 PetriNetUnfolder]: For 1546/1574 co-relation queries the response was YES. [2022-12-13 02:09:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 341 events. 102/341 cut-off events. For 1546/1574 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1909 event pairs, 9 based on Foata normal form. 10/335 useless extension candidates. Maximal degree in co-relation 1399. Up to 93 conditions per place. [2022-12-13 02:09:11,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 100 transitions, 1099 flow [2022-12-13 02:09:11,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-13 02:09:11,219 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:11,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 02:09:11,220 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 100 transitions, 1099 flow [2022-12-13 02:09:11,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:11,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:11,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:11,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:09:11,221 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-13 02:09:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1423429433, now seen corresponding path program 1 times [2022-12-13 02:09:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:11,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290414717] [2022-12-13 02:09:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290414717] [2022-12-13 02:09:11,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290414717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:11,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:11,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:09:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112290278] [2022-12-13 02:09:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:09:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:09:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:09:11,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:09:11,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 100 transitions, 1099 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:11,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:11,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:09:11,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:11,718 INFO L130 PetriNetUnfolder]: 1221/2033 cut-off events. [2022-12-13 02:09:11,718 INFO L131 PetriNetUnfolder]: For 12464/12464 co-relation queries the response was YES. [2022-12-13 02:09:11,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10347 conditions, 2033 events. 1221/2033 cut-off events. For 12464/12464 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10494 event pairs, 204 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 10276. Up to 720 conditions per place. [2022-12-13 02:09:11,733 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 169 selfloop transitions, 48 changer transitions 11/228 dead transitions. [2022-12-13 02:09:11,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 228 transitions, 2620 flow [2022-12-13 02:09:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:09:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:09:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-13 02:09:11,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36944444444444446 [2022-12-13 02:09:11,734 INFO L175 Difference]: Start difference. First operand has 93 places, 100 transitions, 1099 flow. Second operand 9 states and 133 transitions. [2022-12-13 02:09:11,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 228 transitions, 2620 flow [2022-12-13 02:09:11,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 228 transitions, 2536 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-13 02:09:11,771 INFO L231 Difference]: Finished difference. Result has 99 places, 113 transitions, 1380 flow [2022-12-13 02:09:11,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1380, PETRI_PLACES=99, PETRI_TRANSITIONS=113} [2022-12-13 02:09:11,772 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-13 02:09:11,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:11,772 INFO L89 Accepts]: Start accepts. Operand has 99 places, 113 transitions, 1380 flow [2022-12-13 02:09:11,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:11,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:11,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 113 transitions, 1380 flow [2022-12-13 02:09:11,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 113 transitions, 1380 flow [2022-12-13 02:09:11,807 INFO L130 PetriNetUnfolder]: 119/417 cut-off events. [2022-12-13 02:09:11,807 INFO L131 PetriNetUnfolder]: For 2084/2114 co-relation queries the response was YES. [2022-12-13 02:09:11,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 417 events. 119/417 cut-off events. For 2084/2114 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2573 event pairs, 10 based on Foata normal form. 9/412 useless extension candidates. Maximal degree in co-relation 1664. Up to 110 conditions per place. [2022-12-13 02:09:11,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 113 transitions, 1380 flow [2022-12-13 02:09:11,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 02:09:11,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] and [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] [2022-12-13 02:09:12,081 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:09:12,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 02:09:12,082 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 111 transitions, 1370 flow [2022-12-13 02:09:12,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:12,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:12,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:12,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 02:09:12,082 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-13 02:09:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash 123632217, now seen corresponding path program 1 times [2022-12-13 02:09:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174073769] [2022-12-13 02:09:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:12,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174073769] [2022-12-13 02:09:12,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174073769] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:12,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614130742] [2022-12-13 02:09:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:12,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:12,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:12,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:12,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 02:09:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:12,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 02:09:12,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:12,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:12,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-13 02:09:13,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:13,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-13 02:09:13,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:13,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 50 [2022-12-13 02:09:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:13,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:14,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:14,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 891 treesize of output 857 [2022-12-13 02:09:14,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 768 treesize of output 744 [2022-12-13 02:09:14,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 744 treesize of output 696 [2022-12-13 02:09:14,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 696 treesize of output 684 [2022-12-13 02:09:14,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 678 [2022-12-13 02:09:14,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 678 treesize of output 642 [2022-12-13 02:09:14,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 642 treesize of output 570 [2022-12-13 02:09:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:16,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614130742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:16,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:16,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-12-13 02:09:16,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332181768] [2022-12-13 02:09:16,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:16,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 02:09:16,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:16,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 02:09:16,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=621, Unknown=7, NotChecked=0, Total=756 [2022-12-13 02:09:16,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 02:09:16,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 111 transitions, 1370 flow. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:16,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:16,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 02:09:16,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:19,209 INFO L130 PetriNetUnfolder]: 1512/2583 cut-off events. [2022-12-13 02:09:19,209 INFO L131 PetriNetUnfolder]: For 21990/22233 co-relation queries the response was YES. [2022-12-13 02:09:19,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14543 conditions, 2583 events. 1512/2583 cut-off events. For 21990/22233 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14995 event pairs, 206 based on Foata normal form. 248/2814 useless extension candidates. Maximal degree in co-relation 13740. Up to 1248 conditions per place. [2022-12-13 02:09:19,220 INFO L137 encePairwiseOnDemand]: 17/41 looper letters, 134 selfloop transitions, 85 changer transitions 61/282 dead transitions. [2022-12-13 02:09:19,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 282 transitions, 3079 flow [2022-12-13 02:09:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 02:09:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 02:09:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 217 transitions. [2022-12-13 02:09:19,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2785622593068036 [2022-12-13 02:09:19,221 INFO L175 Difference]: Start difference. First operand has 96 places, 111 transitions, 1370 flow. Second operand 19 states and 217 transitions. [2022-12-13 02:09:19,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 282 transitions, 3079 flow [2022-12-13 02:09:19,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 282 transitions, 2913 flow, removed 77 selfloop flow, removed 2 redundant places. [2022-12-13 02:09:19,265 INFO L231 Difference]: Finished difference. Result has 121 places, 143 transitions, 1883 flow [2022-12-13 02:09:19,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1883, PETRI_PLACES=121, PETRI_TRANSITIONS=143} [2022-12-13 02:09:19,266 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2022-12-13 02:09:19,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:19,266 INFO L89 Accepts]: Start accepts. Operand has 121 places, 143 transitions, 1883 flow [2022-12-13 02:09:19,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:19,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:19,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 143 transitions, 1883 flow [2022-12-13 02:09:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 143 transitions, 1883 flow [2022-12-13 02:09:19,305 INFO L130 PetriNetUnfolder]: 169/556 cut-off events. [2022-12-13 02:09:19,305 INFO L131 PetriNetUnfolder]: For 3514/3565 co-relation queries the response was YES. [2022-12-13 02:09:19,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 556 events. 169/556 cut-off events. For 3514/3565 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3631 event pairs, 9 based on Foata normal form. 12/550 useless extension candidates. Maximal degree in co-relation 2620. Up to 157 conditions per place. [2022-12-13 02:09:19,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 143 transitions, 1883 flow [2022-12-13 02:09:19,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 986 [2022-12-13 02:09:19,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] and [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] [2022-12-13 02:09:19,376 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:19,376 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:19,559 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:19,559 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:19,746 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:09:19,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 481 [2022-12-13 02:09:19,747 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 134 transitions, 1758 flow [2022-12-13 02:09:19,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:19,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:19,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:19,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 02:09:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 02:09:19,954 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-13 02:09:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 692939587, now seen corresponding path program 1 times [2022-12-13 02:09:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718971661] [2022-12-13 02:09:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:20,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:20,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718971661] [2022-12-13 02:09:20,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718971661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:20,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612434763] [2022-12-13 02:09:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:20,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:20,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:20,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:20,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 02:09:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:20,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 02:09:20,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:21,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 02:09:21,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:09:21,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:21,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-13 02:09:21,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:21,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-13 02:09:21,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:09:21,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 50 [2022-12-13 02:09:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:21,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:22,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612434763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:22,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:22,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-12-13 02:09:22,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869248174] [2022-12-13 02:09:22,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 02:09:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 02:09:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2022-12-13 02:09:22,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:09:22,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 134 transitions, 1758 flow. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:22,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:22,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:09:22,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:32,804 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 133 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:09:34,060 INFO L130 PetriNetUnfolder]: 2034/3361 cut-off events. [2022-12-13 02:09:34,060 INFO L131 PetriNetUnfolder]: For 29907/29907 co-relation queries the response was YES. [2022-12-13 02:09:34,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19682 conditions, 3361 events. 2034/3361 cut-off events. For 29907/29907 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18813 event pairs, 256 based on Foata normal form. 4/3356 useless extension candidates. Maximal degree in co-relation 19529. Up to 1830 conditions per place. [2022-12-13 02:09:34,094 INFO L137 encePairwiseOnDemand]: 19/42 looper letters, 173 selfloop transitions, 98 changer transitions 29/300 dead transitions. [2022-12-13 02:09:34,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 300 transitions, 3751 flow [2022-12-13 02:09:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:09:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:09:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 189 transitions. [2022-12-13 02:09:34,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-13 02:09:34,098 INFO L175 Difference]: Start difference. First operand has 114 places, 134 transitions, 1758 flow. Second operand 16 states and 189 transitions. [2022-12-13 02:09:34,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 300 transitions, 3751 flow [2022-12-13 02:09:34,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 300 transitions, 3408 flow, removed 142 selfloop flow, removed 7 redundant places. [2022-12-13 02:09:34,236 INFO L231 Difference]: Finished difference. Result has 129 places, 171 transitions, 2307 flow [2022-12-13 02:09:34,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2307, PETRI_PLACES=129, PETRI_TRANSITIONS=171} [2022-12-13 02:09:34,236 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2022-12-13 02:09:34,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:34,236 INFO L89 Accepts]: Start accepts. Operand has 129 places, 171 transitions, 2307 flow [2022-12-13 02:09:34,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:34,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:34,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 171 transitions, 2307 flow [2022-12-13 02:09:34,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 171 transitions, 2307 flow [2022-12-13 02:09:34,300 INFO L130 PetriNetUnfolder]: 212/686 cut-off events. [2022-12-13 02:09:34,300 INFO L131 PetriNetUnfolder]: For 4308/4338 co-relation queries the response was YES. [2022-12-13 02:09:34,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3435 conditions, 686 events. 212/686 cut-off events. For 4308/4338 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4878 event pairs, 14 based on Foata normal form. 15/681 useless extension candidates. Maximal degree in co-relation 3318. Up to 176 conditions per place. [2022-12-13 02:09:34,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 171 transitions, 2307 flow [2022-12-13 02:09:34,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 02:09:34,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:09:34,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:34,623 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:34,624 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:34,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:09:34,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:35,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:35,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_2| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_2| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_1 v_~N~0_In_5))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_1, ~N~0=v_~N~0_In_5} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_1, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_2|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_2|, ~N~0=v_~N~0_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:40,050 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:09:40,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5815 [2022-12-13 02:09:40,051 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 170 transitions, 2357 flow [2022-12-13 02:09:40,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:40,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:40,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:40,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 02:09:40,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:40,252 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-13 02:09:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1587538095, now seen corresponding path program 2 times [2022-12-13 02:09:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:40,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404460083] [2022-12-13 02:09:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:40,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404460083] [2022-12-13 02:09:40,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404460083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:40,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:40,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:09:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306319342] [2022-12-13 02:09:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:09:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:09:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:09:40,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 02:09:40,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 170 transitions, 2357 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:40,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:40,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 02:09:40,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:40,900 INFO L130 PetriNetUnfolder]: 2299/3745 cut-off events. [2022-12-13 02:09:40,900 INFO L131 PetriNetUnfolder]: For 38896/38896 co-relation queries the response was YES. [2022-12-13 02:09:40,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23718 conditions, 3745 events. 2299/3745 cut-off events. For 38896/38896 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21419 event pairs, 295 based on Foata normal form. 2/3737 useless extension candidates. Maximal degree in co-relation 23023. Up to 1796 conditions per place. [2022-12-13 02:09:40,920 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 226 selfloop transitions, 112 changer transitions 3/341 dead transitions. [2022-12-13 02:09:40,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 341 transitions, 5239 flow [2022-12-13 02:09:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:09:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:09:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 02:09:40,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2022-12-13 02:09:40,932 INFO L175 Difference]: Start difference. First operand has 111 places, 170 transitions, 2357 flow. Second operand 6 states and 118 transitions. [2022-12-13 02:09:40,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 341 transitions, 5239 flow [2022-12-13 02:09:41,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 341 transitions, 4626 flow, removed 198 selfloop flow, removed 14 redundant places. [2022-12-13 02:09:41,051 INFO L231 Difference]: Finished difference. Result has 104 places, 224 transitions, 3160 flow [2022-12-13 02:09:41,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3160, PETRI_PLACES=104, PETRI_TRANSITIONS=224} [2022-12-13 02:09:41,052 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2022-12-13 02:09:41,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:41,052 INFO L89 Accepts]: Start accepts. Operand has 104 places, 224 transitions, 3160 flow [2022-12-13 02:09:41,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:41,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:41,053 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 224 transitions, 3160 flow [2022-12-13 02:09:41,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 224 transitions, 3160 flow [2022-12-13 02:09:41,113 INFO L130 PetriNetUnfolder]: 264/860 cut-off events. [2022-12-13 02:09:41,113 INFO L131 PetriNetUnfolder]: For 5088/5160 co-relation queries the response was YES. [2022-12-13 02:09:41,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 860 events. 264/860 cut-off events. For 5088/5160 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6440 event pairs, 13 based on Foata normal form. 16/847 useless extension candidates. Maximal degree in co-relation 4181. Up to 195 conditions per place. [2022-12-13 02:09:41,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 224 transitions, 3160 flow [2022-12-13 02:09:41,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 1510 [2022-12-13 02:09:41,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [635] $Ultimate##0-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_318| v_~A~0.base_206))) (and (< v_thread3Thread1of1ForFork0_~i~2_195 v_~N~0_185) (< v_thread1Thread1of1ForFork1_~i~0_137 (+ v_~N~0_185 1)) (= v_thread3Thread1of1ForFork0_~i~2_194 (+ v_thread3Thread1of1ForFork0_~i~2_195 1)) (= v_thread1Thread1of1ForFork1_~i~0_137 1) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_206 (* v_thread3Thread1of1ForFork0_~i~2_195 4))))) (let ((.cse0 (< .cse1 v_~min3~0_170))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem9_125| |v_thread3Thread1of1ForFork0_#t~mem9_126|) (= v_~min3~0_170 v_~min3~0_169) (not .cse0)) (and (= .cse1 v_~min3~0_169) .cse0)))) (let ((.cse3 (select .cse2 (+ (* v_thread1Thread1of1ForFork1_~i~0_137 4) v_~A~0.offset_206 (- 4))))) (let ((.cse4 (< .cse3 v_~min1~0_239))) (or (and (= v_~min1~0_238 .cse3) .cse4) (and (= v_~min1~0_239 v_~min1~0_238) (= |v_thread1Thread1of1ForFork1_#t~mem3_193| |v_thread1Thread1of1ForFork1_#t~mem3_192|) (not .cse4))))))) InVars {~A~0.base=v_~A~0.base_206, ~A~0.offset=v_~A~0.offset_206, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_193|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_195, #memory_int=|v_#memory_int_318|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_126|, ~N~0=v_~N~0_185, ~min1~0=v_~min1~0_239, ~min3~0=v_~min3~0_170} OutVars{~A~0.base=v_~A~0.base_206, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_194, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_125|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_137, ~N~0=v_~N~0_185, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_71|, ~A~0.offset=v_~A~0.offset_206, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_107|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_192|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_115|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_79|, #memory_int=|v_#memory_int_318|, ~min1~0=v_~min1~0_238, ~min3~0=v_~min3~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:41,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:41,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:41,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:41,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:41,752 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:09:41,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 701 [2022-12-13 02:09:41,753 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 224 transitions, 3199 flow [2022-12-13 02:09:41,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:41,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:41,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:41,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 02:09:41,753 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-13 02:09:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:41,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1520734589, now seen corresponding path program 1 times [2022-12-13 02:09:41,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:41,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616977976] [2022-12-13 02:09:41,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:41,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:09:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:41,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616977976] [2022-12-13 02:09:41,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616977976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:41,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:41,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:09:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986181548] [2022-12-13 02:09:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:41,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:09:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:09:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:09:41,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 51 [2022-12-13 02:09:41,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 224 transitions, 3199 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-13 02:09:41,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:41,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 51 [2022-12-13 02:09:41,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:42,126 INFO L130 PetriNetUnfolder]: 1746/2922 cut-off events. [2022-12-13 02:09:42,126 INFO L131 PetriNetUnfolder]: For 30926/31309 co-relation queries the response was YES. [2022-12-13 02:09:42,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19113 conditions, 2922 events. 1746/2922 cut-off events. For 30926/31309 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16827 event pairs, 685 based on Foata normal form. 264/3049 useless extension candidates. Maximal degree in co-relation 18542. Up to 2861 conditions per place. [2022-12-13 02:09:42,144 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 184 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2022-12-13 02:09:42,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 195 transitions, 3093 flow [2022-12-13 02:09:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:09:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:09:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 02:09:42,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35947712418300654 [2022-12-13 02:09:42,145 INFO L175 Difference]: Start difference. First operand has 104 places, 224 transitions, 3199 flow. Second operand 3 states and 55 transitions. [2022-12-13 02:09:42,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 195 transitions, 3093 flow [2022-12-13 02:09:42,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 195 transitions, 2844 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-13 02:09:42,192 INFO L231 Difference]: Finished difference. Result has 101 places, 195 transitions, 2476 flow [2022-12-13 02:09:42,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2476, PETRI_PLACES=101, PETRI_TRANSITIONS=195} [2022-12-13 02:09:42,193 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2022-12-13 02:09:42,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:42,194 INFO L89 Accepts]: Start accepts. Operand has 101 places, 195 transitions, 2476 flow [2022-12-13 02:09:42,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:42,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:42,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 195 transitions, 2476 flow [2022-12-13 02:09:42,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 195 transitions, 2476 flow [2022-12-13 02:09:42,269 INFO L130 PetriNetUnfolder]: 256/849 cut-off events. [2022-12-13 02:09:42,270 INFO L131 PetriNetUnfolder]: For 4522/4553 co-relation queries the response was YES. [2022-12-13 02:09:42,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 849 events. 256/849 cut-off events. For 4522/4553 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6416 event pairs, 18 based on Foata normal form. 4/835 useless extension candidates. Maximal degree in co-relation 3922. Up to 199 conditions per place. [2022-12-13 02:09:42,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 195 transitions, 2476 flow [2022-12-13 02:09:42,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 1258 [2022-12-13 02:09:42,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [544] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre15#1_29|)) |v_#memory_int_148|) (= |v_ULTIMATE.start_main_#t~pre15#1_29| |v_#pthreadsForks_63|) (= |v_#pthreadsForks_62| (+ |v_#pthreadsForks_63| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 02:09:42,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [527] L93-4-->L94-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_122|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_59|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_13|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 02:09:42,448 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:09:42,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 02:09:42,449 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 195 transitions, 2494 flow [2022-12-13 02:09:42,449 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-13 02:09:42,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:42,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:42,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 02:09:42,449 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 966389602, now seen corresponding path program 1 times [2022-12-13 02:09:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:42,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809018347] [2022-12-13 02:09:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809018347] [2022-12-13 02:09:42,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809018347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:42,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:42,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:09:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019157250] [2022-12-13 02:09:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:42,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:09:42,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:09:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:09:42,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:09:42,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 195 transitions, 2494 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-13 02:09:42,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:42,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:09:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:43,135 INFO L130 PetriNetUnfolder]: 2006/3226 cut-off events. [2022-12-13 02:09:43,135 INFO L131 PetriNetUnfolder]: For 25585/25585 co-relation queries the response was YES. [2022-12-13 02:09:43,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19507 conditions, 3226 events. 2006/3226 cut-off events. For 25585/25585 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17640 event pairs, 277 based on Foata normal form. 54/3271 useless extension candidates. Maximal degree in co-relation 18976. Up to 1681 conditions per place. [2022-12-13 02:09:43,154 INFO L137 encePairwiseOnDemand]: 27/52 looper letters, 198 selfloop transitions, 94 changer transitions 5/297 dead transitions. [2022-12-13 02:09:43,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 297 transitions, 4037 flow [2022-12-13 02:09:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:09:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:09:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-12-13 02:09:43,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-13 02:09:43,156 INFO L175 Difference]: Start difference. First operand has 101 places, 195 transitions, 2494 flow. Second operand 7 states and 117 transitions. [2022-12-13 02:09:43,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 297 transitions, 4037 flow [2022-12-13 02:09:43,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 297 transitions, 4034 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:09:43,244 INFO L231 Difference]: Finished difference. Result has 107 places, 196 transitions, 2725 flow [2022-12-13 02:09:43,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2725, PETRI_PLACES=107, PETRI_TRANSITIONS=196} [2022-12-13 02:09:43,244 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2022-12-13 02:09:43,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:43,244 INFO L89 Accepts]: Start accepts. Operand has 107 places, 196 transitions, 2725 flow [2022-12-13 02:09:43,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:43,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:43,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 196 transitions, 2725 flow [2022-12-13 02:09:43,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 196 transitions, 2725 flow [2022-12-13 02:09:43,299 INFO L130 PetriNetUnfolder]: 229/746 cut-off events. [2022-12-13 02:09:43,299 INFO L131 PetriNetUnfolder]: For 4401/4455 co-relation queries the response was YES. [2022-12-13 02:09:43,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 746 events. 229/746 cut-off events. For 4401/4455 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5390 event pairs, 11 based on Foata normal form. 14/739 useless extension candidates. Maximal degree in co-relation 3584. Up to 176 conditions per place. [2022-12-13 02:09:43,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 196 transitions, 2725 flow [2022-12-13 02:09:43,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 1270 [2022-12-13 02:09:43,308 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:43,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 02:09:43,309 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 196 transitions, 2725 flow [2022-12-13 02:09:43,309 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-13 02:09:43,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:43,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:43,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 02:09:43,309 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 596030793, now seen corresponding path program 1 times [2022-12-13 02:09:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:43,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167379448] [2022-12-13 02:09:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:43,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167379448] [2022-12-13 02:09:43,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167379448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:43,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:43,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:09:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911560102] [2022-12-13 02:09:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:43,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:09:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:43,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:09:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:09:43,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 52 [2022-12-13 02:09:43,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 196 transitions, 2725 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-13 02:09:43,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:43,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 52 [2022-12-13 02:09:43,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:43,742 INFO L130 PetriNetUnfolder]: 1567/2501 cut-off events. [2022-12-13 02:09:43,742 INFO L131 PetriNetUnfolder]: For 30541/30952 co-relation queries the response was YES. [2022-12-13 02:09:43,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17116 conditions, 2501 events. 1567/2501 cut-off events. For 30541/30952 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13100 event pairs, 450 based on Foata normal form. 386/2755 useless extension candidates. Maximal degree in co-relation 17080. Up to 1977 conditions per place. [2022-12-13 02:09:43,765 INFO L137 encePairwiseOnDemand]: 31/52 looper letters, 158 selfloop transitions, 34 changer transitions 0/200 dead transitions. [2022-12-13 02:09:43,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 200 transitions, 3143 flow [2022-12-13 02:09:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:09:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:09:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 02:09:43,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2022-12-13 02:09:43,766 INFO L175 Difference]: Start difference. First operand has 107 places, 196 transitions, 2725 flow. Second operand 4 states and 72 transitions. [2022-12-13 02:09:43,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 200 transitions, 3143 flow [2022-12-13 02:09:43,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 200 transitions, 2901 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-12-13 02:09:43,864 INFO L231 Difference]: Finished difference. Result has 99 places, 172 transitions, 2295 flow [2022-12-13 02:09:43,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2295, PETRI_PLACES=99, PETRI_TRANSITIONS=172} [2022-12-13 02:09:43,864 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-13 02:09:43,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:43,864 INFO L89 Accepts]: Start accepts. Operand has 99 places, 172 transitions, 2295 flow [2022-12-13 02:09:43,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:43,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:43,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 172 transitions, 2295 flow [2022-12-13 02:09:43,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 172 transitions, 2295 flow [2022-12-13 02:09:43,932 INFO L130 PetriNetUnfolder]: 273/731 cut-off events. [2022-12-13 02:09:43,932 INFO L131 PetriNetUnfolder]: For 5148/5211 co-relation queries the response was YES. [2022-12-13 02:09:43,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 731 events. 273/731 cut-off events. For 5148/5211 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4656 event pairs, 19 based on Foata normal form. 12/723 useless extension candidates. Maximal degree in co-relation 3813. Up to 233 conditions per place. [2022-12-13 02:09:43,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 172 transitions, 2295 flow [2022-12-13 02:09:43,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-13 02:09:43,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L70-4-->L46-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_85)) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_85)) (= v_thread1Thread1of1ForFork1_~i~0_47 1) (let ((.cse1 (select (select |v_#memory_int_182| v_~A~0.base_98) (+ (- 4) v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse0 (< .cse1 v_~min1~0_85))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse0) (= v_~min1~0_85 v_~min1~0_84)) (and (= v_~min1~0_84 .cse1) .cse0)))) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_85} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_84} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:09:44,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L70-4-->L46-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_85)) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_85)) (= v_thread1Thread1of1ForFork1_~i~0_47 1) (let ((.cse1 (select (select |v_#memory_int_182| v_~A~0.base_98) (+ (- 4) v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse0 (< .cse1 v_~min1~0_85))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse0) (= v_~min1~0_85 v_~min1~0_84)) (and (= v_~min1~0_84 .cse1) .cse0)))) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_85} OutVars{~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_182|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_84} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-13 02:09:44,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:09:44,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-13 02:09:44,327 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 171 transitions, 2311 flow [2022-12-13 02:09:44,328 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-13 02:09:44,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:44,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 02:09:44,328 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 134151087, now seen corresponding path program 1 times [2022-12-13 02:09:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:44,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722144147] [2022-12-13 02:09:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:09:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:44,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722144147] [2022-12-13 02:09:44,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722144147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:44,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:44,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:09:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780624384] [2022-12-13 02:09:44,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:44,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:09:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:09:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:09:44,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 52 [2022-12-13 02:09:44,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 171 transitions, 2311 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:44,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:44,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 52 [2022-12-13 02:09:44,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:44,902 INFO L130 PetriNetUnfolder]: 2244/3570 cut-off events. [2022-12-13 02:09:44,902 INFO L131 PetriNetUnfolder]: For 43429/44055 co-relation queries the response was YES. [2022-12-13 02:09:44,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24435 conditions, 3570 events. 2244/3570 cut-off events. For 43429/44055 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 19968 event pairs, 830 based on Foata normal form. 370/3789 useless extension candidates. Maximal degree in co-relation 23036. Up to 2244 conditions per place. [2022-12-13 02:09:44,925 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 227 selfloop transitions, 23 changer transitions 0/258 dead transitions. [2022-12-13 02:09:44,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 258 transitions, 3968 flow [2022-12-13 02:09:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:09:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:09:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 02:09:44,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 02:09:44,926 INFO L175 Difference]: Start difference. First operand has 97 places, 171 transitions, 2311 flow. Second operand 4 states and 104 transitions. [2022-12-13 02:09:44,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 258 transitions, 3968 flow [2022-12-13 02:09:44,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 258 transitions, 3840 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-13 02:09:44,989 INFO L231 Difference]: Finished difference. Result has 96 places, 190 transitions, 2712 flow [2022-12-13 02:09:44,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2712, PETRI_PLACES=96, PETRI_TRANSITIONS=190} [2022-12-13 02:09:44,991 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2022-12-13 02:09:44,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:44,991 INFO L89 Accepts]: Start accepts. Operand has 96 places, 190 transitions, 2712 flow [2022-12-13 02:09:44,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:44,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:44,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 190 transitions, 2712 flow [2022-12-13 02:09:44,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 190 transitions, 2712 flow [2022-12-13 02:09:45,065 INFO L130 PetriNetUnfolder]: 374/1002 cut-off events. [2022-12-13 02:09:45,065 INFO L131 PetriNetUnfolder]: For 6609/6719 co-relation queries the response was YES. [2022-12-13 02:09:45,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5687 conditions, 1002 events. 374/1002 cut-off events. For 6609/6719 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7001 event pairs, 27 based on Foata normal form. 14/983 useless extension candidates. Maximal degree in co-relation 5052. Up to 323 conditions per place. [2022-12-13 02:09:45,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 190 transitions, 2712 flow [2022-12-13 02:09:45,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-13 02:09:45,076 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:45,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 02:09:45,077 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 190 transitions, 2712 flow [2022-12-13 02:09:45,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:45,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:45,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:45,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 02:09:45,077 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash -244045609, now seen corresponding path program 1 times [2022-12-13 02:09:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:45,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572963272] [2022-12-13 02:09:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:45,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572963272] [2022-12-13 02:09:45,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572963272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:45,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:45,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:09:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081888714] [2022-12-13 02:09:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:09:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:09:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:09:45,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:09:45,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 190 transitions, 2712 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-13 02:09:45,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:45,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:09:45,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:45,838 INFO L130 PetriNetUnfolder]: 2662/4119 cut-off events. [2022-12-13 02:09:45,838 INFO L131 PetriNetUnfolder]: For 40505/40505 co-relation queries the response was YES. [2022-12-13 02:09:45,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26589 conditions, 4119 events. 2662/4119 cut-off events. For 40505/40505 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21617 event pairs, 1005 based on Foata normal form. 36/4138 useless extension candidates. Maximal degree in co-relation 23630. Up to 2620 conditions per place. [2022-12-13 02:09:45,861 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 271 selfloop transitions, 38 changer transitions 7/316 dead transitions. [2022-12-13 02:09:45,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 316 transitions, 4720 flow [2022-12-13 02:09:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:09:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:09:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-13 02:09:45,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 02:09:45,862 INFO L175 Difference]: Start difference. First operand has 96 places, 190 transitions, 2712 flow. Second operand 8 states and 152 transitions. [2022-12-13 02:09:45,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 316 transitions, 4720 flow [2022-12-13 02:09:45,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 316 transitions, 4668 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 02:09:45,928 INFO L231 Difference]: Finished difference. Result has 108 places, 213 transitions, 3212 flow [2022-12-13 02:09:45,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3212, PETRI_PLACES=108, PETRI_TRANSITIONS=213} [2022-12-13 02:09:45,928 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2022-12-13 02:09:45,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:45,928 INFO L89 Accepts]: Start accepts. Operand has 108 places, 213 transitions, 3212 flow [2022-12-13 02:09:45,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:45,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:45,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 213 transitions, 3212 flow [2022-12-13 02:09:45,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 213 transitions, 3212 flow [2022-12-13 02:09:46,015 INFO L130 PetriNetUnfolder]: 324/869 cut-off events. [2022-12-13 02:09:46,015 INFO L131 PetriNetUnfolder]: For 6493/6621 co-relation queries the response was YES. [2022-12-13 02:09:46,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 869 events. 324/869 cut-off events. For 6493/6621 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5807 event pairs, 21 based on Foata normal form. 46/890 useless extension candidates. Maximal degree in co-relation 4850. Up to 283 conditions per place. [2022-12-13 02:09:46,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 213 transitions, 3212 flow [2022-12-13 02:09:46,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 1350 [2022-12-13 02:09:46,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:46,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L58-4-->L70-4: Formula: (and (< v_thread3Thread1of1ForFork0_~i~2_223 v_~N~0_205) (let ((.cse1 (select (select |v_#memory_int_346| v_~A~0.base_228) (+ (* v_thread3Thread1of1ForFork0_~i~2_223 4) v_~A~0.offset_228)))) (let ((.cse0 (< .cse1 v_~min3~0_202))) (or (and .cse0 (= v_~min3~0_201 .cse1)) (and (not .cse0) (= v_~min3~0_202 v_~min3~0_201) (= |v_thread3Thread1of1ForFork0_#t~mem9_154| |v_thread3Thread1of1ForFork0_#t~mem9_153|))))) (= (+ v_thread3Thread1of1ForFork0_~i~2_223 1) v_thread3Thread1of1ForFork0_~i~2_222) (= |v_thread2Thread1of1ForFork2_#res.base_39| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_129 v_~M~0_135)) (= |v_thread2Thread1of1ForFork2_#res.offset_39| 0)) InVars {~A~0.base=v_~A~0.base_228, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_129, ~A~0.offset=v_~A~0.offset_228, ~M~0=v_~M~0_135, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_223, #memory_int=|v_#memory_int_346|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_154|, ~N~0=v_~N~0_205, ~min3~0=v_~min3~0_202} OutVars{~A~0.base=v_~A~0.base_228, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_222, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_153|, ~N~0=v_~N~0_205, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_85|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_129, ~A~0.offset=v_~A~0.offset_228, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_39|, ~M~0=v_~M~0_135, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_93|, #memory_int=|v_#memory_int_346|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_39|, ~min3~0=v_~min3~0_201} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork2_#res.offset, ~min3~0] and [582] $Ultimate##0-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_226| v_~A~0.base_128))) (and (< v_thread1Thread1of1ForFork1_~i~0_79 (+ v_~N~0_113 1)) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_128 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_79 4))))) (let ((.cse0 (< .cse1 v_~min1~0_135))) (or (and .cse0 (= v_~min1~0_134 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_86| |v_thread1Thread1of1ForFork1_#t~mem3_85|) (= v_~min1~0_135 v_~min1~0_134))))) (< v_thread3Thread1of1ForFork0_~i~2_70 v_~N~0_113) (let ((.cse3 (select .cse2 (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_70) v_~A~0.offset_128)))) (let ((.cse4 (< .cse3 v_~min3~0_73))) (or (and (= v_~min3~0_72 .cse3) .cse4) (and (not .cse4) (= v_~min3~0_73 v_~min3~0_72) (= |v_thread3Thread1of1ForFork0_#t~mem9_26| |v_thread3Thread1of1ForFork0_#t~mem9_25|))))) (= v_thread1Thread1of1ForFork1_~i~0_79 1) (= (+ v_thread3Thread1of1ForFork0_~i~2_70 1) v_thread3Thread1of1ForFork0_~i~2_69))) InVars {~A~0.base=v_~A~0.base_128, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_86|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_70, #memory_int=|v_#memory_int_226|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_26|, ~N~0=v_~N~0_113, ~min1~0=v_~min1~0_135, ~min3~0=v_~min3~0_73} OutVars{~A~0.base=v_~A~0.base_128, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_69, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_79, ~N~0=v_~N~0_113, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_15|, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_85|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_57|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_23|, #memory_int=|v_#memory_int_226|, ~min1~0=v_~min1~0_134, ~min3~0=v_~min3~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:46,138 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:46,138 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:46,478 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:46,478 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:09:46,702 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:09:46,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 774 [2022-12-13 02:09:46,702 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 213 transitions, 3259 flow [2022-12-13 02:09:46,702 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-13 02:09:46,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:46,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:46,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 02:09:46,703 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 519958820, now seen corresponding path program 1 times [2022-12-13 02:09:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:46,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016065663] [2022-12-13 02:09:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016065663] [2022-12-13 02:09:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016065663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210661643] [2022-12-13 02:09:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:46,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:46,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:46,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 02:09:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:46,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:09:46,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:46,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:46,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210661643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:46,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:46,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 02:09:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124212231] [2022-12-13 02:09:46,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:46,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:09:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:09:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 02:09:46,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 02:09:46,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 213 transitions, 3259 flow. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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-13 02:09:46,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:46,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 02:09:46,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:48,415 INFO L130 PetriNetUnfolder]: 4386/6779 cut-off events. [2022-12-13 02:09:48,415 INFO L131 PetriNetUnfolder]: For 76070/76070 co-relation queries the response was YES. [2022-12-13 02:09:48,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46724 conditions, 6779 events. 4386/6779 cut-off events. For 76070/76070 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 39077 event pairs, 651 based on Foata normal form. 60/6810 useless extension candidates. Maximal degree in co-relation 46069. Up to 2333 conditions per place. [2022-12-13 02:09:48,463 INFO L137 encePairwiseOnDemand]: 23/55 looper letters, 319 selfloop transitions, 219 changer transitions 3/541 dead transitions. [2022-12-13 02:09:48,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 541 transitions, 8486 flow [2022-12-13 02:09:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:09:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:09:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 228 transitions. [2022-12-13 02:09:48,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2590909090909091 [2022-12-13 02:09:48,465 INFO L175 Difference]: Start difference. First operand has 106 places, 213 transitions, 3259 flow. Second operand 16 states and 228 transitions. [2022-12-13 02:09:48,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 541 transitions, 8486 flow [2022-12-13 02:09:48,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 541 transitions, 8446 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-13 02:09:48,632 INFO L231 Difference]: Finished difference. Result has 126 places, 324 transitions, 6067 flow [2022-12-13 02:09:48,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3219, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6067, PETRI_PLACES=126, PETRI_TRANSITIONS=324} [2022-12-13 02:09:48,632 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2022-12-13 02:09:48,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:48,632 INFO L89 Accepts]: Start accepts. Operand has 126 places, 324 transitions, 6067 flow [2022-12-13 02:09:48,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:48,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:48,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 324 transitions, 6067 flow [2022-12-13 02:09:48,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 324 transitions, 6067 flow [2022-12-13 02:09:48,797 INFO L130 PetriNetUnfolder]: 682/1737 cut-off events. [2022-12-13 02:09:48,797 INFO L131 PetriNetUnfolder]: For 18615/18889 co-relation queries the response was YES. [2022-12-13 02:09:48,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11712 conditions, 1737 events. 682/1737 cut-off events. For 18615/18889 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13540 event pairs, 45 based on Foata normal form. 38/1720 useless extension candidates. Maximal degree in co-relation 11618. Up to 561 conditions per place. [2022-12-13 02:09:48,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 324 transitions, 6067 flow [2022-12-13 02:09:48,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 1980 [2022-12-13 02:09:48,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:48,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [635] $Ultimate##0-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_318| v_~A~0.base_206))) (and (< v_thread3Thread1of1ForFork0_~i~2_195 v_~N~0_185) (< v_thread1Thread1of1ForFork1_~i~0_137 (+ v_~N~0_185 1)) (= v_thread3Thread1of1ForFork0_~i~2_194 (+ v_thread3Thread1of1ForFork0_~i~2_195 1)) (= v_thread1Thread1of1ForFork1_~i~0_137 1) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_206 (* v_thread3Thread1of1ForFork0_~i~2_195 4))))) (let ((.cse0 (< .cse1 v_~min3~0_170))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem9_125| |v_thread3Thread1of1ForFork0_#t~mem9_126|) (= v_~min3~0_170 v_~min3~0_169) (not .cse0)) (and (= .cse1 v_~min3~0_169) .cse0)))) (let ((.cse3 (select .cse2 (+ (* v_thread1Thread1of1ForFork1_~i~0_137 4) v_~A~0.offset_206 (- 4))))) (let ((.cse4 (< .cse3 v_~min1~0_239))) (or (and (= v_~min1~0_238 .cse3) .cse4) (and (= v_~min1~0_239 v_~min1~0_238) (= |v_thread1Thread1of1ForFork1_#t~mem3_193| |v_thread1Thread1of1ForFork1_#t~mem3_192|) (not .cse4))))))) InVars {~A~0.base=v_~A~0.base_206, ~A~0.offset=v_~A~0.offset_206, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_193|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_195, #memory_int=|v_#memory_int_318|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_126|, ~N~0=v_~N~0_185, ~min1~0=v_~min1~0_239, ~min3~0=v_~min3~0_170} OutVars{~A~0.base=v_~A~0.base_206, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_194, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_125|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_137, ~N~0=v_~N~0_185, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_71|, ~A~0.offset=v_~A~0.offset_206, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_107|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_192|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_115|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_79|, #memory_int=|v_#memory_int_318|, ~min1~0=v_~min1~0_238, ~min3~0=v_~min3~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:49,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [582] $Ultimate##0-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_226| v_~A~0.base_128))) (and (< v_thread1Thread1of1ForFork1_~i~0_79 (+ v_~N~0_113 1)) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_128 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_79 4))))) (let ((.cse0 (< .cse1 v_~min1~0_135))) (or (and .cse0 (= v_~min1~0_134 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_86| |v_thread1Thread1of1ForFork1_#t~mem3_85|) (= v_~min1~0_135 v_~min1~0_134))))) (< v_thread3Thread1of1ForFork0_~i~2_70 v_~N~0_113) (let ((.cse3 (select .cse2 (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_70) v_~A~0.offset_128)))) (let ((.cse4 (< .cse3 v_~min3~0_73))) (or (and (= v_~min3~0_72 .cse3) .cse4) (and (not .cse4) (= v_~min3~0_73 v_~min3~0_72) (= |v_thread3Thread1of1ForFork0_#t~mem9_26| |v_thread3Thread1of1ForFork0_#t~mem9_25|))))) (= v_thread1Thread1of1ForFork1_~i~0_79 1) (= (+ v_thread3Thread1of1ForFork0_~i~2_70 1) v_thread3Thread1of1ForFork0_~i~2_69))) InVars {~A~0.base=v_~A~0.base_128, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_86|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_70, #memory_int=|v_#memory_int_226|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_26|, ~N~0=v_~N~0_113, ~min1~0=v_~min1~0_135, ~min3~0=v_~min3~0_73} OutVars{~A~0.base=v_~A~0.base_128, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_69, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_79, ~N~0=v_~N~0_113, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_15|, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_85|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_57|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_23|, #memory_int=|v_#memory_int_226|, ~min1~0=v_~min1~0_134, ~min3~0=v_~min3~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:50,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:50,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [582] $Ultimate##0-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_226| v_~A~0.base_128))) (and (< v_thread1Thread1of1ForFork1_~i~0_79 (+ v_~N~0_113 1)) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_128 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_79 4))))) (let ((.cse0 (< .cse1 v_~min1~0_135))) (or (and .cse0 (= v_~min1~0_134 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_86| |v_thread1Thread1of1ForFork1_#t~mem3_85|) (= v_~min1~0_135 v_~min1~0_134))))) (< v_thread3Thread1of1ForFork0_~i~2_70 v_~N~0_113) (let ((.cse3 (select .cse2 (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_70) v_~A~0.offset_128)))) (let ((.cse4 (< .cse3 v_~min3~0_73))) (or (and (= v_~min3~0_72 .cse3) .cse4) (and (not .cse4) (= v_~min3~0_73 v_~min3~0_72) (= |v_thread3Thread1of1ForFork0_#t~mem9_26| |v_thread3Thread1of1ForFork0_#t~mem9_25|))))) (= v_thread1Thread1of1ForFork1_~i~0_79 1) (= (+ v_thread3Thread1of1ForFork0_~i~2_70 1) v_thread3Thread1of1ForFork0_~i~2_69))) InVars {~A~0.base=v_~A~0.base_128, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_86|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_70, #memory_int=|v_#memory_int_226|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_26|, ~N~0=v_~N~0_113, ~min1~0=v_~min1~0_135, ~min3~0=v_~min3~0_73} OutVars{~A~0.base=v_~A~0.base_128, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_69, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_25|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_79, ~N~0=v_~N~0_113, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_15|, ~A~0.offset=v_~A~0.offset_128, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_85|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_57|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_23|, #memory_int=|v_#memory_int_226|, ~min1~0=v_~min1~0_134, ~min3~0=v_~min3~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:50,548 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:09:50,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1916 [2022-12-13 02:09:50,549 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 324 transitions, 6178 flow [2022-12-13 02:09:50,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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-13 02:09:50,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:50,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:50,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 02:09:50,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 02:09:50,751 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1261302181, now seen corresponding path program 1 times [2022-12-13 02:09:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:50,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962572013] [2022-12-13 02:09:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:09:50,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:50,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962572013] [2022-12-13 02:09:50,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962572013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:50,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:50,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:09:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072086448] [2022-12-13 02:09:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:50,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:09:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:50,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:09:50,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:09:50,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 66 [2022-12-13 02:09:50,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 324 transitions, 6178 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:50,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:50,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 66 [2022-12-13 02:09:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:51,975 INFO L130 PetriNetUnfolder]: 4320/6701 cut-off events. [2022-12-13 02:09:51,975 INFO L131 PetriNetUnfolder]: For 111347/112390 co-relation queries the response was YES. [2022-12-13 02:09:51,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53478 conditions, 6701 events. 4320/6701 cut-off events. For 111347/112390 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 39945 event pairs, 1321 based on Foata normal form. 599/7089 useless extension candidates. Maximal degree in co-relation 52943. Up to 3692 conditions per place. [2022-12-13 02:09:52,019 INFO L137 encePairwiseOnDemand]: 48/66 looper letters, 400 selfloop transitions, 46 changer transitions 11/473 dead transitions. [2022-12-13 02:09:52,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 473 transitions, 9603 flow [2022-12-13 02:09:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:09:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:09:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-12-13 02:09:52,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2022-12-13 02:09:52,020 INFO L175 Difference]: Start difference. First operand has 126 places, 324 transitions, 6178 flow. Second operand 5 states and 134 transitions. [2022-12-13 02:09:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 473 transitions, 9603 flow [2022-12-13 02:09:52,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 473 transitions, 8491 flow, removed 508 selfloop flow, removed 2 redundant places. [2022-12-13 02:09:52,234 INFO L231 Difference]: Finished difference. Result has 129 places, 330 transitions, 5788 flow [2022-12-13 02:09:52,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5504, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5788, PETRI_PLACES=129, PETRI_TRANSITIONS=330} [2022-12-13 02:09:52,234 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2022-12-13 02:09:52,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:52,235 INFO L89 Accepts]: Start accepts. Operand has 129 places, 330 transitions, 5788 flow [2022-12-13 02:09:52,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:52,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:52,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 330 transitions, 5788 flow [2022-12-13 02:09:52,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 330 transitions, 5788 flow [2022-12-13 02:09:52,411 INFO L130 PetriNetUnfolder]: 798/1952 cut-off events. [2022-12-13 02:09:52,411 INFO L131 PetriNetUnfolder]: For 19651/19979 co-relation queries the response was YES. [2022-12-13 02:09:52,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13013 conditions, 1952 events. 798/1952 cut-off events. For 19651/19979 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15047 event pairs, 61 based on Foata normal form. 41/1931 useless extension candidates. Maximal degree in co-relation 12901. Up to 665 conditions per place. [2022-12-13 02:09:52,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 330 transitions, 5788 flow [2022-12-13 02:09:52,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 2040 [2022-12-13 02:09:52,434 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:52,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-13 02:09:52,434 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 330 transitions, 5788 flow [2022-12-13 02:09:52,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:52,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:52,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:52,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 02:09:52,435 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1025260394, now seen corresponding path program 1 times [2022-12-13 02:09:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:52,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504989952] [2022-12-13 02:09:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:52,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504989952] [2022-12-13 02:09:52,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504989952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:09:52,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:09:52,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:09:52,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492183347] [2022-12-13 02:09:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:09:52,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:09:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:52,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:09:52,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:09:52,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 02:09:52,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 330 transitions, 5788 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-13 02:09:52,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:52,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 02:09:52,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:53,940 INFO L130 PetriNetUnfolder]: 4673/7180 cut-off events. [2022-12-13 02:09:53,940 INFO L131 PetriNetUnfolder]: For 95979/95979 co-relation queries the response was YES. [2022-12-13 02:09:53,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53669 conditions, 7180 events. 4673/7180 cut-off events. For 95979/95979 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40940 event pairs, 1575 based on Foata normal form. 56/7211 useless extension candidates. Maximal degree in co-relation 53119. Up to 6001 conditions per place. [2022-12-13 02:09:53,984 INFO L137 encePairwiseOnDemand]: 35/66 looper letters, 307 selfloop transitions, 97 changer transitions 3/407 dead transitions. [2022-12-13 02:09:53,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 407 transitions, 7397 flow [2022-12-13 02:09:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:09:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:09:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 02:09:53,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24891774891774893 [2022-12-13 02:09:53,985 INFO L175 Difference]: Start difference. First operand has 129 places, 330 transitions, 5788 flow. Second operand 7 states and 115 transitions. [2022-12-13 02:09:53,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 407 transitions, 7397 flow [2022-12-13 02:09:54,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 407 transitions, 7284 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-13 02:09:54,233 INFO L231 Difference]: Finished difference. Result has 133 places, 338 transitions, 6030 flow [2022-12-13 02:09:54,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5708, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6030, PETRI_PLACES=133, PETRI_TRANSITIONS=338} [2022-12-13 02:09:54,234 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2022-12-13 02:09:54,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:54,234 INFO L89 Accepts]: Start accepts. Operand has 133 places, 338 transitions, 6030 flow [2022-12-13 02:09:54,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:54,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:54,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 338 transitions, 6030 flow [2022-12-13 02:09:54,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 338 transitions, 6030 flow [2022-12-13 02:09:54,464 INFO L130 PetriNetUnfolder]: 785/1916 cut-off events. [2022-12-13 02:09:54,464 INFO L131 PetriNetUnfolder]: For 19259/19582 co-relation queries the response was YES. [2022-12-13 02:09:54,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12757 conditions, 1916 events. 785/1916 cut-off events. For 19259/19582 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14615 event pairs, 62 based on Foata normal form. 42/1897 useless extension candidates. Maximal degree in co-relation 12639. Up to 659 conditions per place. [2022-12-13 02:09:54,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 338 transitions, 6030 flow [2022-12-13 02:09:54,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 2078 [2022-12-13 02:09:54,492 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:54,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 02:09:54,493 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 338 transitions, 6030 flow [2022-12-13 02:09:54,493 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-13 02:09:54,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:54,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:54,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 02:09:54,493 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1361378756, now seen corresponding path program 2 times [2022-12-13 02:09:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:54,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067524405] [2022-12-13 02:09:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:54,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067524405] [2022-12-13 02:09:54,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067524405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737607271] [2022-12-13 02:09:54,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:09:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:54,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:54,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 02:09:54,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:09:54,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:09:54,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:09:54,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:54,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:54,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737607271] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:54,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:54,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 02:09:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105449344] [2022-12-13 02:09:54,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:54,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:09:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:54,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:09:54,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 02:09:54,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 02:09:54,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 338 transitions, 6030 flow. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:54,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:54,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 02:09:54,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:56,531 INFO L130 PetriNetUnfolder]: 4731/7298 cut-off events. [2022-12-13 02:09:56,531 INFO L131 PetriNetUnfolder]: For 90428/90428 co-relation queries the response was YES. [2022-12-13 02:09:56,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53627 conditions, 7298 events. 4731/7298 cut-off events. For 90428/90428 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 42280 event pairs, 926 based on Foata normal form. 64/7341 useless extension candidates. Maximal degree in co-relation 52995. Up to 3682 conditions per place. [2022-12-13 02:09:56,588 INFO L137 encePairwiseOnDemand]: 36/66 looper letters, 354 selfloop transitions, 196 changer transitions 2/552 dead transitions. [2022-12-13 02:09:56,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 552 transitions, 9749 flow [2022-12-13 02:09:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:09:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:09:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2022-12-13 02:09:56,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2361111111111111 [2022-12-13 02:09:56,589 INFO L175 Difference]: Start difference. First operand has 133 places, 338 transitions, 6030 flow. Second operand 12 states and 187 transitions. [2022-12-13 02:09:56,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 552 transitions, 9749 flow [2022-12-13 02:09:56,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 552 transitions, 9588 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:56,865 INFO L231 Difference]: Finished difference. Result has 143 places, 385 transitions, 7341 flow [2022-12-13 02:09:56,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5877, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7341, PETRI_PLACES=143, PETRI_TRANSITIONS=385} [2022-12-13 02:09:56,866 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2022-12-13 02:09:56,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:56,866 INFO L89 Accepts]: Start accepts. Operand has 143 places, 385 transitions, 7341 flow [2022-12-13 02:09:56,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:56,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:56,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 385 transitions, 7341 flow [2022-12-13 02:09:56,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 385 transitions, 7341 flow [2022-12-13 02:09:57,112 INFO L130 PetriNetUnfolder]: 833/2013 cut-off events. [2022-12-13 02:09:57,112 INFO L131 PetriNetUnfolder]: For 23248/23663 co-relation queries the response was YES. [2022-12-13 02:09:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14014 conditions, 2013 events. 833/2013 cut-off events. For 23248/23663 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15474 event pairs, 64 based on Foata normal form. 68/2016 useless extension candidates. Maximal degree in co-relation 13828. Up to 698 conditions per place. [2022-12-13 02:09:57,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 385 transitions, 7341 flow [2022-12-13 02:09:57,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 2308 [2022-12-13 02:09:57,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-13 02:09:57,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:09:57,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 429 [2022-12-13 02:09:57,295 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 385 transitions, 7348 flow [2022-12-13 02:09:57,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:57,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:57,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:57,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 02:09:57,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:57,499 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:09:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -940383524, now seen corresponding path program 1 times [2022-12-13 02:09:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944519552] [2022-12-13 02:09:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944519552] [2022-12-13 02:09:58,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944519552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:58,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449825846] [2022-12-13 02:09:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:58,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:58,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:58,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:58,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 02:09:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:58,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 02:09:58,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:58,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-12-13 02:09:58,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:09:58,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-13 02:09:59,121 INFO L321 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-12-13 02:09:59,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 120 [2022-12-13 02:09:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:59,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:10:12,773 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 119 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:10:16,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:16,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 7442 treesize of output 8268 [2022-12-13 02:10:22,802 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 590 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 02:10:22,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:22,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 6685 treesize of output 7764 [2022-12-13 02:10:24,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:24,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6203 treesize of output 6152 [2022-12-13 02:10:25,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:25,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6131 treesize of output 6108 [2022-12-13 02:10:26,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:26,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6087 treesize of output 6020 [2022-12-13 02:10:27,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:27,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5999 treesize of output 5968 [2022-12-13 02:10:28,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:28,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5947 treesize of output 5872 [2022-12-13 02:10:30,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:30,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5851 treesize of output 5836 [2022-12-13 02:10:31,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:31,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5815 treesize of output 5716 [2022-12-13 02:10:32,455 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 02:10:32,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:32,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5695 treesize of output 5604 [2022-12-13 02:10:34,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:34,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5583 treesize of output 5552 [2022-12-13 02:10:35,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:35,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5531 treesize of output 5488 [2022-12-13 02:10:36,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:36,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5467 treesize of output 5460 [2022-12-13 02:10:37,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:37,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5439 treesize of output 5380 [2022-12-13 02:10:39,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:39,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5359 treesize of output 5356 [2022-12-13 02:10:40,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:40,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5335 treesize of output 5324 [2022-12-13 02:10:41,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:10:41,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5303 treesize of output 5260 Received shutdown request... [2022-12-13 02:22:24,129 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 02:22:24,130 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 02:22:24,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 02:22:24,143 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:22:24,143 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:22:24,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:22:24,331 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 26ms.. [2022-12-13 02:22:24,332 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 02:22:24,332 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 02:22:24,332 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 02:22:24,333 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:22:24,334 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:22:24,334 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:22:24,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:22:24 BasicIcfg [2022-12-13 02:22:24,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:22:24,336 INFO L158 Benchmark]: Toolchain (without parser) took 835057.32ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 165.7MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 02:22:24,336 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory was 165.1MB in the beginning and 164.9MB in the end (delta: 134.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:22:24,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.30ms. Allocated memory is still 188.7MB. Free memory was 165.2MB in the beginning and 152.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 02:22:24,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 188.7MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:22:24,337 INFO L158 Benchmark]: Boogie Preprocessor took 48.00ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:22:24,337 INFO L158 Benchmark]: RCFGBuilder took 518.95ms. Allocated memory is still 188.7MB. Free memory was 149.5MB in the beginning and 128.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 02:22:24,337 INFO L158 Benchmark]: TraceAbstraction took 834194.67ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 127.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 02:22:24,338 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.09ms. Allocated memory is still 188.7MB. Free memory was 165.1MB in the beginning and 164.9MB in the end (delta: 134.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.30ms. Allocated memory is still 188.7MB. Free memory was 165.2MB in the beginning and 152.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 188.7MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.00ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 518.95ms. Allocated memory is still 188.7MB. Free memory was 149.5MB in the beginning and 128.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 834194.67ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 127.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 127 PlacesBefore, 30 PlacesAfterwards, 129 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 670, 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: 674, independent: 670, independent conditional: 0, independent unconditional: 670, 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: 674, independent: 670, independent conditional: 0, independent unconditional: 670, 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: 674, independent: 670, independent conditional: 0, independent unconditional: 670, 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: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 674, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1062, Positive conditional cache size: 0, Positive unconditional cache size: 1062, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 2, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 238 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): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 44 PlacesBefore, 42 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 20, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 48, independent conditional: 20, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 20, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 32, independent conditional: 11, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 11, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 71 PlacesBefore, 69 PlacesAfterwards, 105 TransitionsBefore, 102 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 47, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 69 PlacesBefore, 69 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 47, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 89 TransitionsBefore, 89 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): 63, Positive cache size: 63, Positive conditional cache size: 47, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 73 PlacesBefore, 72 PlacesAfterwards, 106 TransitionsBefore, 105 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent 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: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 93, Positive conditional cache size: 73, Positive unconditional cache size: 20, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 75 PlacesBefore, 74 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 60, independent conditional: 40, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 40, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 42, independent conditional: 27, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 13, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 165, Positive conditional cache size: 138, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 542 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): 165, Positive cache size: 165, Positive conditional cache size: 138, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 536 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): 165, Positive cache size: 165, Positive conditional cache size: 138, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 514 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): 165, Positive cache size: 165, Positive conditional cache size: 138, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 79 PlacesBefore, 79 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 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: 8, independent unconditional: 2, dependent: 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: 11, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 181, Positive conditional cache size: 151, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 610 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): 181, Positive cache size: 181, Positive conditional cache size: 151, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 662 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 181, Positive conditional cache size: 151, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 652 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): 181, Positive cache size: 181, Positive conditional cache size: 151, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 99 PlacesBefore, 96 PlacesAfterwards, 113 TransitionsBefore, 111 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 194, Positive conditional cache size: 161, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 113 PlacesBefore, 114 PlacesAfterwards, 143 TransitionsBefore, 134 TransitionsAfterwards, 986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 232, Positive conditional cache size: 199, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 112 PlacesBefore, 111 PlacesAfterwards, 171 TransitionsBefore, 170 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 253, Positive conditional cache size: 220, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 104 PlacesBefore, 104 PlacesAfterwards, 224 TransitionsBefore, 224 TransitionsAfterwards, 1510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 232, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 101 PlacesBefore, 101 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 1258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 232, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 196 TransitionsBefore, 196 TransitionsAfterwards, 1270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 232, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 98 PlacesBefore, 97 PlacesAfterwards, 172 TransitionsBefore, 171 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 266, Positive conditional cache size: 233, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 190 TransitionsBefore, 190 TransitionsAfterwards, 1182 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): 266, Positive cache size: 266, Positive conditional cache size: 233, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 106 PlacesBefore, 106 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 1350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 273, Positive conditional cache size: 240, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 126 PlacesBefore, 126 PlacesAfterwards, 324 TransitionsBefore, 324 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 262, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 330 TransitionsBefore, 330 TransitionsAfterwards, 2040 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 262, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 338 TransitionsBefore, 338 TransitionsAfterwards, 2078 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 262, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 143 PlacesBefore, 143 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 2308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 302, Positive conditional cache size: 269, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 26ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 26ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 26ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 26ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 161 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 834.1s, OverallIterations: 30, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 41 mSolverCounterUnknown, 2958 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2958 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10105 IncrementalHoareTripleChecker+Invalid, 10599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 453 mSolverCounterUnsat, 46 mSDtfsCounter, 10105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 195 SyntacticMatches, 9 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7348occurred in iteration=29, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 772 ConstructedInterpolants, 32 QuantifiedInterpolants, 17509 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1461 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 43 InterpolantComputations, 22 PerfectInterpolantSequences, 8/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown