/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:34:09,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:34:09,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:34:09,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:34:09,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:34:09,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:34:09,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:34:09,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:34:09,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:34:09,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:34:09,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:34:09,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:34:09,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:34:09,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:34:09,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:34:09,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:34:09,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:34:09,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:34:09,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:34:09,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:34:09,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:34:09,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:34:09,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:34:09,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:34:09,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:34:09,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:34:09,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:34:09,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:34:09,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:34:09,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:34:09,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:34:09,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:34:09,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:34:09,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:34:09,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:34:09,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:34:09,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:34:09,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:34:09,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:34:09,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:34:09,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:34:09,615 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:34:09,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:34:09,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:34:09,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:34:09,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:34:09,655 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:34:09,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:34:09,656 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:34:09,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:34:09,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:34:09,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:34:09,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:34:09,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:34:09,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:34:09,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:34:09,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:34:09,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:34:09,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:34:09,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:34:09,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:34:09,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:34:09,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:34:09,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:34:09,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:34:09,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:34:09,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:34:09,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:34:09,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:34:09,997 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:34:09,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-12-06 05:34:11,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:34:11,411 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:34:11,411 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-12-06 05:34:11,417 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bacee326/46b85eae7d7948228be1503f84d615de/FLAGc0a7aaa8a [2022-12-06 05:34:11,809 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bacee326/46b85eae7d7948228be1503f84d615de [2022-12-06 05:34:11,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:34:11,813 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:34:11,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:34:11,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:34:11,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:34:11,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:34:11" (1/1) ... [2022-12-06 05:34:11,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422bd431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:11, skipping insertion in model container [2022-12-06 05:34:11,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:34:11" (1/1) ... [2022-12-06 05:34:11,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:34:11,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:34:11,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:34:11,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:34:11,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:34:11,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:34:11,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:34:11,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:34:12,007 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-max-array-hom.wvr.c[2586,2599] [2022-12-06 05:34:12,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:34:12,021 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:34:12,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:34:12,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:34:12,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:34:12,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:34:12,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:34:12,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:34:12,041 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-max-array-hom.wvr.c[2586,2599] [2022-12-06 05:34:12,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:34:12,062 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:34:12,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12 WrapperNode [2022-12-06 05:34:12,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:34:12,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:34:12,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:34:12,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:34:12,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,122 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-06 05:34:12,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:34:12,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:34:12,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:34:12,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:34:12,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:34:12,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:34:12,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:34:12,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:34:12,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (1/1) ... [2022-12-06 05:34:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:34:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:12,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:34:12,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:34:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:34:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:34:12,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:34:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:34:12,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:34:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:34:12,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:34:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:34:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:34:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:34:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:34:12,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:34:12,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:34:12,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:34:12,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:34:12,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:34:12,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:34:12,261 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:34:12,413 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:34:12,415 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:34:12,690 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:34:12,775 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:34:12,776 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:34:12,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:34:12 BoogieIcfgContainer [2022-12-06 05:34:12,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:34:12,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:34:12,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:34:12,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:34:12,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:34:11" (1/3) ... [2022-12-06 05:34:12,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cf0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:34:12, skipping insertion in model container [2022-12-06 05:34:12,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:34:12" (2/3) ... [2022-12-06 05:34:12,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cf0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:34:12, skipping insertion in model container [2022-12-06 05:34:12,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:34:12" (3/3) ... [2022-12-06 05:34:12,785 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-12-06 05:34:12,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:34:12,830 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:34:12,830 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:34:12,938 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:34:12,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 308 flow [2022-12-06 05:34:13,074 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-06 05:34:13,075 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:34:13,080 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-06 05:34:13,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 142 transitions, 308 flow [2022-12-06 05:34:13,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 276 flow [2022-12-06 05:34:13,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:13,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-06 05:34:13,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 276 flow [2022-12-06 05:34:13,166 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-06 05:34:13,166 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:34:13,167 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-06 05:34:13,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-06 05:34:13,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 05:34:18,196 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-06 05:34:18,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:34:18,214 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;@70576103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:34:18,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:34:18,218 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 05:34:18,218 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:34:18,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:18,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:18,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1106873309, now seen corresponding path program 1 times [2022-12-06 05:34:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:18,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611250418] [2022-12-06 05:34:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:18,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611250418] [2022-12-06 05:34:18,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611250418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:34:18,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:34:18,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:34:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341491246] [2022-12-06 05:34:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:34:18,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:34:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:34:18,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:34:18,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:34:18,775 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-06 05:34:18,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:18,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:34:18,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:18,891 INFO L130 PetriNetUnfolder]: 269/376 cut-off events. [2022-12-06 05:34:18,891 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 05:34:18,893 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-06 05:34:18,898 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 05:34:18,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-06 05:34:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:34:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:34:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:34:18,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:34:18,909 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:34:18,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-06 05:34:18,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:34:18,914 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 05:34:18,916 INFO L276 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-06 05:34:18,919 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:34:18,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:18,920 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:34:18,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:18,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:18,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:34:18,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:34:18,938 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:34:18,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:34:18,940 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-06 05:34:18,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:34:18,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:34:20,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:34:20,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1252 [2022-12-06 05:34:20,171 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 05:34:20,171 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-06 05:34:20,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:20,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:20,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:34:20,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1795349165, now seen corresponding path program 1 times [2022-12-06 05:34:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:20,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654759439] [2022-12-06 05:34:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:20,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654759439] [2022-12-06 05:34:20,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654759439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:34:20,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:34:20,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:34:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827411900] [2022-12-06 05:34:20,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:34:20,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:34:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:20,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:34:20,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:34:20,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:34:20,257 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-06 05:34:20,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:20,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:34:20,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:20,355 INFO L130 PetriNetUnfolder]: 309/441 cut-off events. [2022-12-06 05:34:20,355 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:34:20,356 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-06 05:34:20,358 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 05:34:20,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 148 flow [2022-12-06 05:34:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:34:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:34:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 05:34:20,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-06 05:34:20,362 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 4 states and 41 transitions. [2022-12-06 05:34:20,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 148 flow [2022-12-06 05:34:20,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 140 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:34:20,363 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 68 flow [2022-12-06 05:34:20,363 INFO L276 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-06 05:34:20,364 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 05:34:20,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:20,364 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 68 flow [2022-12-06 05:34:20,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:20,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:20,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-06 05:34:20,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 68 flow [2022-12-06 05:34:20,371 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:34:20,371 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:34:20,371 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-06 05:34:20,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-06 05:34:20,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 05:34:20,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:34:20,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 05:34:20,449 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 64 flow [2022-12-06 05:34:20,450 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-06 05:34:20,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:20,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:20,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:34:20,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:20,451 INFO L85 PathProgramCache]: Analyzing trace with hash -257711172, now seen corresponding path program 1 times [2022-12-06 05:34:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:20,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071242878] [2022-12-06 05:34:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071242878] [2022-12-06 05:34:20,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071242878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:34:20,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:34:20,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:34:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451146902] [2022-12-06 05:34:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:34:20,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:34:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:20,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:34:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:34:20,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:34:20,609 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-06 05:34:20,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:20,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:34:20,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:20,796 INFO L130 PetriNetUnfolder]: 464/682 cut-off events. [2022-12-06 05:34:20,796 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-06 05:34:20,798 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-06 05:34:20,803 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 54 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2022-12-06 05:34:20,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 64 transitions, 304 flow [2022-12-06 05:34:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:34:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:34:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 05:34:20,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 05:34:20,805 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 64 flow. Second operand 7 states and 66 transitions. [2022-12-06 05:34:20,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 64 transitions, 304 flow [2022-12-06 05:34:20,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 64 transitions, 270 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:34:20,808 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 110 flow [2022-12-06 05:34:20,808 INFO L276 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-06 05:34:20,810 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 05:34:20,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:20,810 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 110 flow [2022-12-06 05:34:20,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:20,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:20,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-06 05:34:20,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 110 flow [2022-12-06 05:34:20,821 INFO L130 PetriNetUnfolder]: 13/58 cut-off events. [2022-12-06 05:34:20,822 INFO L131 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-12-06 05:34:20,822 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-06 05:34:20,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-06 05:34:20,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 05:34:20,824 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:34:20,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:34:20,825 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 110 flow [2022-12-06 05:34:20,825 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-06 05:34:20,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:20,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:20,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:34:20,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:20,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash 185042541, now seen corresponding path program 1 times [2022-12-06 05:34:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:20,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487390165] [2022-12-06 05:34:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:21,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487390165] [2022-12-06 05:34:21,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487390165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799827135] [2022-12-06 05:34:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:21,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:21,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:21,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:34:21,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:34:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:21,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 05:34:21,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:34:21,827 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 16 treesize of output 12 [2022-12-06 05:34:21,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:34:22,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:34:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:34:22,156 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-06 05:34:22,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:34:22,252 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 64 treesize of output 44 [2022-12-06 05:34:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:22,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:34:23,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max1~0 c_~max2~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse0) (< (+ ~M~0 1) c_~N~0)))) .cse1) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (= c_~max1~0 .cse2) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (<= .cse2 c_~max2~0)))) (or (and (or .cse1 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-12-06 05:34:32,233 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:34:32,479 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~max3~0 c_~max2~0)) (.cse1 (< c_~max2~0 c_~max3~0)) (.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 c_~max3~0) .cse2)) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (or (< c_~max3~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse5 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse5 c_~max3~0) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse5)) (< (+ ~M~0 1) c_~N~0))))) .cse2) (or .cse1 (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse7 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse7 c_~max2~0) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse7)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse10 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse8)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse8) (< (+ ~M~0 1) c_~N~0)))) (= .cse10 c_~max2~0) (not (< c_~max1~0 .cse10)))))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse0) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse13 c_~max2~0) (= c_~max1~0 .cse13) (not (< c_~max3~0 .cse13)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse14 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse15 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse15 .cse16) (<= .cse16 c_~max2~0) (not (< c_~max3~0 .cse16)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse15)))))))) is different from false [2022-12-06 05:34:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799827135] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:34:33,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:34:33,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-12-06 05:34:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389496221] [2022-12-06 05:34:33,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:34:33,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:34:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:34:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=325, Unknown=2, NotChecked=78, Total=506 [2022-12-06 05:34:33,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 05:34:33,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 110 flow. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:33,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:33,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 05:34:33,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:34,398 INFO L130 PetriNetUnfolder]: 711/1092 cut-off events. [2022-12-06 05:34:34,398 INFO L131 PetriNetUnfolder]: For 669/697 co-relation queries the response was YES. [2022-12-06 05:34:34,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 1092 events. 711/1092 cut-off events. For 669/697 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4260 event pairs, 74 based on Foata normal form. 29/985 useless extension candidates. Maximal degree in co-relation 1365. Up to 658 conditions per place. [2022-12-06 05:34:34,404 INFO L137 encePairwiseOnDemand]: 8/24 looper letters, 77 selfloop transitions, 40 changer transitions 3/122 dead transitions. [2022-12-06 05:34:34,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 122 transitions, 660 flow [2022-12-06 05:34:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:34:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:34:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-12-06 05:34:34,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 05:34:34,406 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 110 flow. Second operand 10 states and 115 transitions. [2022-12-06 05:34:34,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 122 transitions, 660 flow [2022-12-06 05:34:34,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 122 transitions, 636 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 05:34:34,413 INFO L231 Difference]: Finished difference. Result has 45 places, 68 transitions, 400 flow [2022-12-06 05:34:34,414 INFO L276 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=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=45, PETRI_TRANSITIONS=68} [2022-12-06 05:34:34,415 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 05:34:34,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:34,415 INFO L89 Accepts]: Start accepts. Operand has 45 places, 68 transitions, 400 flow [2022-12-06 05:34:34,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:34,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:34,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 68 transitions, 400 flow [2022-12-06 05:34:34,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 68 transitions, 400 flow [2022-12-06 05:34:34,456 INFO L130 PetriNetUnfolder]: 233/496 cut-off events. [2022-12-06 05:34:34,456 INFO L131 PetriNetUnfolder]: For 338/346 co-relation queries the response was YES. [2022-12-06 05:34:34,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 496 events. 233/496 cut-off events. For 338/346 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2438 event pairs, 70 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 1177. Up to 234 conditions per place. [2022-12-06 05:34:34,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 68 transitions, 400 flow [2022-12-06 05:34:34,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 05:34:34,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} 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 (< v_~max1~0_57 .cse1))) (or (and .cse0 (= v_~max1~0_56 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~max1~0_57 v_~max1~0_56))))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~max1~0=v_~max1~0_57, ~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} OutVars{~max1~0=v_~max1~0_56, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 05:34:34,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} 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 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) 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, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} 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, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 05:34:37,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} 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 (< v_~max1~0_57 .cse1))) (or (and .cse0 (= v_~max1~0_56 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~max1~0_57 v_~max1~0_56))))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~max1~0=v_~max1~0_57, ~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} OutVars{~max1~0=v_~max1~0_56, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 05:34:37,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} 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 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) 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, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} 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, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 05:34:37,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 05:34:37,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} 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 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) 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, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} 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, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 05:34:37,733 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:34:37,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3319 [2022-12-06 05:34:37,734 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 67 transitions, 439 flow [2022-12-06 05:34:37,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:37,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:37,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:37,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:34:37,944 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-06 05:34:37,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:37,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1595953813, now seen corresponding path program 1 times [2022-12-06 05:34:37,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:37,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914589283] [2022-12-06 05:34:37,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:38,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914589283] [2022-12-06 05:34:38,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914589283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:38,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556775568] [2022-12-06 05:34:38,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:38,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:38,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:38,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:34:38,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:34:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:38,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:34:38,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:34:38,990 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-06 05:34:38,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:34:39,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:34:39,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:34:39,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:34:39,203 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-06 05:34:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:39,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:34:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:41,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556775568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:34:41,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:34:41,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-12-06 05:34:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171411567] [2022-12-06 05:34:41,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:34:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:34:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:41,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:34:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=434, Unknown=10, NotChecked=0, Total=600 [2022-12-06 05:34:41,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:34:41,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 67 transitions, 439 flow. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:41,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:41,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:34:41,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:47,709 INFO L130 PetriNetUnfolder]: 1325/2119 cut-off events. [2022-12-06 05:34:47,710 INFO L131 PetriNetUnfolder]: For 3890/3939 co-relation queries the response was YES. [2022-12-06 05:34:47,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 2119 events. 1325/2119 cut-off events. For 3890/3939 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10349 event pairs, 167 based on Foata normal form. 52/2168 useless extension candidates. Maximal degree in co-relation 7374. Up to 977 conditions per place. [2022-12-06 05:34:47,725 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 159 selfloop transitions, 113 changer transitions 8/282 dead transitions. [2022-12-06 05:34:47,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 282 transitions, 2080 flow [2022-12-06 05:34:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 05:34:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 05:34:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 261 transitions. [2022-12-06 05:34:47,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2022-12-06 05:34:47,728 INFO L175 Difference]: Start difference. First operand has 44 places, 67 transitions, 439 flow. Second operand 27 states and 261 transitions. [2022-12-06 05:34:47,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 282 transitions, 2080 flow [2022-12-06 05:34:47,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 282 transitions, 2046 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-06 05:34:47,752 INFO L231 Difference]: Finished difference. Result has 81 places, 153 transitions, 1332 flow [2022-12-06 05:34:47,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1332, PETRI_PLACES=81, PETRI_TRANSITIONS=153} [2022-12-06 05:34:47,753 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 05:34:47,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:47,753 INFO L89 Accepts]: Start accepts. Operand has 81 places, 153 transitions, 1332 flow [2022-12-06 05:34:47,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:47,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:47,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 153 transitions, 1332 flow [2022-12-06 05:34:47,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 153 transitions, 1332 flow [2022-12-06 05:34:47,864 INFO L130 PetriNetUnfolder]: 574/1243 cut-off events. [2022-12-06 05:34:47,865 INFO L131 PetriNetUnfolder]: For 4198/4218 co-relation queries the response was YES. [2022-12-06 05:34:47,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5027 conditions, 1243 events. 574/1243 cut-off events. For 4198/4218 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8121 event pairs, 141 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 4938. Up to 416 conditions per place. [2022-12-06 05:34:47,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 153 transitions, 1332 flow [2022-12-06 05:34:47,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 806 [2022-12-06 05:34:47,883 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:47,883 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:48,146 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~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 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) 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, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} 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, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 05:34:48,283 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:34:48,411 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [563] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_43 (+ v_thread1Thread1of1ForFork1_~i~0_44 1)) (let ((.cse1 (select (select |v_#memory_int_191| v_~A~0.base_98) (+ v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_44 4))))) (let ((.cse0 (< v_~max1~0_85 .cse1))) (or (and .cse0 (= v_~max1~0_84 .cse1)) (and (not .cse0) (= v_~max1~0_85 v_~max1~0_84) (= |v_thread1Thread1of1ForFork1_#t~mem3_39| |v_thread1Thread1of1ForFork1_#t~mem3_38|))))) (= |v_thread3Thread1of1ForFork0_#res.offset_19| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_19|) (not (< v_thread3Thread1of1ForFork0_~i~2_41 v_~N~0_83)) (< v_thread1Thread1of1ForFork1_~i~0_44 v_~N~0_83)) InVars {~max1~0=v_~max1~0_85, ~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_39|, #memory_int=|v_#memory_int_191|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_44, ~N~0=v_~N~0_83} OutVars{~max1~0=v_~max1~0_84, ~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, 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_19|, #memory_int=|v_#memory_int_191|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_19|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:48,412 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:48,412 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:48,616 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:48,617 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:48,785 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [566] L70-4-->L58-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_89)) (let ((.cse1 (select (select |v_#memory_int_197| v_~A~0.base_104) (+ v_~A~0.offset_104 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse0 (< v_~max2~0_81 .cse1))) (or (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (not .cse0) (= v_~max2~0_81 v_~max2~0_80)) (and .cse0 (= v_~max2~0_80 .cse1))))) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_61) (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_104, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_104, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_81, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_104, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_89, 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_104, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_80, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_197|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:48,959 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~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-06 05:34:49,044 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:34:49,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] 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-06 05:34:49,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [565] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_47 1) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_87)) (let ((.cse0 (select (select |v_#memory_int_195| v_~A~0.base_102) (+ v_~A~0.offset_102 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse1 (< v_~max1~0_89 .cse0))) (or (and (= .cse0 v_~max1~0_88) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse1) (= v_~max1~0_89 v_~max1~0_88))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_87))) InVars {~max1~0=v_~max1~0_89, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_88, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, 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_23|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, 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 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) 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, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} 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, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 05:34:49,536 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:49,536 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:49,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:34:49,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:49,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:34:50,047 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:34:50,165 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [563] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_43 (+ v_thread1Thread1of1ForFork1_~i~0_44 1)) (let ((.cse1 (select (select |v_#memory_int_191| v_~A~0.base_98) (+ v_~A~0.offset_98 (* v_thread1Thread1of1ForFork1_~i~0_44 4))))) (let ((.cse0 (< v_~max1~0_85 .cse1))) (or (and .cse0 (= v_~max1~0_84 .cse1)) (and (not .cse0) (= v_~max1~0_85 v_~max1~0_84) (= |v_thread1Thread1of1ForFork1_#t~mem3_39| |v_thread1Thread1of1ForFork1_#t~mem3_38|))))) (= |v_thread3Thread1of1ForFork0_#res.offset_19| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_19|) (not (< v_thread3Thread1of1ForFork0_~i~2_41 v_~N~0_83)) (< v_thread1Thread1of1ForFork1_~i~0_44 v_~N~0_83)) InVars {~max1~0=v_~max1~0_85, ~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_39|, #memory_int=|v_#memory_int_191|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_44, ~N~0=v_~N~0_83} OutVars{~max1~0=v_~max1~0_84, ~A~0.base=v_~A~0.base_98, ~A~0.offset=v_~A~0.offset_98, 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_19|, #memory_int=|v_#memory_int_191|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_41, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_19|, ~N~0=v_~N~0_83} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:50,165 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:50,166 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:50,376 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:50,376 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:50,697 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~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 (< v_~max2~0_41 .cse1))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~max2~0_41 v_~max2~0_40)) (and .cse0 (= v_~max2~0_40 .cse1)))))) 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, ~max2~0=v_~max2~0_41, #memory_int=|v_#memory_int_84|} 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, ~max2~0=v_~max2~0_40, #memory_int=|v_#memory_int_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0] [2022-12-06 05:34:50,840 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [568] L70-4-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_204| v_~A~0.base_106))) (and (let ((.cse1 (select .cse2 (+ v_~A~0.offset_106 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_51 4))))) (let ((.cse0 (< v_~max1~0_95 .cse1))) (or (and (not .cse0) (= v_~max1~0_95 v_~max1~0_94) (= |v_thread1Thread1of1ForFork1_#t~mem3_49| |v_thread1Thread1of1ForFork1_#t~mem3_50|)) (and .cse0 (= v_~max1~0_94 .cse1))))) (= v_thread1Thread1of1ForFork1_~i~0_51 (+ v_thread1Thread1of1ForFork1_~i~0_53 2)) (let ((.cse4 (select .cse2 (+ v_~A~0.offset_106 (* v_thread1Thread1of1ForFork1_~i~0_53 4))))) (let ((.cse3 (< v_~max1~0_96 .cse4))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_51| |v_thread1Thread1of1ForFork1_#t~mem3_50|) (not .cse3) (= v_~max1~0_96 v_~max1~0_95)) (and .cse3 (= v_~max1~0_95 .cse4))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_29|) (not (< v_thread3Thread1of1ForFork0_~i~2_53 v_~N~0_91)) (= |v_thread3Thread1of1ForFork0_#res.offset_29| 0) (< v_thread1Thread1of1ForFork1_~i~0_51 (+ 1 v_~N~0_91)))) InVars {~max1~0=v_~max1~0_96, ~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_51|, #memory_int=|v_#memory_int_204|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_53, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_53, ~N~0=v_~N~0_91} OutVars{~max1~0=v_~max1~0_94, ~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_27|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_49|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_35|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_29|, #memory_int=|v_#memory_int_204|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_53, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_51, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_29|, ~N~0=v_~N~0_91} AuxVars[v_~max1~0_95, |v_thread1Thread1of1ForFork1_#t~mem3_50|] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:50,840 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:50,841 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:34:51,151 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:51,249 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] and [566] L70-4-->L58-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_89)) (let ((.cse1 (select (select |v_#memory_int_197| v_~A~0.base_104) (+ v_~A~0.offset_104 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse0 (< v_~max2~0_81 .cse1))) (or (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (not .cse0) (= v_~max2~0_81 v_~max2~0_80)) (and .cse0 (= v_~max2~0_80 .cse1))))) (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_61) (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_104, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_104, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_81, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, ~N~0=v_~N~0_89} OutVars{~A~0.base=v_~A~0.base_104, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_89, 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_104, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_61, ~max2~0=v_~max2~0_80, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_197|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~max2~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:34:54,693 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 05:34:54,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6941 [2022-12-06 05:34:54,694 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 150 transitions, 1401 flow [2022-12-06 05:34:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:54,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:54,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:54,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:34:54,904 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-06 05:34:54,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 96188597, now seen corresponding path program 1 times [2022-12-06 05:34:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696404459] [2022-12-06 05:34:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:34:54,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:54,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696404459] [2022-12-06 05:34:54,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696404459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:34:54,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:34:54,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:34:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654770915] [2022-12-06 05:34:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:34:54,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:34:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:34:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:34:54,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 55 [2022-12-06 05:34:54,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 150 transitions, 1401 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-06 05:34:54,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:54,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 55 [2022-12-06 05:34:54,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:55,402 INFO L130 PetriNetUnfolder]: 1536/2554 cut-off events. [2022-12-06 05:34:55,403 INFO L131 PetriNetUnfolder]: For 12996/13056 co-relation queries the response was YES. [2022-12-06 05:34:55,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12813 conditions, 2554 events. 1536/2554 cut-off events. For 12996/13056 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14091 event pairs, 590 based on Foata normal form. 158/2689 useless extension candidates. Maximal degree in co-relation 12526. Up to 1177 conditions per place. [2022-12-06 05:34:55,434 INFO L137 encePairwiseOnDemand]: 37/55 looper letters, 164 selfloop transitions, 16 changer transitions 1/187 dead transitions. [2022-12-06 05:34:55,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 187 transitions, 2068 flow [2022-12-06 05:34:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:34:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:34:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-06 05:34:55,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-06 05:34:55,436 INFO L175 Difference]: Start difference. First operand has 79 places, 150 transitions, 1401 flow. Second operand 4 states and 95 transitions. [2022-12-06 05:34:55,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 187 transitions, 2068 flow [2022-12-06 05:34:55,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 187 transitions, 1972 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-06 05:34:55,485 INFO L231 Difference]: Finished difference. Result has 81 places, 141 transitions, 1322 flow [2022-12-06 05:34:55,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1322, PETRI_PLACES=81, PETRI_TRANSITIONS=141} [2022-12-06 05:34:55,488 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 05:34:55,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:55,488 INFO L89 Accepts]: Start accepts. Operand has 81 places, 141 transitions, 1322 flow [2022-12-06 05:34:55,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:55,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:55,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 141 transitions, 1322 flow [2022-12-06 05:34:55,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 141 transitions, 1322 flow [2022-12-06 05:34:55,642 INFO L130 PetriNetUnfolder]: 675/1552 cut-off events. [2022-12-06 05:34:55,642 INFO L131 PetriNetUnfolder]: For 5390/5413 co-relation queries the response was YES. [2022-12-06 05:34:55,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6299 conditions, 1552 events. 675/1552 cut-off events. For 5390/5413 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 11423 event pairs, 226 based on Foata normal form. 2/1476 useless extension candidates. Maximal degree in co-relation 6273. Up to 550 conditions per place. [2022-12-06 05:34:55,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 141 transitions, 1322 flow [2022-12-06 05:34:55,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-06 05:34:55,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [576] $Ultimate##0-->L94-3: Formula: (and (= (store |v_#memory_int_217| |v_ULTIMATE.start_main_~#t3~0#1.base_43| (store (select |v_#memory_int_217| |v_ULTIMATE.start_main_~#t3~0#1.base_43|) |v_ULTIMATE.start_main_~#t3~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre17#1_49|)) |v_#memory_int_216|) (= v_thread1Thread1of1ForFork1_~i~0_71 1) (< v_thread1Thread1of1ForFork1_~i~0_71 (+ v_~N~0_103 1)) (let ((.cse1 (select (select |v_#memory_int_217| v_~A~0.base_118) (+ v_~A~0.offset_118 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_71 4))))) (let ((.cse0 (< v_~max1~0_125 .cse1))) (or (and (= v_~max1~0_125 v_~max1~0_124) (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_80| |v_thread1Thread1of1ForFork1_#t~mem3_79|)) (and (= v_~max1~0_124 .cse1) .cse0)))) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_49| |v_#pthreadsForks_80|)) InVars {~max1~0=v_~max1~0_125, ~A~0.base=v_~A~0.base_118, ~A~0.offset=v_~A~0.offset_118, #pthreadsForks=|v_#pthreadsForks_80|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_80|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, #memory_int=|v_#memory_int_217|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_43|, ~N~0=v_~N~0_103} OutVars{~A~0.base=v_~A~0.base_118, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_43|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_47|, ~N~0=v_~N~0_103, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_49|, ~max1~0=v_~max1~0_124, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_33|, ~A~0.offset=v_~A~0.offset_118, #pthreadsForks=|v_#pthreadsForks_79|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_45|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_79|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_53|, #memory_int=|v_#memory_int_216|} AuxVars[] AssignedVars[~max1~0, ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, #memory_int, thread1Thread1of1ForFork1_~i~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 05:34:56,085 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:34:56,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-06 05:34:56,086 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 141 transitions, 1329 flow [2022-12-06 05:34:56,086 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-06 05:34:56,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:56,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:34:56,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1391850058, now seen corresponding path program 1 times [2022-12-06 05:34:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259732375] [2022-12-06 05:34:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:34:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:56,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259732375] [2022-12-06 05:34:56,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259732375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:34:56,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:34:56,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:34:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744367755] [2022-12-06 05:34:56,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:34:56,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:34:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:34:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:34:56,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 50 [2022-12-06 05:34:56,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 141 transitions, 1329 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-06 05:34:56,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:56,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 50 [2022-12-06 05:34:56,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:56,506 INFO L130 PetriNetUnfolder]: 1513/2501 cut-off events. [2022-12-06 05:34:56,506 INFO L131 PetriNetUnfolder]: For 12331/12383 co-relation queries the response was YES. [2022-12-06 05:34:56,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12419 conditions, 2501 events. 1513/2501 cut-off events. For 12331/12383 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13622 event pairs, 670 based on Foata normal form. 68/2551 useless extension candidates. Maximal degree in co-relation 12391. Up to 1292 conditions per place. [2022-12-06 05:34:56,538 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 161 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2022-12-06 05:34:56,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 1847 flow [2022-12-06 05:34:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:34:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:34:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-06 05:34:56,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:34:56,540 INFO L175 Difference]: Start difference. First operand has 80 places, 141 transitions, 1329 flow. Second operand 3 states and 75 transitions. [2022-12-06 05:34:56,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 1847 flow [2022-12-06 05:34:56,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1842 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 05:34:56,571 INFO L231 Difference]: Finished difference. Result has 77 places, 136 transitions, 1267 flow [2022-12-06 05:34:56,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1267, PETRI_PLACES=77, PETRI_TRANSITIONS=136} [2022-12-06 05:34:56,573 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2022-12-06 05:34:56,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:56,573 INFO L89 Accepts]: Start accepts. Operand has 77 places, 136 transitions, 1267 flow [2022-12-06 05:34:56,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:56,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:56,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 136 transitions, 1267 flow [2022-12-06 05:34:56,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 136 transitions, 1267 flow [2022-12-06 05:34:56,712 INFO L130 PetriNetUnfolder]: 652/1488 cut-off events. [2022-12-06 05:34:56,712 INFO L131 PetriNetUnfolder]: For 5137/5160 co-relation queries the response was YES. [2022-12-06 05:34:56,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6022 conditions, 1488 events. 652/1488 cut-off events. For 5137/5160 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 10721 event pairs, 219 based on Foata normal form. 2/1412 useless extension candidates. Maximal degree in co-relation 5973. Up to 537 conditions per place. [2022-12-06 05:34:56,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 136 transitions, 1267 flow [2022-12-06 05:34:56,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 05:34:56,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:34:56,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 05:34:56,735 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 136 transitions, 1267 flow [2022-12-06 05:34:56,735 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-06 05:34:56,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:56,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:34:56,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1107874665, now seen corresponding path program 1 times [2022-12-06 05:34:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:56,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990870636] [2022-12-06 05:34:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:56,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990870636] [2022-12-06 05:34:56,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990870636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:56,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602492750] [2022-12-06 05:34:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:56,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:34:56,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:34:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:56,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:34:56,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:34:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:56,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:34:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:57,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602492750] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:57,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:34:57,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2022-12-06 05:34:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653494564] [2022-12-06 05:34:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:34:57,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:34:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:34:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:34:57,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:34:57,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 136 transitions, 1267 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:57,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:57,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:34:57,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:57,649 INFO L130 PetriNetUnfolder]: 2513/3794 cut-off events. [2022-12-06 05:34:57,650 INFO L131 PetriNetUnfolder]: For 18292/18292 co-relation queries the response was YES. [2022-12-06 05:34:57,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19229 conditions, 3794 events. 2513/3794 cut-off events. For 18292/18292 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 19381 event pairs, 208 based on Foata normal form. 8/3790 useless extension candidates. Maximal degree in co-relation 18917. Up to 1461 conditions per place. [2022-12-06 05:34:57,727 INFO L137 encePairwiseOnDemand]: 31/47 looper letters, 275 selfloop transitions, 41 changer transitions 8/324 dead transitions. [2022-12-06 05:34:57,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 324 transitions, 3765 flow [2022-12-06 05:34:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:34:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:34:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-06 05:34:57,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41033434650455924 [2022-12-06 05:34:57,732 INFO L175 Difference]: Start difference. First operand has 77 places, 136 transitions, 1267 flow. Second operand 7 states and 135 transitions. [2022-12-06 05:34:57,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 324 transitions, 3765 flow [2022-12-06 05:34:57,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 324 transitions, 3763 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:34:57,781 INFO L231 Difference]: Finished difference. Result has 87 places, 169 transitions, 1905 flow [2022-12-06 05:34:57,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1905, PETRI_PLACES=87, PETRI_TRANSITIONS=169} [2022-12-06 05:34:57,784 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2022-12-06 05:34:57,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:57,784 INFO L89 Accepts]: Start accepts. Operand has 87 places, 169 transitions, 1905 flow [2022-12-06 05:34:57,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:57,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:57,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 169 transitions, 1905 flow [2022-12-06 05:34:57,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 169 transitions, 1905 flow [2022-12-06 05:34:57,977 INFO L130 PetriNetUnfolder]: 951/1862 cut-off events. [2022-12-06 05:34:57,977 INFO L131 PetriNetUnfolder]: For 10711/10862 co-relation queries the response was YES. [2022-12-06 05:34:57,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 1862 events. 951/1862 cut-off events. For 10711/10862 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 12474 event pairs, 198 based on Foata normal form. 66/1796 useless extension candidates. Maximal degree in co-relation 8977. Up to 734 conditions per place. [2022-12-06 05:34:58,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 169 transitions, 1905 flow [2022-12-06 05:34:58,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-06 05:34:58,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [565] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_47 1) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_87)) (let ((.cse0 (select (select |v_#memory_int_195| v_~A~0.base_102) (+ v_~A~0.offset_102 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse1 (< v_~max1~0_89 .cse0))) (or (and (= .cse0 v_~max1~0_88) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse1) (= v_~max1~0_89 v_~max1~0_88))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_87))) InVars {~max1~0=v_~max1~0_89, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_88, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, 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_23|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] 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-06 05:34:58,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [582] L70-4-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_230| v_~A~0.base_126)) (.cse3 (* v_thread1Thread1of1ForFork1_~i~0_79 4))) (and (not (< v_thread3Thread1of1ForFork0_~i~2_71 v_~N~0_111)) (= v_thread1Thread1of1ForFork1_~i~0_79 2) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_126 .cse3 (- 8))))) (let ((.cse0 (< v_~max1~0_142 .cse1))) (or (and .cse0 (= .cse1 v_~max1~0_141)) (and (not .cse0) (= v_~max1~0_142 v_~max1~0_141) (= |v_thread1Thread1of1ForFork1_#t~mem3_97| |v_thread1Thread1of1ForFork1_#t~mem3_96|))))) (let ((.cse5 (select .cse2 (+ v_~A~0.offset_126 (- 4) .cse3)))) (let ((.cse4 (< v_~max1~0_141 .cse5))) (or (and .cse4 (= v_~max1~0_140 .cse5)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_96| |v_thread1Thread1of1ForFork1_#t~mem3_95|) (= v_~max1~0_141 v_~max1~0_140) (not .cse4))))) (= |v_thread3Thread1of1ForFork0_#res.offset_39| 0) (< v_thread1Thread1of1ForFork1_~i~0_79 (+ v_~N~0_111 1)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_39|))) InVars {~max1~0=v_~max1~0_142, ~A~0.base=v_~A~0.base_126, ~A~0.offset=v_~A~0.offset_126, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_97|, #memory_int=|v_#memory_int_230|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_71, ~N~0=v_~N~0_111} OutVars{~max1~0=v_~max1~0_140, ~A~0.base=v_~A~0.base_126, ~A~0.offset=v_~A~0.offset_126, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_53|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_95|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_61|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_39|, #memory_int=|v_#memory_int_230|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_71, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_79, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_39|, ~N~0=v_~N~0_111} AuxVars[|v_thread1Thread1of1ForFork1_#t~mem3_96|, v_~max1~0_141] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] 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-06 05:34:58,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [565] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_47 1) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_87)) (let ((.cse0 (select (select |v_#memory_int_195| v_~A~0.base_102) (+ v_~A~0.offset_102 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse1 (< v_~max1~0_89 .cse0))) (or (and (= .cse0 v_~max1~0_88) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse1) (= v_~max1~0_89 v_~max1~0_88))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_87))) InVars {~max1~0=v_~max1~0_89, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_88, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, 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_23|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] 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-06 05:34:58,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [595] $Ultimate##0-->thread3EXIT: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_107 (+ v_~N~0_131 1)) (= v_thread1Thread1of1ForFork1_~i~0_107 1) (let ((.cse1 (select (select |v_#memory_int_248| v_~A~0.base_144) (+ v_~A~0.offset_144 (* v_thread1Thread1of1ForFork1_~i~0_107 4) (- 4))))) (let ((.cse0 (< v_~max1~0_180 .cse1))) (or (and .cse0 (= v_~max1~0_179 .cse1)) (and (= v_~max1~0_179 v_~max1~0_180) (= |v_thread1Thread1of1ForFork1_#t~mem3_135| |v_thread1Thread1of1ForFork1_#t~mem3_134|) (not .cse0))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_47|) (not (< v_thread3Thread1of1ForFork0_~i~2_95 v_~N~0_131)) (= |v_thread3Thread1of1ForFork0_#res.offset_47| 0)) InVars {~max1~0=v_~max1~0_180, ~A~0.base=v_~A~0.base_144, ~A~0.offset=v_~A~0.offset_144, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_135|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_95, #memory_int=|v_#memory_int_248|, ~N~0=v_~N~0_131} OutVars{~max1~0=v_~max1~0_179, ~A~0.base=v_~A~0.base_144, ~A~0.offset=v_~A~0.offset_144, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_75|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_134|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_47|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_83|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_95, #memory_int=|v_#memory_int_248|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_47|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_107, ~N~0=v_~N~0_131} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork1_~i~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-06 05:34:58,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:34:58,458 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:34:58,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 674 [2022-12-06 05:34:58,458 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 169 transitions, 1932 flow [2022-12-06 05:34:58,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:58,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:34:58,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:34:58,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:34:58,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:58,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:34:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:34:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1545303503, now seen corresponding path program 1 times [2022-12-06 05:34:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:34:58,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503331639] [2022-12-06 05:34:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:34:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:58,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:34:58,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503331639] [2022-12-06 05:34:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503331639] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:34:58,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006489977] [2022-12-06 05:34:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:34:58,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:34:58,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:34:58,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:34:58,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:34:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:34:58,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:34:58,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:34:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:58,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:34:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:34:58,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006489977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:34:58,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:34:58,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-12-06 05:34:58,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501596963] [2022-12-06 05:34:58,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:34:58,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:34:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:34:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:34:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:34:58,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:34:58,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 169 transitions, 1932 flow. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:34:58,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:34:58,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:34:58,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:34:59,711 INFO L130 PetriNetUnfolder]: 1931/3006 cut-off events. [2022-12-06 05:34:59,712 INFO L131 PetriNetUnfolder]: For 19509/19509 co-relation queries the response was YES. [2022-12-06 05:34:59,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16782 conditions, 3006 events. 1931/3006 cut-off events. For 19509/19509 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15363 event pairs, 100 based on Foata normal form. 220/3216 useless extension candidates. Maximal degree in co-relation 16746. Up to 1168 conditions per place. [2022-12-06 05:34:59,728 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 246 selfloop transitions, 25 changer transitions 3/274 dead transitions. [2022-12-06 05:34:59,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 274 transitions, 3235 flow [2022-12-06 05:34:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:34:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:34:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2022-12-06 05:34:59,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23776223776223776 [2022-12-06 05:34:59,729 INFO L175 Difference]: Start difference. First operand has 86 places, 169 transitions, 1932 flow. Second operand 11 states and 136 transitions. [2022-12-06 05:34:59,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 274 transitions, 3235 flow [2022-12-06 05:34:59,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 274 transitions, 3223 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:34:59,787 INFO L231 Difference]: Finished difference. Result has 101 places, 158 transitions, 1885 flow [2022-12-06 05:34:59,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1885, PETRI_PLACES=101, PETRI_TRANSITIONS=158} [2022-12-06 05:34:59,788 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2022-12-06 05:34:59,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:34:59,788 INFO L89 Accepts]: Start accepts. Operand has 101 places, 158 transitions, 1885 flow [2022-12-06 05:34:59,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:34:59,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:34:59,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 158 transitions, 1885 flow [2022-12-06 05:34:59,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 158 transitions, 1885 flow [2022-12-06 05:34:59,923 INFO L130 PetriNetUnfolder]: 703/1425 cut-off events. [2022-12-06 05:34:59,923 INFO L131 PetriNetUnfolder]: For 10643/10784 co-relation queries the response was YES. [2022-12-06 05:34:59,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7531 conditions, 1425 events. 703/1425 cut-off events. For 10643/10784 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9406 event pairs, 157 based on Foata normal form. 61/1380 useless extension candidates. Maximal degree in co-relation 6793. Up to 584 conditions per place. [2022-12-06 05:34:59,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 158 transitions, 1885 flow [2022-12-06 05:34:59,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 810 [2022-12-06 05:34:59,944 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 [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-06 05:34:59,954 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 [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-06 05:34:59,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [551] L97-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (not (= (ite (< v_~max2~0_In_5 v_~max3~0_In_5) v_~max3~0_In_5 v_~max2~0_In_5) v_~max1~0_In_5)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_32| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_32|)) InVars {~max1~0=v_~max1~0_In_5, ~max2~0=v_~max2~0_In_5, ~max3~0=v_~max3~0_In_5} OutVars{~max1~0=v_~max1~0_In_5, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_32|, ~max2~0=v_~max2~0_In_5, ~max3~0=v_~max3~0_In_5, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_Out_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 05:35:00,050 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,050 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,229 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,229 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,403 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,403 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,582 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,583 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,814 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,815 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,815 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:00,815 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,116 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,117 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,286 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,286 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,466 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,466 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,652 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,653 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:01,826 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:35:01,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2039 [2022-12-06 05:35:01,827 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 158 transitions, 1910 flow [2022-12-06 05:35:01,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:01,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:01,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:01,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:02,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:02,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash 537499637, now seen corresponding path program 1 times [2022-12-06 05:35:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:02,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730956349] [2022-12-06 05:35:02,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:02,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730956349] [2022-12-06 05:35:02,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730956349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:02,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:02,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:35:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748083969] [2022-12-06 05:35:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:02,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:35:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:02,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:35:02,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:35:02,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 05:35:02,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 158 transitions, 1910 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-06 05:35:02,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:02,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 05:35:02,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:02,558 INFO L130 PetriNetUnfolder]: 1384/2222 cut-off events. [2022-12-06 05:35:02,558 INFO L131 PetriNetUnfolder]: For 22171/22351 co-relation queries the response was YES. [2022-12-06 05:35:02,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13824 conditions, 2222 events. 1384/2222 cut-off events. For 22171/22351 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 11572 event pairs, 256 based on Foata normal form. 278/2487 useless extension candidates. Maximal degree in co-relation 12809. Up to 941 conditions per place. [2022-12-06 05:35:02,573 INFO L137 encePairwiseOnDemand]: 33/59 looper letters, 120 selfloop transitions, 29 changer transitions 34/189 dead transitions. [2022-12-06 05:35:02,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 189 transitions, 2332 flow [2022-12-06 05:35:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:35:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:35:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 05:35:02,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3022598870056497 [2022-12-06 05:35:02,575 INFO L175 Difference]: Start difference. First operand has 99 places, 158 transitions, 1910 flow. Second operand 6 states and 107 transitions. [2022-12-06 05:35:02,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 189 transitions, 2332 flow [2022-12-06 05:35:02,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 189 transitions, 2210 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-06 05:35:02,630 INFO L231 Difference]: Finished difference. Result has 100 places, 115 transitions, 1355 flow [2022-12-06 05:35:02,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=100, PETRI_TRANSITIONS=115} [2022-12-06 05:35:02,631 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2022-12-06 05:35:02,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:02,631 INFO L89 Accepts]: Start accepts. Operand has 100 places, 115 transitions, 1355 flow [2022-12-06 05:35:02,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:02,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:02,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 115 transitions, 1355 flow [2022-12-06 05:35:02,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 115 transitions, 1355 flow [2022-12-06 05:35:02,729 INFO L130 PetriNetUnfolder]: 510/1056 cut-off events. [2022-12-06 05:35:02,729 INFO L131 PetriNetUnfolder]: For 6625/6679 co-relation queries the response was YES. [2022-12-06 05:35:02,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 1056 events. 510/1056 cut-off events. For 6625/6679 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6481 event pairs, 118 based on Foata normal form. 23/995 useless extension candidates. Maximal degree in co-relation 5414. Up to 378 conditions per place. [2022-12-06 05:35:02,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 115 transitions, 1355 flow [2022-12-06 05:35:02,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-06 05:35:03,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:03,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 389 [2022-12-06 05:35:03,020 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 1351 flow [2022-12-06 05:35:03,020 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-06 05:35:03,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:03,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:03,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:35:03,021 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1598488648, now seen corresponding path program 1 times [2022-12-06 05:35:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:03,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497110671] [2022-12-06 05:35:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:04,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:04,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497110671] [2022-12-06 05:35:04,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497110671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:04,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206220874] [2022-12-06 05:35:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:04,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:04,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:35:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:04,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:35:04,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:04,520 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 05:35:04,520 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 79 treesize of output 69 [2022-12-06 05:35:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:04,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:04,840 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 05:35:04,841 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-06 05:35:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:04,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206220874] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:04,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:04,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 12 [2022-12-06 05:35:04,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818410209] [2022-12-06 05:35:04,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:04,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:35:04,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:04,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:35:04,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:35:04,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 05:35:04,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 1351 flow. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:04,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:04,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 05:35:04,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:05,887 INFO L130 PetriNetUnfolder]: 1434/2209 cut-off events. [2022-12-06 05:35:05,888 INFO L131 PetriNetUnfolder]: For 18706/18886 co-relation queries the response was YES. [2022-12-06 05:35:05,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13872 conditions, 2209 events. 1434/2209 cut-off events. For 18706/18886 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10597 event pairs, 317 based on Foata normal form. 166/2353 useless extension candidates. Maximal degree in co-relation 13541. Up to 1644 conditions per place. [2022-12-06 05:35:05,903 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 124 selfloop transitions, 77 changer transitions 23/230 dead transitions. [2022-12-06 05:35:05,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 230 transitions, 2906 flow [2022-12-06 05:35:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:35:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:35:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 153 transitions. [2022-12-06 05:35:05,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2870544090056285 [2022-12-06 05:35:05,905 INFO L175 Difference]: Start difference. First operand has 93 places, 114 transitions, 1351 flow. Second operand 13 states and 153 transitions. [2022-12-06 05:35:05,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 230 transitions, 2906 flow [2022-12-06 05:35:05,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 230 transitions, 2875 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:05,934 INFO L231 Difference]: Finished difference. Result has 106 places, 151 transitions, 2061 flow [2022-12-06 05:35:05,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2061, PETRI_PLACES=106, PETRI_TRANSITIONS=151} [2022-12-06 05:35:05,935 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2022-12-06 05:35:05,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:05,935 INFO L89 Accepts]: Start accepts. Operand has 106 places, 151 transitions, 2061 flow [2022-12-06 05:35:05,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:05,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:05,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 151 transitions, 2061 flow [2022-12-06 05:35:05,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 151 transitions, 2061 flow [2022-12-06 05:35:06,058 INFO L130 PetriNetUnfolder]: 641/1251 cut-off events. [2022-12-06 05:35:06,058 INFO L131 PetriNetUnfolder]: For 8167/8223 co-relation queries the response was YES. [2022-12-06 05:35:06,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7218 conditions, 1251 events. 641/1251 cut-off events. For 8167/8223 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7479 event pairs, 132 based on Foata normal form. 24/1176 useless extension candidates. Maximal degree in co-relation 7028. Up to 414 conditions per place. [2022-12-06 05:35:06,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 151 transitions, 2061 flow [2022-12-06 05:35:06,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 05:35:06,183 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [565] L70-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_47 1) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (< v_thread1Thread1of1ForFork1_~i~0_47 (+ 1 v_~N~0_87)) (let ((.cse0 (select (select |v_#memory_int_195| v_~A~0.base_102) (+ v_~A~0.offset_102 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_47 4))))) (let ((.cse1 (< v_~max1~0_89 .cse0))) (or (and (= .cse0 v_~max1~0_88) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse1) (= v_~max1~0_89 v_~max1~0_88))))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_87))) InVars {~max1~0=v_~max1~0_89, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_88, ~A~0.base=v_~A~0.base_102, ~A~0.offset=v_~A~0.offset_102, 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_23|, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] 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-06 05:35:06,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] $Ultimate##0-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_210| v_~A~0.base_112))) (and (= |v_thread3Thread1of1ForFork0_#res.offset_31| 0) (= v_thread1Thread1of1ForFork1_~i~0_61 2) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_112 4)))) (let ((.cse0 (< v_~max1~0_109 .cse1))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_64| |v_thread1Thread1of1ForFork1_#t~mem3_63|) (not .cse0) (= v_~max1~0_109 v_~max1~0_108)) (and (= v_~max1~0_108 .cse1) .cse0)))) (not (< v_thread3Thread1of1ForFork0_~i~2_59 v_~N~0_97)) (< 1 v_~N~0_97) (= 0 |v_thread3Thread1of1ForFork0_#res.base_31|) (let ((.cse4 (select .cse2 v_~A~0.offset_112))) (let ((.cse3 (< v_~max1~0_110 .cse4))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_65| |v_thread1Thread1of1ForFork1_#t~mem3_64|) (not .cse3) (= v_~max1~0_110 v_~max1~0_109)) (and .cse3 (= v_~max1~0_109 .cse4))))))) InVars {~max1~0=v_~max1~0_110, ~A~0.base=v_~A~0.base_112, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_65|, #memory_int=|v_#memory_int_210|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_59, ~N~0=v_~N~0_97} OutVars{~max1~0=v_~max1~0_108, ~A~0.base=v_~A~0.base_112, ~A~0.offset=v_~A~0.offset_112, 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_31|, #memory_int=|v_#memory_int_210|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_59, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_61, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_31|, ~N~0=v_~N~0_97} AuxVars[v_~max1~0_109, |v_thread1Thread1of1ForFork1_#t~mem3_64|] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] 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-06 05:35:06,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] $Ultimate##0-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_210| v_~A~0.base_112))) (and (= |v_thread3Thread1of1ForFork0_#res.offset_31| 0) (= v_thread1Thread1of1ForFork1_~i~0_61 2) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_112 4)))) (let ((.cse0 (< v_~max1~0_109 .cse1))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_64| |v_thread1Thread1of1ForFork1_#t~mem3_63|) (not .cse0) (= v_~max1~0_109 v_~max1~0_108)) (and (= v_~max1~0_108 .cse1) .cse0)))) (not (< v_thread3Thread1of1ForFork0_~i~2_59 v_~N~0_97)) (< 1 v_~N~0_97) (= 0 |v_thread3Thread1of1ForFork0_#res.base_31|) (let ((.cse4 (select .cse2 v_~A~0.offset_112))) (let ((.cse3 (< v_~max1~0_110 .cse4))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_65| |v_thread1Thread1of1ForFork1_#t~mem3_64|) (not .cse3) (= v_~max1~0_110 v_~max1~0_109)) (and .cse3 (= v_~max1~0_109 .cse4))))))) InVars {~max1~0=v_~max1~0_110, ~A~0.base=v_~A~0.base_112, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_65|, #memory_int=|v_#memory_int_210|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_59, ~N~0=v_~N~0_97} OutVars{~max1~0=v_~max1~0_108, ~A~0.base=v_~A~0.base_112, ~A~0.offset=v_~A~0.offset_112, 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_31|, #memory_int=|v_#memory_int_210|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_59, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_61, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_31|, ~N~0=v_~N~0_97} AuxVars[v_~max1~0_109, |v_thread1Thread1of1ForFork1_#t~mem3_64|] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base] 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-06 05:35:06,558 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:06,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-06 05:35:06,559 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 150 transitions, 2073 flow [2022-12-06 05:35:06,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:06,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:06,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:06,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 05:35:06,761 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1414504850, now seen corresponding path program 1 times [2022-12-06 05:35:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:06,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385341421] [2022-12-06 05:35:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:06,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:06,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385341421] [2022-12-06 05:35:06,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385341421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:06,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321216837] [2022-12-06 05:35:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:06,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:06,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:06,925 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:07,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:35:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:07,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:35:07,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:07,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:07,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321216837] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:07,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:07,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:35:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377615000] [2022-12-06 05:35:07,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:07,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:35:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:35:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:35:07,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:35:07,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 150 transitions, 2073 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-06 05:35:07,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:07,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:35:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:07,786 INFO L130 PetriNetUnfolder]: 1963/2945 cut-off events. [2022-12-06 05:35:07,787 INFO L131 PetriNetUnfolder]: For 23978/23978 co-relation queries the response was YES. [2022-12-06 05:35:07,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19111 conditions, 2945 events. 1963/2945 cut-off events. For 23978/23978 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13706 event pairs, 369 based on Foata normal form. 20/2941 useless extension candidates. Maximal degree in co-relation 18648. Up to 1101 conditions per place. [2022-12-06 05:35:07,808 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 159 selfloop transitions, 62 changer transitions 1/222 dead transitions. [2022-12-06 05:35:07,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 222 transitions, 3094 flow [2022-12-06 05:35:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 05:35:07,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2022-12-06 05:35:07,810 INFO L175 Difference]: Start difference. First operand has 100 places, 150 transitions, 2073 flow. Second operand 7 states and 111 transitions. [2022-12-06 05:35:07,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 222 transitions, 3094 flow [2022-12-06 05:35:07,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 222 transitions, 2989 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:07,866 INFO L231 Difference]: Finished difference. Result has 104 places, 158 transitions, 2337 flow [2022-12-06 05:35:07,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2337, PETRI_PLACES=104, PETRI_TRANSITIONS=158} [2022-12-06 05:35:07,867 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2022-12-06 05:35:07,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:07,867 INFO L89 Accepts]: Start accepts. Operand has 104 places, 158 transitions, 2337 flow [2022-12-06 05:35:07,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:07,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:07,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 158 transitions, 2337 flow [2022-12-06 05:35:07,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 158 transitions, 2337 flow [2022-12-06 05:35:08,006 INFO L130 PetriNetUnfolder]: 760/1495 cut-off events. [2022-12-06 05:35:08,006 INFO L131 PetriNetUnfolder]: For 10880/10946 co-relation queries the response was YES. [2022-12-06 05:35:08,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9240 conditions, 1495 events. 760/1495 cut-off events. For 10880/10946 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 9402 event pairs, 153 based on Foata normal form. 29/1406 useless extension candidates. Maximal degree in co-relation 9049. Up to 474 conditions per place. [2022-12-06 05:35:08,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 158 transitions, 2337 flow [2022-12-06 05:35:08,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 884 [2022-12-06 05:35:08,022 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:08,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 05:35:08,023 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 158 transitions, 2337 flow [2022-12-06 05:35:08,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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-06 05:35:08,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:08,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:08,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:08,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:08,224 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 316361446, now seen corresponding path program 1 times [2022-12-06 05:35:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:08,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062704085] [2022-12-06 05:35:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:35:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:08,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062704085] [2022-12-06 05:35:08,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062704085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:08,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:08,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:35:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114596349] [2022-12-06 05:35:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:08,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:35:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:35:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:35:08,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 42 [2022-12-06 05:35:08,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 158 transitions, 2337 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-06 05:35:08,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:08,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 42 [2022-12-06 05:35:08,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:08,719 INFO L130 PetriNetUnfolder]: 1677/2510 cut-off events. [2022-12-06 05:35:08,720 INFO L131 PetriNetUnfolder]: For 26899/27077 co-relation queries the response was YES. [2022-12-06 05:35:08,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17988 conditions, 2510 events. 1677/2510 cut-off events. For 26899/27077 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11857 event pairs, 391 based on Foata normal form. 279/2762 useless extension candidates. Maximal degree in co-relation 17722. Up to 1728 conditions per place. [2022-12-06 05:35:08,740 INFO L137 encePairwiseOnDemand]: 30/42 looper letters, 140 selfloop transitions, 35 changer transitions 4/191 dead transitions. [2022-12-06 05:35:08,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 191 transitions, 3061 flow [2022-12-06 05:35:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:35:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:35:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-06 05:35:08,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2022-12-06 05:35:08,742 INFO L175 Difference]: Start difference. First operand has 104 places, 158 transitions, 2337 flow. Second operand 4 states and 79 transitions. [2022-12-06 05:35:08,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 191 transitions, 3061 flow [2022-12-06 05:35:08,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 191 transitions, 2903 flow, removed 66 selfloop flow, removed 5 redundant places. [2022-12-06 05:35:08,800 INFO L231 Difference]: Finished difference. Result has 102 places, 155 transitions, 2299 flow [2022-12-06 05:35:08,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2299, PETRI_PLACES=102, PETRI_TRANSITIONS=155} [2022-12-06 05:35:08,801 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2022-12-06 05:35:08,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:08,801 INFO L89 Accepts]: Start accepts. Operand has 102 places, 155 transitions, 2299 flow [2022-12-06 05:35:08,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:08,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:08,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 155 transitions, 2299 flow [2022-12-06 05:35:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 155 transitions, 2299 flow [2022-12-06 05:35:08,925 INFO L130 PetriNetUnfolder]: 827/1516 cut-off events. [2022-12-06 05:35:08,925 INFO L131 PetriNetUnfolder]: For 12186/12291 co-relation queries the response was YES. [2022-12-06 05:35:08,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9844 conditions, 1516 events. 827/1516 cut-off events. For 12186/12291 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8799 event pairs, 151 based on Foata normal form. 32/1447 useless extension candidates. Maximal degree in co-relation 9654. Up to 523 conditions per place. [2022-12-06 05:35:08,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 155 transitions, 2299 flow [2022-12-06 05:35:08,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 824 [2022-12-06 05:35:08,943 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:08,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 05:35:08,944 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 155 transitions, 2299 flow [2022-12-06 05:35:08,944 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-06 05:35:08,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:08,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:08,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:35:08,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1119145952, now seen corresponding path program 1 times [2022-12-06 05:35:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:08,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790672947] [2022-12-06 05:35:08,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:08,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:09,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790672947] [2022-12-06 05:35:09,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790672947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:09,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407035670] [2022-12-06 05:35:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:09,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:09,988 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:09,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:35:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:10,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:35:10,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:10,099 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-06 05:35:10,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:35:10,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:10,261 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-06 05:35:10,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:10,327 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-06 05:35:10,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:10,472 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 72 treesize of output 46 [2022-12-06 05:35:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:10,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:11,424 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_515 (Array Int Int)) (thread3Thread1of1ForFork0_~i~2 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515) c_~A~0.base) (+ c_~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= c_~max1~0 .cse0) (< (+ thread3Thread1of1ForFork0_~i~2 1) c_~N~0) (<= .cse0 c_~max2~0) (not (< c_~max3~0 .cse0)) (not (< thread3Thread1of1ForFork0_~i~2 c_~N~0))))) (or .cse1 (forall ((v_ArrVal_515 (Array Int Int)) (thread3Thread1of1ForFork0_~i~2 Int)) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515) c_~A~0.base) (+ c_~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< (+ thread3Thread1of1ForFork0_~i~2 1) c_~N~0) (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)) (not (< thread3Thread1of1ForFork0_~i~2 c_~N~0)))))) (or (and (or .cse1 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_515 (Array Int Int)) (thread3Thread1of1ForFork0_~i~2 Int)) (or (< (+ thread3Thread1of1ForFork0_~i~2 1) c_~N~0) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515) c_~A~0.base) (+ c_~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread3Thread1of1ForFork0_~i~2 c_~N~0))))))) is different from false [2022-12-06 05:35:11,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (thread3Thread1of1ForFork0_~i~2 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515) c_~A~0.base) (+ c_~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< (+ thread3Thread1of1ForFork0_~i~2 1) c_~N~0) (not (< c_~max3~0 .cse0)) (<= .cse0 c_~max2~0) (= c_~max1~0 .cse0) (not (< thread3Thread1of1ForFork0_~i~2 c_~N~0))))) (or (and (or .cse1 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (thread3Thread1of1ForFork0_~i~2 Int)) (or (< (+ thread3Thread1of1ForFork0_~i~2 1) c_~N~0) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515) c_~A~0.base) (+ c_~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread3Thread1of1ForFork0_~i~2 c_~N~0))))) (or (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (thread3Thread1of1ForFork0_~i~2 Int)) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515) c_~A~0.base) (+ c_~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< c_~max2~0 .cse2) (< (+ thread3Thread1of1ForFork0_~i~2 1) c_~N~0) (not (< c_~max3~0 .cse2)) (not (< thread3Thread1of1ForFork0_~i~2 c_~N~0))))) .cse1))) is different from false [2022-12-06 05:35:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:14,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407035670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:14,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:14,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:35:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117342707] [2022-12-06 05:35:14,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:35:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:35:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=392, Unknown=3, NotChecked=82, Total=552 [2022-12-06 05:35:14,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:35:14,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 155 transitions, 2299 flow. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:14,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:14,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:35:14,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:17,063 INFO L130 PetriNetUnfolder]: 2236/3313 cut-off events. [2022-12-06 05:35:17,064 INFO L131 PetriNetUnfolder]: For 29706/29706 co-relation queries the response was YES. [2022-12-06 05:35:17,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22808 conditions, 3313 events. 2236/3313 cut-off events. For 29706/29706 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15597 event pairs, 275 based on Foata normal form. 2/3291 useless extension candidates. Maximal degree in co-relation 22271. Up to 2688 conditions per place. [2022-12-06 05:35:17,081 INFO L137 encePairwiseOnDemand]: 27/42 looper letters, 185 selfloop transitions, 48 changer transitions 69/302 dead transitions. [2022-12-06 05:35:17,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 302 transitions, 4172 flow [2022-12-06 05:35:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:35:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:35:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 170 transitions. [2022-12-06 05:35:17,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25297619047619047 [2022-12-06 05:35:17,082 INFO L175 Difference]: Start difference. First operand has 101 places, 155 transitions, 2299 flow. Second operand 16 states and 170 transitions. [2022-12-06 05:35:17,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 302 transitions, 4172 flow [2022-12-06 05:35:17,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 302 transitions, 4122 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:17,130 INFO L231 Difference]: Finished difference. Result has 124 places, 172 transitions, 2653 flow [2022-12-06 05:35:17,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2653, PETRI_PLACES=124, PETRI_TRANSITIONS=172} [2022-12-06 05:35:17,131 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2022-12-06 05:35:17,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:17,131 INFO L89 Accepts]: Start accepts. Operand has 124 places, 172 transitions, 2653 flow [2022-12-06 05:35:17,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:17,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:17,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 172 transitions, 2653 flow [2022-12-06 05:35:17,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 172 transitions, 2653 flow [2022-12-06 05:35:17,261 INFO L130 PetriNetUnfolder]: 898/1616 cut-off events. [2022-12-06 05:35:17,261 INFO L131 PetriNetUnfolder]: For 14600/14781 co-relation queries the response was YES. [2022-12-06 05:35:17,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10876 conditions, 1616 events. 898/1616 cut-off events. For 14600/14781 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 9376 event pairs, 170 based on Foata normal form. 45/1561 useless extension candidates. Maximal degree in co-relation 10829. Up to 555 conditions per place. [2022-12-06 05:35:17,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 172 transitions, 2653 flow [2022-12-06 05:35:17,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 910 [2022-12-06 05:35:17,304 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 ((.cse0 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse1 (< v_~max1~0_71 .cse0))) (or (and (= v_~max1~0_70 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (not .cse1) (= v_~max1~0_71 v_~max1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~max1~0=v_~max1~0_71, ~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} OutVars{~max1~0=v_~max1~0_70, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~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-06 05:35:17,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:17,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 05:35:17,383 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 171 transitions, 2651 flow [2022-12-06 05:35:17,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:17,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:17,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:17,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:17,591 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 487769741, now seen corresponding path program 1 times [2022-12-06 05:35:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:17,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440528592] [2022-12-06 05:35:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:17,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440528592] [2022-12-06 05:35:17,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440528592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:17,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:17,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:35:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525170371] [2022-12-06 05:35:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:17,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:17,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:35:17,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 171 transitions, 2651 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:17,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:17,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:35:17,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:18,272 INFO L130 PetriNetUnfolder]: 2199/3249 cut-off events. [2022-12-06 05:35:18,272 INFO L131 PetriNetUnfolder]: For 34368/34368 co-relation queries the response was YES. [2022-12-06 05:35:18,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23398 conditions, 3249 events. 2199/3249 cut-off events. For 34368/34368 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15100 event pairs, 342 based on Foata normal form. 4/3229 useless extension candidates. Maximal degree in co-relation 23349. Up to 1537 conditions per place. [2022-12-06 05:35:18,295 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 256 selfloop transitions, 76 changer transitions 1/333 dead transitions. [2022-12-06 05:35:18,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 333 transitions, 5264 flow [2022-12-06 05:35:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:35:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:35:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-12-06 05:35:18,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32558139534883723 [2022-12-06 05:35:18,300 INFO L175 Difference]: Start difference. First operand has 116 places, 171 transitions, 2651 flow. Second operand 9 states and 126 transitions. [2022-12-06 05:35:18,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 333 transitions, 5264 flow [2022-12-06 05:35:18,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 333 transitions, 5112 flow, removed 67 selfloop flow, removed 7 redundant places. [2022-12-06 05:35:18,403 INFO L231 Difference]: Finished difference. Result has 120 places, 189 transitions, 3074 flow [2022-12-06 05:35:18,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3074, PETRI_PLACES=120, PETRI_TRANSITIONS=189} [2022-12-06 05:35:18,404 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2022-12-06 05:35:18,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:18,404 INFO L89 Accepts]: Start accepts. Operand has 120 places, 189 transitions, 3074 flow [2022-12-06 05:35:18,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:18,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:18,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 189 transitions, 3074 flow [2022-12-06 05:35:18,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 189 transitions, 3074 flow [2022-12-06 05:35:18,542 INFO L130 PetriNetUnfolder]: 911/1700 cut-off events. [2022-12-06 05:35:18,542 INFO L131 PetriNetUnfolder]: For 17231/17536 co-relation queries the response was YES. [2022-12-06 05:35:18,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11950 conditions, 1700 events. 911/1700 cut-off events. For 17231/17536 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 10284 event pairs, 205 based on Foata normal form. 88/1685 useless extension candidates. Maximal degree in co-relation 11807. Up to 569 conditions per place. [2022-12-06 05:35:18,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 189 transitions, 3074 flow [2022-12-06 05:35:18,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-06 05:35:18,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] 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-06 05:35:18,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:18,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 05:35:18,630 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 188 transitions, 3070 flow [2022-12-06 05:35:18,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:18,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:18,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:18,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:35:18,630 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:18,631 INFO L85 PathProgramCache]: Analyzing trace with hash -551450685, now seen corresponding path program 1 times [2022-12-06 05:35:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:18,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609218623] [2022-12-06 05:35:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:19,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-06 05:35:19,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:19,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609218623] [2022-12-06 05:35:19,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609218623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:19,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233416955] [2022-12-06 05:35:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:19,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:19,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:19,587 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:35:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:19,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:35:19,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:19,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:19,757 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-06 05:35:19,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:19,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-06 05:35:20,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:20,002 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-06 05:35:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:20,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:20,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:20,589 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 547 treesize of output 489 [2022-12-06 05:35:20,601 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 456 treesize of output 432 [2022-12-06 05:35:20,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 390 [2022-12-06 05:35:20,621 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 390 treesize of output 354 [2022-12-06 05:35:20,626 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 354 treesize of output 330 [2022-12-06 05:35:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:21,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233416955] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:21,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:21,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 05:35:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021858954] [2022-12-06 05:35:21,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:35:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:35:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=319, Unknown=1, NotChecked=0, Total=380 [2022-12-06 05:35:21,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:35:21,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 188 transitions, 3070 flow. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:21,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:21,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:35:21,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:23,957 INFO L130 PetriNetUnfolder]: 2559/3791 cut-off events. [2022-12-06 05:35:23,958 INFO L131 PetriNetUnfolder]: For 43911/43911 co-relation queries the response was YES. [2022-12-06 05:35:23,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28882 conditions, 3791 events. 2559/3791 cut-off events. For 43911/43911 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 17940 event pairs, 362 based on Foata normal form. 1/3768 useless extension candidates. Maximal degree in co-relation 28666. Up to 2656 conditions per place. [2022-12-06 05:35:23,983 INFO L137 encePairwiseOnDemand]: 17/44 looper letters, 186 selfloop transitions, 117 changer transitions 46/349 dead transitions. [2022-12-06 05:35:23,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 349 transitions, 5567 flow [2022-12-06 05:35:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 05:35:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 05:35:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 187 transitions. [2022-12-06 05:35:23,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19318181818181818 [2022-12-06 05:35:23,985 INFO L175 Difference]: Start difference. First operand has 119 places, 188 transitions, 3070 flow. Second operand 22 states and 187 transitions. [2022-12-06 05:35:23,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 349 transitions, 5567 flow [2022-12-06 05:35:24,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 349 transitions, 5365 flow, removed 89 selfloop flow, removed 7 redundant places. [2022-12-06 05:35:24,074 INFO L231 Difference]: Finished difference. Result has 140 places, 220 transitions, 3787 flow [2022-12-06 05:35:24,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2941, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3787, PETRI_PLACES=140, PETRI_TRANSITIONS=220} [2022-12-06 05:35:24,074 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2022-12-06 05:35:24,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:24,075 INFO L89 Accepts]: Start accepts. Operand has 140 places, 220 transitions, 3787 flow [2022-12-06 05:35:24,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:24,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:24,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 220 transitions, 3787 flow [2022-12-06 05:35:24,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 220 transitions, 3787 flow [2022-12-06 05:35:24,267 INFO L130 PetriNetUnfolder]: 1049/1931 cut-off events. [2022-12-06 05:35:24,267 INFO L131 PetriNetUnfolder]: For 22766/23031 co-relation queries the response was YES. [2022-12-06 05:35:24,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14492 conditions, 1931 events. 1049/1931 cut-off events. For 22766/23031 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 11809 event pairs, 214 based on Foata normal form. 97/1925 useless extension candidates. Maximal degree in co-relation 13858. Up to 679 conditions per place. [2022-12-06 05:35:24,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 220 transitions, 3787 flow [2022-12-06 05:35:24,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-06 05:35:24,331 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 [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 (< v_~max1~0_57 .cse1))) (or (and .cse0 (= v_~max1~0_56 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~max1~0_57 v_~max1~0_56))))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~max1~0=v_~max1~0_57, ~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} OutVars{~max1~0=v_~max1~0_56, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 05:35:24,489 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 [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:35:24,621 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 [525] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse1 (< v_~max3~0_41 .cse0))) (or (and (= v_~max3~0_40 .cse0) .cse1) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~max3~0_41 v_~max3~0_40) (not .cse1))))) (= (+ 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, ~max3~0=v_~max3~0_41, 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} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, ~max3~0=v_~max3~0_40, 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|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8] [2022-12-06 05:35:24,683 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 [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 (< v_~max1~0_57 .cse1))) (or (and .cse0 (= v_~max1~0_56 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~max1~0_57 v_~max1~0_56))))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~max1~0=v_~max1~0_57, ~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} OutVars{~max1~0=v_~max1~0_56, ~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} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0] [2022-12-06 05:35:27,606 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:35:27,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3532 [2022-12-06 05:35:27,607 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 220 transitions, 3859 flow [2022-12-06 05:35:27,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:27,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:27,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:27,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 05:35:27,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:35:27,815 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:27,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1475806227, now seen corresponding path program 2 times [2022-12-06 05:35:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:27,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317475111] [2022-12-06 05:35:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:27,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317475111] [2022-12-06 05:35:27,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317475111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:27,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:27,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:35:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867576159] [2022-12-06 05:35:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:27,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:27,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:27,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:35:27,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 220 transitions, 3859 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:27,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:27,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:35:27,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:28,678 INFO L130 PetriNetUnfolder]: 2619/3902 cut-off events. [2022-12-06 05:35:28,678 INFO L131 PetriNetUnfolder]: For 50037/50037 co-relation queries the response was YES. [2022-12-06 05:35:28,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31019 conditions, 3902 events. 2619/3902 cut-off events. For 50037/50037 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 19021 event pairs, 450 based on Foata normal form. 4/3880 useless extension candidates. Maximal degree in co-relation 30404. Up to 1823 conditions per place. [2022-12-06 05:35:28,721 INFO L137 encePairwiseOnDemand]: 28/48 looper letters, 244 selfloop transitions, 111 changer transitions 2/357 dead transitions. [2022-12-06 05:35:28,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 357 transitions, 6402 flow [2022-12-06 05:35:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:35:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:35:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 05:35:28,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-06 05:35:28,723 INFO L175 Difference]: Start difference. First operand has 120 places, 220 transitions, 3859 flow. Second operand 6 states and 105 transitions. [2022-12-06 05:35:28,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 357 transitions, 6402 flow [2022-12-06 05:35:28,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 357 transitions, 5833 flow, removed 106 selfloop flow, removed 14 redundant places. [2022-12-06 05:35:28,974 INFO L231 Difference]: Finished difference. Result has 113 places, 242 transitions, 4106 flow [2022-12-06 05:35:28,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3493, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4106, PETRI_PLACES=113, PETRI_TRANSITIONS=242} [2022-12-06 05:35:28,975 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2022-12-06 05:35:28,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:28,975 INFO L89 Accepts]: Start accepts. Operand has 113 places, 242 transitions, 4106 flow [2022-12-06 05:35:28,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:28,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:28,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 242 transitions, 4106 flow [2022-12-06 05:35:28,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 242 transitions, 4106 flow [2022-12-06 05:35:29,158 INFO L130 PetriNetUnfolder]: 1143/2177 cut-off events. [2022-12-06 05:35:29,159 INFO L131 PetriNetUnfolder]: For 17965/18240 co-relation queries the response was YES. [2022-12-06 05:35:29,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14786 conditions, 2177 events. 1143/2177 cut-off events. For 17965/18240 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 14204 event pairs, 244 based on Foata normal form. 83/2152 useless extension candidates. Maximal degree in co-relation 14275. Up to 770 conditions per place. [2022-12-06 05:35:29,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 242 transitions, 4106 flow [2022-12-06 05:35:29,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 1258 [2022-12-06 05:35:29,184 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:29,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 05:35:29,184 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 242 transitions, 4106 flow [2022-12-06 05:35:29,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:29,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:29,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:29,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:35:29,185 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1648247765, now seen corresponding path program 1 times [2022-12-06 05:35:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:29,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585024893] [2022-12-06 05:35:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:29,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585024893] [2022-12-06 05:35:29,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585024893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:29,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:29,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:35:29,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984523383] [2022-12-06 05:35:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:29,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:29,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:35:29,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 242 transitions, 4106 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-06 05:35:29,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:29,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:35:29,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:30,147 INFO L130 PetriNetUnfolder]: 3051/4621 cut-off events. [2022-12-06 05:35:30,148 INFO L131 PetriNetUnfolder]: For 48390/48390 co-relation queries the response was YES. [2022-12-06 05:35:30,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34609 conditions, 4621 events. 3051/4621 cut-off events. For 48390/48390 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 23838 event pairs, 819 based on Foata normal form. 54/4639 useless extension candidates. Maximal degree in co-relation 34020. Up to 3477 conditions per place. [2022-12-06 05:35:30,179 INFO L137 encePairwiseOnDemand]: 26/47 looper letters, 266 selfloop transitions, 123 changer transitions 0/389 dead transitions. [2022-12-06 05:35:30,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 389 transitions, 6909 flow [2022-12-06 05:35:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:35:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:35:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2022-12-06 05:35:30,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3058510638297872 [2022-12-06 05:35:30,180 INFO L175 Difference]: Start difference. First operand has 111 places, 242 transitions, 4106 flow. Second operand 8 states and 115 transitions. [2022-12-06 05:35:30,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 389 transitions, 6909 flow [2022-12-06 05:35:30,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 389 transitions, 6719 flow, removed 49 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:30,259 INFO L231 Difference]: Finished difference. Result has 118 places, 295 transitions, 5320 flow [2022-12-06 05:35:30,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3959, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5320, PETRI_PLACES=118, PETRI_TRANSITIONS=295} [2022-12-06 05:35:30,260 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2022-12-06 05:35:30,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:30,260 INFO L89 Accepts]: Start accepts. Operand has 118 places, 295 transitions, 5320 flow [2022-12-06 05:35:30,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:30,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:30,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 295 transitions, 5320 flow [2022-12-06 05:35:30,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 295 transitions, 5320 flow [2022-12-06 05:35:30,502 INFO L130 PetriNetUnfolder]: 1395/2661 cut-off events. [2022-12-06 05:35:30,502 INFO L131 PetriNetUnfolder]: For 27049/27373 co-relation queries the response was YES. [2022-12-06 05:35:30,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19168 conditions, 2661 events. 1395/2661 cut-off events. For 27049/27373 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 18046 event pairs, 305 based on Foata normal form. 115/2658 useless extension candidates. Maximal degree in co-relation 18655. Up to 959 conditions per place. [2022-12-06 05:35:30,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 295 transitions, 5320 flow [2022-12-06 05:35:30,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 1470 [2022-12-06 05:35:30,535 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:30,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 05:35:30,536 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 295 transitions, 5320 flow [2022-12-06 05:35:30,536 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-06 05:35:30,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:30,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:30,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:35:30,536 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:30,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1501075055, now seen corresponding path program 2 times [2022-12-06 05:35:30,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:30,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732308630] [2022-12-06 05:35:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:30,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:30,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:30,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732308630] [2022-12-06 05:35:30,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732308630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:30,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:30,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:35:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026218704] [2022-12-06 05:35:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:30,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:30,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:35:30,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 295 transitions, 5320 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-06 05:35:30,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:30,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:35:30,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:31,556 INFO L130 PetriNetUnfolder]: 2997/4495 cut-off events. [2022-12-06 05:35:31,556 INFO L131 PetriNetUnfolder]: For 53542/53542 co-relation queries the response was YES. [2022-12-06 05:35:31,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35058 conditions, 4495 events. 2997/4495 cut-off events. For 53542/53542 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 22604 event pairs, 845 based on Foata normal form. 54/4513 useless extension candidates. Maximal degree in co-relation 34467. Up to 3477 conditions per place. [2022-12-06 05:35:31,602 INFO L137 encePairwiseOnDemand]: 26/47 looper letters, 230 selfloop transitions, 138 changer transitions 0/368 dead transitions. [2022-12-06 05:35:31,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 368 transitions, 6929 flow [2022-12-06 05:35:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 05:35:31,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3069908814589666 [2022-12-06 05:35:31,604 INFO L175 Difference]: Start difference. First operand has 118 places, 295 transitions, 5320 flow. Second operand 7 states and 101 transitions. [2022-12-06 05:35:31,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 368 transitions, 6929 flow [2022-12-06 05:35:31,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 368 transitions, 6608 flow, removed 85 selfloop flow, removed 5 redundant places. [2022-12-06 05:35:31,713 INFO L231 Difference]: Finished difference. Result has 121 places, 312 transitions, 5831 flow [2022-12-06 05:35:31,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4990, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5831, PETRI_PLACES=121, PETRI_TRANSITIONS=312} [2022-12-06 05:35:31,714 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2022-12-06 05:35:31,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:31,714 INFO L89 Accepts]: Start accepts. Operand has 121 places, 312 transitions, 5831 flow [2022-12-06 05:35:31,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:31,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:31,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 312 transitions, 5831 flow [2022-12-06 05:35:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 312 transitions, 5831 flow [2022-12-06 05:35:31,962 INFO L130 PetriNetUnfolder]: 1353/2555 cut-off events. [2022-12-06 05:35:31,962 INFO L131 PetriNetUnfolder]: For 26527/26842 co-relation queries the response was YES. [2022-12-06 05:35:31,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19032 conditions, 2555 events. 1353/2555 cut-off events. For 26527/26842 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 16934 event pairs, 267 based on Foata normal form. 104/2548 useless extension candidates. Maximal degree in co-relation 18426. Up to 928 conditions per place. [2022-12-06 05:35:31,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 312 transitions, 5831 flow [2022-12-06 05:35:31,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 1520 [2022-12-06 05:35:31,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:31,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 05:35:31,993 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 312 transitions, 5831 flow [2022-12-06 05:35:31,993 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-06 05:35:31,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:31,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:31,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:35:31,994 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:31,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2103148350, now seen corresponding path program 1 times [2022-12-06 05:35:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390780291] [2022-12-06 05:35:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:32,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390780291] [2022-12-06 05:35:32,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390780291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:32,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:32,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:35:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742159465] [2022-12-06 05:35:32,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:32,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:32,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:35:32,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 312 transitions, 5831 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:32,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:32,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:35:32,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:32,886 INFO L130 PetriNetUnfolder]: 3127/4745 cut-off events. [2022-12-06 05:35:32,886 INFO L131 PetriNetUnfolder]: For 57902/57902 co-relation queries the response was YES. [2022-12-06 05:35:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37460 conditions, 4745 events. 3127/4745 cut-off events. For 57902/57902 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 24503 event pairs, 527 based on Foata normal form. 4/4713 useless extension candidates. Maximal degree in co-relation 36869. Up to 1634 conditions per place. [2022-12-06 05:35:32,924 INFO L137 encePairwiseOnDemand]: 28/47 looper letters, 263 selfloop transitions, 203 changer transitions 0/466 dead transitions. [2022-12-06 05:35:32,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 466 transitions, 8709 flow [2022-12-06 05:35:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:35:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:35:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2022-12-06 05:35:32,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35638297872340424 [2022-12-06 05:35:32,926 INFO L175 Difference]: Start difference. First operand has 121 places, 312 transitions, 5831 flow. Second operand 8 states and 134 transitions. [2022-12-06 05:35:32,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 466 transitions, 8709 flow [2022-12-06 05:35:33,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 466 transitions, 8270 flow, removed 128 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:33,058 INFO L231 Difference]: Finished difference. Result has 127 places, 354 transitions, 6889 flow [2022-12-06 05:35:33,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5424, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6889, PETRI_PLACES=127, PETRI_TRANSITIONS=354} [2022-12-06 05:35:33,059 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2022-12-06 05:35:33,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:33,059 INFO L89 Accepts]: Start accepts. Operand has 127 places, 354 transitions, 6889 flow [2022-12-06 05:35:33,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:33,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:33,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 354 transitions, 6889 flow [2022-12-06 05:35:33,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 354 transitions, 6889 flow [2022-12-06 05:35:33,303 INFO L130 PetriNetUnfolder]: 1357/2642 cut-off events. [2022-12-06 05:35:33,304 INFO L131 PetriNetUnfolder]: For 27847/28224 co-relation queries the response was YES. [2022-12-06 05:35:33,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19356 conditions, 2642 events. 1357/2642 cut-off events. For 27847/28224 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 18138 event pairs, 319 based on Foata normal form. 121/2635 useless extension candidates. Maximal degree in co-relation 18840. Up to 898 conditions per place. [2022-12-06 05:35:33,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 354 transitions, 6889 flow [2022-12-06 05:35:33,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-06 05:35:33,338 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:33,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 05:35:33,338 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 354 transitions, 6889 flow [2022-12-06 05:35:33,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:33,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:33,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:33,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:35:33,339 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 510459410, now seen corresponding path program 2 times [2022-12-06 05:35:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:33,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575013957] [2022-12-06 05:35:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:33,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575013957] [2022-12-06 05:35:33,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575013957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:33,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:33,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:35:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345502263] [2022-12-06 05:35:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:33,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:33,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:33,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:35:33,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 354 transitions, 6889 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:33,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:33,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:35:33,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:34,128 INFO L130 PetriNetUnfolder]: 3119/4737 cut-off events. [2022-12-06 05:35:34,128 INFO L131 PetriNetUnfolder]: For 59572/59572 co-relation queries the response was YES. [2022-12-06 05:35:34,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38256 conditions, 4737 events. 3119/4737 cut-off events. For 59572/59572 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 24806 event pairs, 430 based on Foata normal form. 4/4709 useless extension candidates. Maximal degree in co-relation 37658. Up to 1943 conditions per place. [2022-12-06 05:35:34,165 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 318 selfloop transitions, 188 changer transitions 0/506 dead transitions. [2022-12-06 05:35:34,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 506 transitions, 9823 flow [2022-12-06 05:35:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-06 05:35:34,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3829787234042553 [2022-12-06 05:35:34,166 INFO L175 Difference]: Start difference. First operand has 127 places, 354 transitions, 6889 flow. Second operand 7 states and 126 transitions. [2022-12-06 05:35:34,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 506 transitions, 9823 flow [2022-12-06 05:35:34,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 506 transitions, 9434 flow, removed 101 selfloop flow, removed 4 redundant places. [2022-12-06 05:35:34,392 INFO L231 Difference]: Finished difference. Result has 131 places, 376 transitions, 7425 flow [2022-12-06 05:35:34,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6566, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7425, PETRI_PLACES=131, PETRI_TRANSITIONS=376} [2022-12-06 05:35:34,393 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2022-12-06 05:35:34,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:34,393 INFO L89 Accepts]: Start accepts. Operand has 131 places, 376 transitions, 7425 flow [2022-12-06 05:35:34,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:34,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:34,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 376 transitions, 7425 flow [2022-12-06 05:35:34,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 376 transitions, 7425 flow [2022-12-06 05:35:34,642 INFO L130 PetriNetUnfolder]: 1386/2669 cut-off events. [2022-12-06 05:35:34,642 INFO L131 PetriNetUnfolder]: For 28798/29297 co-relation queries the response was YES. [2022-12-06 05:35:34,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19826 conditions, 2669 events. 1386/2669 cut-off events. For 28798/29297 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 18219 event pairs, 313 based on Foata normal form. 138/2688 useless extension candidates. Maximal degree in co-relation 19328. Up to 936 conditions per place. [2022-12-06 05:35:34,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 376 transitions, 7425 flow [2022-12-06 05:35:34,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 05:35:34,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:34,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 05:35:34,679 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 376 transitions, 7425 flow [2022-12-06 05:35:34,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:34,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:34,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:34,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:35:34,679 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-06 05:35:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 144885687, now seen corresponding path program 1 times [2022-12-06 05:35:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:34,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061416672] [2022-12-06 05:35:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:34,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:34,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061416672] [2022-12-06 05:35:34,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061416672] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:34,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676379421] [2022-12-06 05:35:34,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:34,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:34,768 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:34,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:35:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:34,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:35:34,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:34,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:34,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676379421] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:34,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:34,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:35:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207641478] [2022-12-06 05:35:34,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:34,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:35:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:34,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:35:34,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:35:34,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:35:34,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 376 transitions, 7425 flow. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:34,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:34,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:35:34,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:35,856 INFO L130 PetriNetUnfolder]: 3119/4749 cut-off events. [2022-12-06 05:35:35,856 INFO L131 PetriNetUnfolder]: For 59550/59550 co-relation queries the response was YES. [2022-12-06 05:35:35,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38403 conditions, 4749 events. 3119/4749 cut-off events. For 59550/59550 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25026 event pairs, 414 based on Foata normal form. 48/4765 useless extension candidates. Maximal degree in co-relation 37799. Up to 1943 conditions per place. [2022-12-06 05:35:35,900 INFO L137 encePairwiseOnDemand]: 22/47 looper letters, 281 selfloop transitions, 206 changer transitions 0/487 dead transitions. [2022-12-06 05:35:35,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 487 transitions, 9639 flow [2022-12-06 05:35:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:35:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:35:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 05:35:35,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32180851063829785 [2022-12-06 05:35:35,902 INFO L175 Difference]: Start difference. First operand has 131 places, 376 transitions, 7425 flow. Second operand 8 states and 121 transitions. [2022-12-06 05:35:35,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 487 transitions, 9639 flow [2022-12-06 05:35:36,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 487 transitions, 9461 flow, removed 67 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:36,059 INFO L231 Difference]: Finished difference. Result has 139 places, 389 transitions, 8070 flow [2022-12-06 05:35:36,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7255, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8070, PETRI_PLACES=139, PETRI_TRANSITIONS=389} [2022-12-06 05:35:36,060 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2022-12-06 05:35:36,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:36,060 INFO L89 Accepts]: Start accepts. Operand has 139 places, 389 transitions, 8070 flow [2022-12-06 05:35:36,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:36,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:36,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 389 transitions, 8070 flow [2022-12-06 05:35:36,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 389 transitions, 8070 flow [2022-12-06 05:35:36,386 INFO L130 PetriNetUnfolder]: 1413/2714 cut-off events. [2022-12-06 05:35:36,386 INFO L131 PetriNetUnfolder]: For 33570/34044 co-relation queries the response was YES. [2022-12-06 05:35:36,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21238 conditions, 2714 events. 1413/2714 cut-off events. For 33570/34044 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 18589 event pairs, 304 based on Foata normal form. 149/2746 useless extension candidates. Maximal degree in co-relation 20730. Up to 958 conditions per place. [2022-12-06 05:35:36,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 389 transitions, 8070 flow [2022-12-06 05:35:36,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 1810 [2022-12-06 05:35:36,479 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:36,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-06 05:35:36,480 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 389 transitions, 8070 flow [2022-12-06 05:35:36,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:36,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:36,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:36,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:36,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:36,691 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-06 05:35:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 152927080, now seen corresponding path program 1 times [2022-12-06 05:35:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:36,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841427175] [2022-12-06 05:35:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:37,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841427175] [2022-12-06 05:35:37,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841427175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:37,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094023030] [2022-12-06 05:35:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:37,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:37,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:37,730 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:35:37,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:35:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:37,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:35:37,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:38,130 INFO L321 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-12-06 05:35:38,131 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 157 treesize of output 127 [2022-12-06 05:35:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:38,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:38,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:38,885 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 288 treesize of output 172 [2022-12-06 05:35:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:35:39,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094023030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:39,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:39,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 5] total 15 [2022-12-06 05:35:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795740613] [2022-12-06 05:35:39,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:39,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:35:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:35:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:35:39,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:35:39,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 389 transitions, 8070 flow. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:39,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:39,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:35:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:41,706 INFO L130 PetriNetUnfolder]: 3736/5800 cut-off events. [2022-12-06 05:35:41,707 INFO L131 PetriNetUnfolder]: For 85434/85434 co-relation queries the response was YES. [2022-12-06 05:35:41,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47764 conditions, 5800 events. 3736/5800 cut-off events. For 85434/85434 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 33034 event pairs, 488 based on Foata normal form. 2/5770 useless extension candidates. Maximal degree in co-relation 46446. Up to 3451 conditions per place. [2022-12-06 05:35:41,747 INFO L137 encePairwiseOnDemand]: 23/47 looper letters, 330 selfloop transitions, 211 changer transitions 14/555 dead transitions. [2022-12-06 05:35:41,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 555 transitions, 11333 flow [2022-12-06 05:35:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:35:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:35:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 175 transitions. [2022-12-06 05:35:41,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26595744680851063 [2022-12-06 05:35:41,750 INFO L175 Difference]: Start difference. First operand has 139 places, 389 transitions, 8070 flow. Second operand 14 states and 175 transitions. [2022-12-06 05:35:41,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 555 transitions, 11333 flow [2022-12-06 05:35:41,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 555 transitions, 10673 flow, removed 135 selfloop flow, removed 5 redundant places. [2022-12-06 05:35:41,925 INFO L231 Difference]: Finished difference. Result has 152 places, 443 transitions, 9113 flow [2022-12-06 05:35:41,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7519, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9113, PETRI_PLACES=152, PETRI_TRANSITIONS=443} [2022-12-06 05:35:41,925 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2022-12-06 05:35:41,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:41,925 INFO L89 Accepts]: Start accepts. Operand has 152 places, 443 transitions, 9113 flow [2022-12-06 05:35:41,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:41,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:41,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 443 transitions, 9113 flow [2022-12-06 05:35:41,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 443 transitions, 9113 flow [2022-12-06 05:35:42,267 INFO L130 PetriNetUnfolder]: 1673/3313 cut-off events. [2022-12-06 05:35:42,267 INFO L131 PetriNetUnfolder]: For 42830/43361 co-relation queries the response was YES. [2022-12-06 05:35:42,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25313 conditions, 3313 events. 1673/3313 cut-off events. For 42830/43361 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 24481 event pairs, 360 based on Foata normal form. 196/3377 useless extension candidates. Maximal degree in co-relation 25176. Up to 1086 conditions per place. [2022-12-06 05:35:42,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 443 transitions, 9113 flow [2022-12-06 05:35:42,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 2202 [2022-12-06 05:35:42,322 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:42,322 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:42,502 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:42,502 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:35:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:35:42,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 05:35:42,704 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~mem6_83 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:35:42,706 INFO L158 Benchmark]: Toolchain (without parser) took 90893.79ms. Allocated memory was 199.2MB in the beginning and 993.0MB in the end (delta: 793.8MB). Free memory was 158.0MB in the beginning and 404.5MB in the end (delta: -246.5MB). Peak memory consumption was 548.1MB. Max. memory is 8.0GB. [2022-12-06 05:35:42,707 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 176.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:35:42,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.87ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 146.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:35:42,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.37ms. Allocated memory is still 199.2MB. Free memory was 145.4MB in the beginning and 143.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:35:42,707 INFO L158 Benchmark]: Boogie Preprocessor took 49.33ms. Allocated memory is still 199.2MB. Free memory was 143.9MB in the beginning and 142.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:35:42,707 INFO L158 Benchmark]: RCFGBuilder took 604.59ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 121.8MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 05:35:42,708 INFO L158 Benchmark]: TraceAbstraction took 89925.95ms. Allocated memory was 199.2MB in the beginning and 993.0MB in the end (delta: 793.8MB). Free memory was 120.8MB in the beginning and 404.5MB in the end (delta: -283.7MB). Peak memory consumption was 511.4MB. Max. memory is 8.0GB. [2022-12-06 05:35:42,709 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.13ms. Allocated memory is still 199.2MB. Free memory is still 176.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.87ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 146.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.37ms. Allocated memory is still 199.2MB. Free memory was 145.4MB in the beginning and 143.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.33ms. Allocated memory is still 199.2MB. Free memory was 143.9MB in the beginning and 142.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.59ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 121.8MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 89925.95ms. Allocated memory was 199.2MB in the beginning and 993.0MB in the end (delta: 793.8MB). Free memory was 120.8MB in the beginning and 404.5MB in the end (delta: -283.7MB). Peak memory consumption was 511.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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.3s, 45 PlacesBefore, 44 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 404 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.8s, 81 PlacesBefore, 79 PlacesAfterwards, 153 TransitionsBefore, 150 TransitionsAfterwards, 806 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 47, Positive unconditional cache size: 17, 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.4s, 80 PlacesBefore, 80 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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): 64, Positive cache size: 64, Positive conditional cache size: 47, Positive unconditional cache size: 17, 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, 77 PlacesBefore, 77 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 696 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): 64, Positive cache size: 64, Positive conditional cache size: 47, Positive unconditional cache size: 17, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 86 PlacesBefore, 86 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, 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: 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: 29, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 73, Positive conditional cache size: 52, Positive unconditional cache size: 21, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 99 PlacesBefore, 99 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 106, independent conditional: 92, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 92, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 12, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 89, independent conditional: 80, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 284, Positive conditional cache size: 256, Positive unconditional cache size: 28, 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: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 94 PlacesBefore, 93 PlacesAfterwards, 115 TransitionsBefore, 114 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 286, Positive conditional cache size: 258, Positive unconditional cache size: 28, 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.5s, 101 PlacesBefore, 100 PlacesAfterwards, 151 TransitionsBefore, 150 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 25, independent conditional: 16, 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: 25, independent: 25, independent conditional: 16, 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: 0, 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: 25, independent: 25, independent conditional: 16, independent unconditional: 9, 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): 287, Positive cache size: 287, Positive conditional cache size: 259, Positive unconditional cache size: 28, 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, 104 PlacesBefore, 104 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 884 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): 287, Positive cache size: 287, Positive conditional cache size: 259, Positive unconditional cache size: 28, 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, 101 PlacesBefore, 101 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 824 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): 287, Positive cache size: 287, Positive conditional cache size: 259, Positive unconditional cache size: 28, 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, 117 PlacesBefore, 116 PlacesAfterwards, 172 TransitionsBefore, 171 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 289, Positive conditional cache size: 261, Positive unconditional cache size: 28, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 120 PlacesBefore, 119 PlacesAfterwards, 189 TransitionsBefore, 188 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 291, Positive conditional cache size: 262, Positive unconditional cache size: 29, 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: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 120 PlacesBefore, 120 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 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: 8, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 1258 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): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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, 118 PlacesBefore, 118 PlacesAfterwards, 295 TransitionsBefore, 295 TransitionsAfterwards, 1470 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): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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, 121 PlacesBefore, 121 PlacesAfterwards, 312 TransitionsBefore, 312 TransitionsAfterwards, 1520 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): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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, 127 PlacesBefore, 127 PlacesAfterwards, 354 TransitionsBefore, 354 TransitionsAfterwards, 1692 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): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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, 131 PlacesBefore, 131 PlacesAfterwards, 376 TransitionsBefore, 376 TransitionsAfterwards, 1758 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): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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, 139 PlacesBefore, 139 PlacesAfterwards, 389 TransitionsBefore, 389 TransitionsAfterwards, 1810 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): 297, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, 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 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~mem6_83 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~mem6_83 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:35:42,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...