/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/chl-chromosome-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:04:24,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:04:24,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:04:24,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:04:24,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:04:24,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:04:24,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:04:24,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:04:24,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:04:24,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:04:24,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:04:24,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:04:24,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:04:24,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:04:24,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:04:24,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:04:24,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:04:24,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:04:24,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:04:24,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:04:24,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:04:24,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:04:24,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:04:24,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:04:24,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:04:24,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:04:24,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:04:24,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:04:24,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:04:24,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:04:24,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:04:24,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:04:24,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:04:24,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:04:24,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:04:24,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:04:24,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:04:24,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:04:24,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:04:24,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:04:24,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:04:24,809 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:04:24,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:04:24,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:04:24,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:04:24,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:04:24,840 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:04:24,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:04:24,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:04:24,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:04:24,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:04:24,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:04:24,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:04:24,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:04:24,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:04:24,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:04:24,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:04:24,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:04:24,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:04:24,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:04:24,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:04:24,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:04:24,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:04:24,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:04:24,844 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:04:25,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:04:25,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:04:25,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:04:25,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:04:25,178 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:04:25,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2022-12-06 05:04:26,312 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:04:26,505 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:04:26,506 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2022-12-06 05:04:26,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6280e1c4e/df92e95507914e9799abd6f0d9422e1a/FLAG87c404998 [2022-12-06 05:04:26,531 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6280e1c4e/df92e95507914e9799abd6f0d9422e1a [2022-12-06 05:04:26,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:04:26,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:04:26,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:04:26,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:04:26,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:04:26,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363ba7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26, skipping insertion in model container [2022-12-06 05:04:26,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:04:26,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:04:26,759 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/chl-chromosome-trans.wvr.c[3034,3047] [2022-12-06 05:04:26,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:04:26,775 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:04:26,811 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/chl-chromosome-trans.wvr.c[3034,3047] [2022-12-06 05:04:26,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:04:26,830 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:04:26,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26 WrapperNode [2022-12-06 05:04:26,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:04:26,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:04:26,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:04:26,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:04:26,838 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:04:26" (1/1) ... [2022-12-06 05:04:26,857 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:04:26" (1/1) ... [2022-12-06 05:04:26,893 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 271 [2022-12-06 05:04:26,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:04:26,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:04:26,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:04:26,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:04:26,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,943 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:04:26,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:04:26,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:04:26,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:04:26,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (1/1) ... [2022-12-06 05:04:26,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:04:26,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:26,984 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:04:27,008 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:04:27,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:04:27,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:04:27,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:04:27,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:04:27,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:04:27,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:04:27,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:04:27,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:04:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:04:27,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:04:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:04:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:04:27,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:04:27,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:04:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:04:27,034 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:04:27,125 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:04:27,126 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:04:27,571 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:04:27,598 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:04:27,598 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:04:27,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:04:27 BoogieIcfgContainer [2022-12-06 05:04:27,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:04:27,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:04:27,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:04:27,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:04:27,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:04:26" (1/3) ... [2022-12-06 05:04:27,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da486f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:04:27, skipping insertion in model container [2022-12-06 05:04:27,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:26" (2/3) ... [2022-12-06 05:04:27,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da486f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:04:27, skipping insertion in model container [2022-12-06 05:04:27,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:04:27" (3/3) ... [2022-12-06 05:04:27,607 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2022-12-06 05:04:27,636 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:04:27,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:04:27,637 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:04:27,759 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:04:27,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 312 transitions, 648 flow [2022-12-06 05:04:27,909 INFO L130 PetriNetUnfolder]: 28/309 cut-off events. [2022-12-06 05:04:27,909 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:27,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 309 events. 28/309 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 479 event pairs, 0 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 238. Up to 2 conditions per place. [2022-12-06 05:04:27,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 312 transitions, 648 flow [2022-12-06 05:04:27,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 299 transitions, 616 flow [2022-12-06 05:04:27,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:27,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 299 transitions, 616 flow [2022-12-06 05:04:27,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 299 transitions, 616 flow [2022-12-06 05:04:28,030 INFO L130 PetriNetUnfolder]: 28/299 cut-off events. [2022-12-06 05:04:28,030 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:28,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 28/299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 477 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 238. Up to 2 conditions per place. [2022-12-06 05:04:28,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 299 transitions, 616 flow [2022-12-06 05:04:28,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 15390 [2022-12-06 05:04:37,798 INFO L203 LiptonReduction]: Total number of compositions: 269 [2022-12-06 05:04:37,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:04:37,814 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;@2765f5f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:04:37,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:04:37,830 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 05:04:37,831 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:37,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:37,832 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, 1] [2022-12-06 05:04:37,832 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:04:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1502034649, now seen corresponding path program 1 times [2022-12-06 05:04:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748500624] [2022-12-06 05:04:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:38,246 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:04:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:38,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748500624] [2022-12-06 05:04:38,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748500624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:38,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:38,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:04:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009695191] [2022-12-06 05:04:38,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:38,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:04:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:38,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:04:38,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:04:38,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:04:38,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:38,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:38,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:04:38,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:38,410 INFO L130 PetriNetUnfolder]: 370/545 cut-off events. [2022-12-06 05:04:38,410 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 05:04:38,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 545 events. 370/545 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1540 event pairs, 253 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 936. Up to 543 conditions per place. [2022-12-06 05:04:38,414 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-06 05:04:38,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 150 flow [2022-12-06 05:04:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:04:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:04:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 05:04:38,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:04:38,425 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 3 states and 36 transitions. [2022-12-06 05:04:38,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 150 flow [2022-12-06 05:04:38,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:04:38,429 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 98 flow [2022-12-06 05:04:38,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2022-12-06 05:04:38,434 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 05:04:38,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:38,435 INFO L89 Accepts]: Start accepts. Operand has 31 places, 33 transitions, 98 flow [2022-12-06 05:04:38,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:38,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:38,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 33 transitions, 98 flow [2022-12-06 05:04:38,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 33 transitions, 98 flow [2022-12-06 05:04:38,445 INFO L130 PetriNetUnfolder]: 6/33 cut-off events. [2022-12-06 05:04:38,445 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:04:38,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 33 events. 6/33 cut-off events. For 0/0 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/29 useless extension candidates. Maximal degree in co-relation 30. Up to 8 conditions per place. [2022-12-06 05:04:38,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 33 transitions, 98 flow [2022-12-06 05:04:38,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 05:04:38,456 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:38,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:04:38,458 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 98 flow [2022-12-06 05:04:38,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:38,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:38,458 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, 1, 1, 1, 1] [2022-12-06 05:04:38,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:04:38,459 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:04:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 145490352, now seen corresponding path program 1 times [2022-12-06 05:04:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:38,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526550599] [2022-12-06 05:04:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:04:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:38,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526550599] [2022-12-06 05:04:38,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526550599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:38,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285874255] [2022-12-06 05:04:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:38,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:38,627 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:04:38,660 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:04:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:38,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:04:38,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:04:38,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:04:38,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285874255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:38,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:38,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 05:04:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835604197] [2022-12-06 05:04:38,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:38,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:04:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:38,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:04:38,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:04:38,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:04:38,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 98 flow. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:04:38,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:38,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:04:38,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:39,031 INFO L130 PetriNetUnfolder]: 370/554 cut-off events. [2022-12-06 05:04:39,031 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:04:39,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 554 events. 370/554 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1540 event pairs, 253 based on Foata normal form. 6/445 useless extension candidates. Maximal degree in co-relation 1106. Up to 543 conditions per place. [2022-12-06 05:04:39,035 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 27 selfloop transitions, 15 changer transitions 0/42 dead transitions. [2022-12-06 05:04:39,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 218 flow [2022-12-06 05:04:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:04:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:04:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 05:04:39,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 05:04:39,037 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 98 flow. Second operand 6 states and 51 transitions. [2022-12-06 05:04:39,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 218 flow [2022-12-06 05:04:39,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:39,039 INFO L231 Difference]: Finished difference. Result has 38 places, 42 transitions, 188 flow [2022-12-06 05:04:39,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=38, PETRI_TRANSITIONS=42} [2022-12-06 05:04:39,040 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 05:04:39,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:39,040 INFO L89 Accepts]: Start accepts. Operand has 38 places, 42 transitions, 188 flow [2022-12-06 05:04:39,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:39,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:39,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 42 transitions, 188 flow [2022-12-06 05:04:39,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 188 flow [2022-12-06 05:04:39,049 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-06 05:04:39,049 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:04:39,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 42 events. 6/42 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/37 useless extension candidates. Maximal degree in co-relation 31. Up to 17 conditions per place. [2022-12-06 05:04:39,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 188 flow [2022-12-06 05:04:39,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 05:04:39,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:39,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:04:39,058 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 42 transitions, 188 flow [2022-12-06 05:04:39,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:04:39,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:39,058 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:39,072 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:04:39,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:39,266 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:04:39,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1480269539, now seen corresponding path program 2 times [2022-12-06 05:04:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:39,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731219068] [2022-12-06 05:04:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:39,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:04:39,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731219068] [2022-12-06 05:04:39,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731219068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:39,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115113784] [2022-12-06 05:04:39,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:04:39,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:39,492 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:04:39,520 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:04:39,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:04:39,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:04:39,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:04:39,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:04:39,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:04:39,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115113784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:39,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:04:39,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-12-06 05:04:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715722280] [2022-12-06 05:04:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:39,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:39,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:04:39,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:04:39,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 42 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:39,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:39,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:04:39,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:39,950 INFO L130 PetriNetUnfolder]: 644/962 cut-off events. [2022-12-06 05:04:39,950 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:04:39,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 962 events. 644/962 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3469 event pairs, 253 based on Foata normal form. 14/762 useless extension candidates. Maximal degree in co-relation 1928. Up to 555 conditions per place. [2022-12-06 05:04:39,956 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 69 selfloop transitions, 3 changer transitions 2/74 dead transitions. [2022-12-06 05:04:39,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 407 flow [2022-12-06 05:04:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 05:04:39,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 05:04:39,959 INFO L175 Difference]: Start difference. First operand has 38 places, 42 transitions, 188 flow. Second operand 4 states and 63 transitions. [2022-12-06 05:04:39,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 407 flow [2022-12-06 05:04:39,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 74 transitions, 383 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:39,964 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 184 flow [2022-12-06 05:04:39,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 05:04:39,965 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 05:04:39,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:39,965 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 184 flow [2022-12-06 05:04:39,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:39,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:39,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 184 flow [2022-12-06 05:04:39,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 184 flow [2022-12-06 05:04:39,978 INFO L130 PetriNetUnfolder]: 6/54 cut-off events. [2022-12-06 05:04:39,978 INFO L131 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2022-12-06 05:04:39,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 54 events. 6/54 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 81. Up to 8 conditions per place. [2022-12-06 05:04:39,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 184 flow [2022-12-06 05:04:39,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 05:04:40,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:04:40,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 05:04:40,102 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 185 flow [2022-12-06 05:04:40,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:40,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:40,102 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:04:40,111 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:04:40,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 05:04:40,309 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:04:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash 407498846, now seen corresponding path program 1 times [2022-12-06 05:04:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:40,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37995290] [2022-12-06 05:04:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:04:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:40,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37995290] [2022-12-06 05:04:40,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37995290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:40,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537118547] [2022-12-06 05:04:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:40,455 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:04:40,458 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:04:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:40,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:04:40,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:04:40,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:04:40,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537118547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:40,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:40,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 05:04:40,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959133494] [2022-12-06 05:04:40,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:40,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:04:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:04:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:04:40,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:04:40,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 185 flow. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 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:04:40,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:40,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:04:40,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:40,899 INFO L130 PetriNetUnfolder]: 644/965 cut-off events. [2022-12-06 05:04:40,899 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-06 05:04:40,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 965 events. 644/965 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3185 event pairs, 463 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 2220. Up to 951 conditions per place. [2022-12-06 05:04:40,905 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 29 selfloop transitions, 18 changer transitions 0/47 dead transitions. [2022-12-06 05:04:40,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 297 flow [2022-12-06 05:04:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:04:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:04:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-12-06 05:04:40,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22580645161290322 [2022-12-06 05:04:40,907 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 185 flow. Second operand 7 states and 49 transitions. [2022-12-06 05:04:40,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 297 flow [2022-12-06 05:04:40,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 292 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:40,912 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 248 flow [2022-12-06 05:04:40,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2022-12-06 05:04:40,913 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-06 05:04:40,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:40,914 INFO L89 Accepts]: Start accepts. Operand has 48 places, 47 transitions, 248 flow [2022-12-06 05:04:40,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:40,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:40,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 248 flow [2022-12-06 05:04:40,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 248 flow [2022-12-06 05:04:40,925 INFO L130 PetriNetUnfolder]: 6/57 cut-off events. [2022-12-06 05:04:40,925 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:40,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 57 events. 6/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 119. Up to 11 conditions per place. [2022-12-06 05:04:40,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 248 flow [2022-12-06 05:04:40,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 05:04:40,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:40,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:04:40,930 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 248 flow [2022-12-06 05:04:40,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 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:04:40,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:40,930 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:40,942 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:04:41,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:41,139 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:04:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash -35010567, now seen corresponding path program 2 times [2022-12-06 05:04:41,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:41,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405838551] [2022-12-06 05:04:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:41,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405838551] [2022-12-06 05:04:41,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405838551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:41,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:41,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:04:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846951485] [2022-12-06 05:04:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:41,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:41,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:41,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:04:41,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 248 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:41,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:41,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:04:41,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:41,710 INFO L130 PetriNetUnfolder]: 988/1463 cut-off events. [2022-12-06 05:04:41,710 INFO L131 PetriNetUnfolder]: For 342/342 co-relation queries the response was YES. [2022-12-06 05:04:41,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3373 conditions, 1463 events. 988/1463 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5483 event pairs, 463 based on Foata normal form. 2/1209 useless extension candidates. Maximal degree in co-relation 3262. Up to 966 conditions per place. [2022-12-06 05:04:41,717 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 61 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2022-12-06 05:04:41,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 429 flow [2022-12-06 05:04:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:04:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:04:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 05:04:41,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2022-12-06 05:04:41,719 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 248 flow. Second operand 3 states and 49 transitions. [2022-12-06 05:04:41,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 429 flow [2022-12-06 05:04:41,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 393 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:04:41,721 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 224 flow [2022-12-06 05:04:41,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2022-12-06 05:04:41,723 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-06 05:04:41,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:41,724 INFO L89 Accepts]: Start accepts. Operand has 47 places, 48 transitions, 224 flow [2022-12-06 05:04:41,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:41,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:41,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 48 transitions, 224 flow [2022-12-06 05:04:41,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 48 transitions, 224 flow [2022-12-06 05:04:41,733 INFO L130 PetriNetUnfolder]: 6/61 cut-off events. [2022-12-06 05:04:41,733 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:04:41,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 61 events. 6/61 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 110. Up to 8 conditions per place. [2022-12-06 05:04:41,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 48 transitions, 224 flow [2022-12-06 05:04:41,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 05:04:41,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:04:41,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 05:04:41,975 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 220 flow [2022-12-06 05:04:41,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:41,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:41,976 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:41,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:04:41,976 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:04:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash 790319475, now seen corresponding path program 1 times [2022-12-06 05:04:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099989038] [2022-12-06 05:04:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099989038] [2022-12-06 05:04:42,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099989038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:42,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:42,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:04:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641505892] [2022-12-06 05:04:42,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:42,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:42,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:04:42,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:42,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:42,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:04:42,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:42,569 INFO L130 PetriNetUnfolder]: 1105/1646 cut-off events. [2022-12-06 05:04:42,569 INFO L131 PetriNetUnfolder]: For 844/844 co-relation queries the response was YES. [2022-12-06 05:04:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1646 events. 1105/1646 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6568 event pairs, 477 based on Foata normal form. 22/1532 useless extension candidates. Maximal degree in co-relation 4023. Up to 980 conditions per place. [2022-12-06 05:04:42,579 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 76 selfloop transitions, 3 changer transitions 2/81 dead transitions. [2022-12-06 05:04:42,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 486 flow [2022-12-06 05:04:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 05:04:42,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2022-12-06 05:04:42,582 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 220 flow. Second operand 4 states and 64 transitions. [2022-12-06 05:04:42,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 486 flow [2022-12-06 05:04:42,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 468 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 05:04:42,588 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 232 flow [2022-12-06 05:04:42,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2022-12-06 05:04:42,590 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-06 05:04:42,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:42,590 INFO L89 Accepts]: Start accepts. Operand has 49 places, 49 transitions, 232 flow [2022-12-06 05:04:42,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:42,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:42,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 232 flow [2022-12-06 05:04:42,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 232 flow [2022-12-06 05:04:42,603 INFO L130 PetriNetUnfolder]: 6/73 cut-off events. [2022-12-06 05:04:42,603 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 05:04:42,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 73 events. 6/73 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-12-06 05:04:42,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 232 flow [2022-12-06 05:04:42,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 05:04:42,608 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:42,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:04:42,611 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 232 flow [2022-12-06 05:04:42,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:42,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:42,611 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:42,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:04:42,611 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:04:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1981733733, now seen corresponding path program 2 times [2022-12-06 05:04:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425511513] [2022-12-06 05:04:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:42,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425511513] [2022-12-06 05:04:42,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425511513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:42,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:42,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:04:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632906006] [2022-12-06 05:04:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:42,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:42,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:04:42,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:42,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:42,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:04:42,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:43,213 INFO L130 PetriNetUnfolder]: 1277/1890 cut-off events. [2022-12-06 05:04:43,214 INFO L131 PetriNetUnfolder]: For 1090/1090 co-relation queries the response was YES. [2022-12-06 05:04:43,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4931 conditions, 1890 events. 1277/1890 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7639 event pairs, 348 based on Foata normal form. 36/1756 useless extension candidates. Maximal degree in co-relation 4835. Up to 1027 conditions per place. [2022-12-06 05:04:43,223 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 73 selfloop transitions, 5 changer transitions 1/79 dead transitions. [2022-12-06 05:04:43,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 492 flow [2022-12-06 05:04:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 05:04:43,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2022-12-06 05:04:43,224 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 232 flow. Second operand 4 states and 58 transitions. [2022-12-06 05:04:43,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 492 flow [2022-12-06 05:04:43,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:43,228 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 263 flow [2022-12-06 05:04:43,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2022-12-06 05:04:43,229 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-06 05:04:43,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:43,229 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 263 flow [2022-12-06 05:04:43,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:43,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:43,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 263 flow [2022-12-06 05:04:43,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 263 flow [2022-12-06 05:04:43,243 INFO L130 PetriNetUnfolder]: 10/91 cut-off events. [2022-12-06 05:04:43,243 INFO L131 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2022-12-06 05:04:43,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 91 events. 10/91 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 243 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 155. Up to 9 conditions per place. [2022-12-06 05:04:43,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 263 flow [2022-12-06 05:04:43,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-06 05:04:43,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:43,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:04:43,245 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 263 flow [2022-12-06 05:04:43,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:43,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:43,246 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:04:43,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:04:43,246 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:04:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash 423086491, now seen corresponding path program 3 times [2022-12-06 05:04:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827816059] [2022-12-06 05:04:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:43,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827816059] [2022-12-06 05:04:43,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827816059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:43,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:43,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:04:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049611354] [2022-12-06 05:04:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:43,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:43,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:04:43,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:43,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:43,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:04:43,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:43,752 INFO L130 PetriNetUnfolder]: 1183/1748 cut-off events. [2022-12-06 05:04:43,752 INFO L131 PetriNetUnfolder]: For 1897/1897 co-relation queries the response was YES. [2022-12-06 05:04:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4822 conditions, 1748 events. 1183/1748 cut-off events. For 1897/1897 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6913 event pairs, 441 based on Foata normal form. 36/1636 useless extension candidates. Maximal degree in co-relation 4723. Up to 1016 conditions per place. [2022-12-06 05:04:43,762 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 74 selfloop transitions, 6 changer transitions 3/83 dead transitions. [2022-12-06 05:04:43,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 528 flow [2022-12-06 05:04:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 05:04:43,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2022-12-06 05:04:43,764 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 263 flow. Second operand 4 states and 64 transitions. [2022-12-06 05:04:43,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 528 flow [2022-12-06 05:04:43,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 523 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:04:43,768 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 280 flow [2022-12-06 05:04:43,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 05:04:43,770 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-06 05:04:43,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:43,770 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 280 flow [2022-12-06 05:04:43,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:43,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:43,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 280 flow [2022-12-06 05:04:43,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 280 flow [2022-12-06 05:04:43,784 INFO L130 PetriNetUnfolder]: 14/84 cut-off events. [2022-12-06 05:04:43,785 INFO L131 PetriNetUnfolder]: For 51/54 co-relation queries the response was YES. [2022-12-06 05:04:43,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 84 events. 14/84 cut-off events. For 51/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 185 event pairs, 1 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 167. Up to 11 conditions per place. [2022-12-06 05:04:43,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 280 flow [2022-12-06 05:04:43,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 05:04:43,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:04:43,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:04:43,789 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 280 flow [2022-12-06 05:04:43,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:43,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:43,789 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:43,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:04:43,790 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:04:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 336964808, now seen corresponding path program 1 times [2022-12-06 05:04:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677340253] [2022-12-06 05:04:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:44,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677340253] [2022-12-06 05:04:44,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677340253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:44,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:44,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:04:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011062900] [2022-12-06 05:04:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:44,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:04:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:44,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:04:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:04:44,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:04:44,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:04:44,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:44,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:04:44,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:44,302 INFO L130 PetriNetUnfolder]: 933/1368 cut-off events. [2022-12-06 05:04:44,303 INFO L131 PetriNetUnfolder]: For 1939/1939 co-relation queries the response was YES. [2022-12-06 05:04:44,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 1368 events. 933/1368 cut-off events. For 1939/1939 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4938 event pairs, 164 based on Foata normal form. 48/1298 useless extension candidates. Maximal degree in co-relation 4092. Up to 1181 conditions per place. [2022-12-06 05:04:44,313 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 60 selfloop transitions, 4 changer transitions 1/65 dead transitions. [2022-12-06 05:04:44,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 452 flow [2022-12-06 05:04:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:04:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:04:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 05:04:44,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2022-12-06 05:04:44,315 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 280 flow. Second operand 3 states and 44 transitions. [2022-12-06 05:04:44,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 452 flow [2022-12-06 05:04:44,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 438 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:04:44,324 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 272 flow [2022-12-06 05:04:44,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-06 05:04:44,325 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-06 05:04:44,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:44,325 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 272 flow [2022-12-06 05:04:44,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:44,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:44,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 272 flow [2022-12-06 05:04:44,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 272 flow [2022-12-06 05:04:44,337 INFO L130 PetriNetUnfolder]: 13/68 cut-off events. [2022-12-06 05:04:44,337 INFO L131 PetriNetUnfolder]: For 45/48 co-relation queries the response was YES. [2022-12-06 05:04:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 68 events. 13/68 cut-off events. For 45/48 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 1 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 144. Up to 11 conditions per place. [2022-12-06 05:04:44,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 272 flow [2022-12-06 05:04:44,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 05:04:44,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:04:44,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:04:44,347 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 272 flow [2022-12-06 05:04:44,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:04:44,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:44,347 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:44,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:04:44,348 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:04:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1778927710, now seen corresponding path program 1 times [2022-12-06 05:04:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:44,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753129755] [2022-12-06 05:04:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:45,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753129755] [2022-12-06 05:04:45,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753129755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:04:45,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964677478] [2022-12-06 05:04:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:45,991 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:04:45,994 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:04:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:46,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 05:04:46,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:46,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:04:46,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:04:46,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:46,771 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 40 treesize of output 40 [2022-12-06 05:04:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:46,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:47,259 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (~o_4~0.base Int) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_655))) (let ((.cse0 (select (select .cse1 ~o_4~0.base) c_~o_4~0.offset)) (.cse2 (select .cse1 ~o_2~0.base))) (or (< .cse0 (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)) (< (select .cse2 c_~o_2~0.offset) (+ .cse0 1)) (< |c_thread1Thread1of1ForFork1_#t~mem1#1| (+ (select .cse2 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~o_2~0.offset)) 1)))))) is different from false [2022-12-06 05:04:47,375 INFO L321 Elim1Store]: treesize reduction 19, result has 84.8 percent of original size [2022-12-06 05:04:47,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 188 treesize of output 237 [2022-12-06 05:04:47,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:04:47,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 158 [2022-12-06 05:04:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:04:57,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964677478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:57,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:57,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2022-12-06 05:04:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503421507] [2022-12-06 05:04:57,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:57,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-06 05:04:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:57,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-06 05:04:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1266, Unknown=1, NotChecked=72, Total=1482 [2022-12-06 05:04:57,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:04:57,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 272 flow. Second operand has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:57,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:57,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:04:57,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:59,541 INFO L130 PetriNetUnfolder]: 2612/3815 cut-off events. [2022-12-06 05:04:59,541 INFO L131 PetriNetUnfolder]: For 3752/3752 co-relation queries the response was YES. [2022-12-06 05:04:59,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 3815 events. 2612/3815 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17722 event pairs, 321 based on Foata normal form. 3/3446 useless extension candidates. Maximal degree in co-relation 10669. Up to 1171 conditions per place. [2022-12-06 05:04:59,566 INFO L137 encePairwiseOnDemand]: 14/30 looper letters, 203 selfloop transitions, 50 changer transitions 3/256 dead transitions. [2022-12-06 05:04:59,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 256 transitions, 1526 flow [2022-12-06 05:04:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:04:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:04:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 223 transitions. [2022-12-06 05:04:59,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37166666666666665 [2022-12-06 05:04:59,568 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 272 flow. Second operand 20 states and 223 transitions. [2022-12-06 05:04:59,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 256 transitions, 1526 flow [2022-12-06 05:04:59,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 256 transitions, 1492 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:04:59,579 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 716 flow [2022-12-06 05:04:59,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=716, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2022-12-06 05:04:59,580 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2022-12-06 05:04:59,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:59,581 INFO L89 Accepts]: Start accepts. Operand has 85 places, 99 transitions, 716 flow [2022-12-06 05:04:59,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:59,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:59,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 99 transitions, 716 flow [2022-12-06 05:04:59,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 99 transitions, 716 flow [2022-12-06 05:04:59,636 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1226] $Ultimate##0-->L81-2: Formula: (and (= |v_thread3Thread1of1ForFork0_~stop~2#1_51| (ite (= (ite (not (= v_~result_13~0_70 0)) 1 0) 0) 0 1)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= v_~result_13~0_70 |v_thread3Thread1of1ForFork0_minus_#res#1_37|) (not (= (ite (= (mod v_~isNull_1~0_47 256) 0) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_75| 1) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= (select (select |v_#memory_int_309| v_~o_4~0.base_91) v_~o_4~0.offset_91) |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_37|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= (mod v_~isNull_5~0_57 256) 0) (= (select (select |v_#memory_int_309| v_~o_0~0.base_63) v_~o_0~0.offset_63) |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0))) InVars {~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~o_4~0.offset=v_~o_4~0.offset_91, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, ~o_0~0.base=v_~o_0~0.base_63, ~o_4~0.base=v_~o_4~0.base_91} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_4~0.offset=v_~o_4~0.offset_91, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_43|, ~o_0~0.base=v_~o_0~0.base_63, thread3Thread1of1ForFork0_#t~post12#1=|v_thread3Thread1of1ForFork0_#t~post12#1_27|, ~o_4~0.base=v_~o_4~0.base_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_75|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_27|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_37|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_51|, ~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~result_13~0=v_~result_13~0_70, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|, thread3Thread1of1ForFork0_#t~ret11#1=|v_thread3Thread1of1ForFork0_#t~ret11#1_45|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post12#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_~stop~2#1, ~result_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_#t~ret11#1][59], [111#L68-1true, 42#thread1EXITtrue, 1099#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 452#(< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 594#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4)), 568#true, Black: 312#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 781#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~isNull_5~0 |thread2Thread1of1ForFork2_~stop~1#1|)), 180#L103-4true, 103#L81-2true, Black: 793#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~isNull_5~0 (* 256 (div ~isNull_5~0 256))) (<= |thread2Thread1of1ForFork2_~stop~1#1| (* 256 (div |thread2Thread1of1ForFork2_~stop~1#1| 256)))), 808#(<= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), Black: 799#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~isNull_5~0 |thread2Thread1of1ForFork2_~stop~1#1|)), Black: 1114#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1122#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |thread3Thread1of1ForFork0_~i~2#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1108#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (exists ((~o_2~0.base Int)) (and (<= (+ (select (select |#memory_int| ~o_2~0.base) (* |thread2Thread1of1ForFork2_~i~1#1| 4)) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= |thread2Thread1of1ForFork2_#t~mem5#1| (select (select |#memory_int| ~o_2~0.base) (* |thread2Thread1of1ForFork2_~i~1#1| 4))))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1116#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (or (<= ~result_7~0 0) (forall ((~o_4~0.base Int)) (or (< |thread2Thread1of1ForFork2_#t~mem5#1| (+ 1 (select (select |#memory_int| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))))) (< (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset))))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1106#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1118#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))), Black: 1110#(and (= ~o_4~0.offset 0) (exists ((~o_2~0.base Int)) (and (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset)) (select (select |#memory_int| ~o_2~0.base) 0)) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1112#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ |thread2Thread1of1ForFork2_#t~mem5#1| ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 299#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1093#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< |thread3Thread1of1ForFork0_~i~2#1| 5))), Black: 1124#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (or (<= ~result_10~0 0) (and (< |thread3Thread1of1ForFork0_~i~2#1| 5) (< 0 ~result_13~0)) (<= ~result_7~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))), Black: 1097#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (= (select (select |#memory_int| ~o_0~0.base) (+ ~o_0~0.offset (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread1Thread1of1ForFork1_#t~mem1#1|) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1120#(and (= ~o_4~0.offset 0) (exists ((~o_2~0.base Int)) (and (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset)) (select (select |#memory_int| ~o_2~0.base) 0)) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1104#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1101#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 790#(<= ~isNull_5~0 (* 256 (div ~isNull_5~0 256))), Black: 1095#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 517#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread1Thread1of1ForFork1_~stop~0#1| ~isNull_3~0)), 301#true]) [2022-12-06 05:04:59,639 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 05:04:59,639 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:04:59,639 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:04:59,639 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:04:59,651 INFO L130 PetriNetUnfolder]: 203/538 cut-off events. [2022-12-06 05:04:59,651 INFO L131 PetriNetUnfolder]: For 1463/1505 co-relation queries the response was YES. [2022-12-06 05:04:59,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 538 events. 203/538 cut-off events. For 1463/1505 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3102 event pairs, 34 based on Foata normal form. 12/515 useless extension candidates. Maximal degree in co-relation 1797. Up to 100 conditions per place. [2022-12-06 05:04:59,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 99 transitions, 716 flow [2022-12-06 05:04:59,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 05:05:01,404 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:05:01,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1824 [2022-12-06 05:05:01,406 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 98 transitions, 718 flow [2022-12-06 05:05:01,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:01,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:01,406 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:01,415 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:05:01,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:01,612 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:05:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1160646706, now seen corresponding path program 1 times [2022-12-06 05:05:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:01,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523910062] [2022-12-06 05:05:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-06 05:05:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:03,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523910062] [2022-12-06 05:05:03,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523910062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:03,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808001476] [2022-12-06 05:05:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:03,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:03,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:03,136 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:05:03,139 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:05:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:03,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:05:03,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:03,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:03,695 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 40 treesize of output 40 [2022-12-06 05:05:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-06 05:05:03,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:04,222 INFO L321 Elim1Store]: treesize reduction 8, result has 96.2 percent of original size [2022-12-06 05:05:04,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 218 [2022-12-06 05:05:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-06 05:05:09,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808001476] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:09,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:09,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 9] total 31 [2022-12-06 05:05:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583510652] [2022-12-06 05:05:09,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:09,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 05:05:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:09,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 05:05:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2022-12-06 05:05:09,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:05:09,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 98 transitions, 718 flow. Second operand has 32 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:09,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:09,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:05:09,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:10,791 INFO L130 PetriNetUnfolder]: 3073/4478 cut-off events. [2022-12-06 05:05:10,792 INFO L131 PetriNetUnfolder]: For 15503/15503 co-relation queries the response was YES. [2022-12-06 05:05:10,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18596 conditions, 4478 events. 3073/4478 cut-off events. For 15503/15503 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20984 event pairs, 1117 based on Foata normal form. 2/4428 useless extension candidates. Maximal degree in co-relation 18484. Up to 3438 conditions per place. [2022-12-06 05:05:10,860 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 145 selfloop transitions, 44 changer transitions 2/191 dead transitions. [2022-12-06 05:05:10,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 191 transitions, 1665 flow [2022-12-06 05:05:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:05:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:05:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-12-06 05:05:10,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2932692307692308 [2022-12-06 05:05:10,862 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 718 flow. Second operand 13 states and 122 transitions. [2022-12-06 05:05:10,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 191 transitions, 1665 flow [2022-12-06 05:05:10,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 191 transitions, 1622 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 05:05:10,935 INFO L231 Difference]: Finished difference. Result has 99 places, 136 transitions, 1163 flow [2022-12-06 05:05:10,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1163, PETRI_PLACES=99, PETRI_TRANSITIONS=136} [2022-12-06 05:05:10,935 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2022-12-06 05:05:10,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:10,935 INFO L89 Accepts]: Start accepts. Operand has 99 places, 136 transitions, 1163 flow [2022-12-06 05:05:10,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:10,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:10,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 136 transitions, 1163 flow [2022-12-06 05:05:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 136 transitions, 1163 flow [2022-12-06 05:05:11,012 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1226] $Ultimate##0-->L81-2: Formula: (and (= |v_thread3Thread1of1ForFork0_~stop~2#1_51| (ite (= (ite (not (= v_~result_13~0_70 0)) 1 0) 0) 0 1)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= v_~result_13~0_70 |v_thread3Thread1of1ForFork0_minus_#res#1_37|) (not (= (ite (= (mod v_~isNull_1~0_47 256) 0) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_75| 1) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= (select (select |v_#memory_int_309| v_~o_4~0.base_91) v_~o_4~0.offset_91) |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_37|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= (mod v_~isNull_5~0_57 256) 0) (= (select (select |v_#memory_int_309| v_~o_0~0.base_63) v_~o_0~0.offset_63) |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0))) InVars {~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~o_4~0.offset=v_~o_4~0.offset_91, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, ~o_0~0.base=v_~o_0~0.base_63, ~o_4~0.base=v_~o_4~0.base_91} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_4~0.offset=v_~o_4~0.offset_91, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_43|, ~o_0~0.base=v_~o_0~0.base_63, thread3Thread1of1ForFork0_#t~post12#1=|v_thread3Thread1of1ForFork0_#t~post12#1_27|, ~o_4~0.base=v_~o_4~0.base_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_75|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_27|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_37|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_51|, ~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~result_13~0=v_~result_13~0_70, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|, thread3Thread1of1ForFork0_#t~ret11#1=|v_thread3Thread1of1ForFork0_#t~ret11#1_45|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post12#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_~stop~2#1, ~result_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_#t~ret11#1][67], [111#L68-1true, 42#thread1EXITtrue, 1099#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 452#(< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 594#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4)), 568#true, Black: 312#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 781#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~isNull_5~0 |thread2Thread1of1ForFork2_~stop~1#1|)), 180#L103-4true, Black: 1416#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~o_0~0.offset 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1431#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< 0 ~result_13~0)) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1411#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (= ~o_0~0.offset 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 103#L81-2true, Black: 1429#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~o_0~0.offset 0) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 793#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~isNull_5~0 (* 256 (div ~isNull_5~0 256))) (<= |thread2Thread1of1ForFork2_~stop~1#1| (* 256 (div |thread2Thread1of1ForFork2_~stop~1#1| 256)))), Black: 1425#(and (= ~o_4~0.offset 0) (exists ((~o_4~0.base Int)) (and (<= (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset) (+ ~result_13~0 (select (select |#memory_int| ~o_4~0.base) 0))) (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) 0)) (select (select |#memory_int| ~o_2~0.base) ~o_2~0.offset)))) (= ~o_2~0.offset 0) (= ~o_0~0.offset 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 1) (or (= |thread3Thread1of1ForFork0_~i~2#1| 1) (<= ~result_13~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1420#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~o_0~0.offset 0) (= |thread2Thread1of1ForFork2_#t~mem5#1| (select (select |#memory_int| ~o_2~0.base) (+ ~o_2~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 808#(<= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 1414#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 799#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~isNull_5~0 |thread2Thread1of1ForFork2_~stop~1#1|)), Black: 1114#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1122#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |thread3Thread1of1ForFork0_~i~2#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1108#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (exists ((~o_2~0.base Int)) (and (<= (+ (select (select |#memory_int| ~o_2~0.base) (* |thread2Thread1of1ForFork2_~i~1#1| 4)) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= |thread2Thread1of1ForFork2_#t~mem5#1| (select (select |#memory_int| ~o_2~0.base) (* |thread2Thread1of1ForFork2_~i~1#1| 4))))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1116#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (or (<= ~result_7~0 0) (forall ((~o_4~0.base Int)) (or (< |thread2Thread1of1ForFork2_#t~mem5#1| (+ 1 (select (select |#memory_int| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))))) (< (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset))))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1106#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1118#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))), Black: 1110#(and (= ~o_4~0.offset 0) (exists ((~o_2~0.base Int)) (and (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset)) (select (select |#memory_int| ~o_2~0.base) 0)) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 299#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1112#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ |thread2Thread1of1ForFork2_#t~mem5#1| ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1093#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< |thread3Thread1of1ForFork0_~i~2#1| 5))), Black: 1124#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (or (<= ~result_10~0 0) (and (< |thread3Thread1of1ForFork0_~i~2#1| 5) (< 0 ~result_13~0)) (<= ~result_7~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= ~result_10~0 0) (<= ~result_7~0 0) (< (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))), Black: 1097#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (= (select (select |#memory_int| ~o_0~0.base) (+ ~o_0~0.offset (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread1Thread1of1ForFork1_#t~mem1#1|) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1120#(and (= ~o_4~0.offset 0) (exists ((~o_2~0.base Int)) (and (<= (+ ~result_10~0 (select (select |#memory_int| ~o_4~0.base) ~o_4~0.offset)) (select (select |#memory_int| ~o_2~0.base) 0)) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)))) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (<= |thread2Thread1of1ForFork2_~i~1#1| 1) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1104#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ ~result_10~0 ~result_7~0) ~result_13~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1101#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| 1) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (<= (+ (select (select |#memory_int| ~o_2~0.base) 0) ~result_7~0) (select (select |#memory_int| ~o_0~0.base) ~o_0~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 790#(<= ~isNull_5~0 (* 256 (div ~isNull_5~0 256))), Black: 1095#(and (= ~o_4~0.offset 0) (= ~o_2~0.offset 0) (<= (+ 2 ~o_0~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~o_0~0.offset 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 517#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread1Thread1of1ForFork1_~stop~0#1| ~isNull_3~0)), 301#true]) [2022-12-06 05:05:11,012 INFO L382 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-06 05:05:11,012 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:05:11,012 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:05:11,012 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:05:11,034 INFO L130 PetriNetUnfolder]: 316/758 cut-off events. [2022-12-06 05:05:11,034 INFO L131 PetriNetUnfolder]: For 2987/3057 co-relation queries the response was YES. [2022-12-06 05:05:11,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 758 events. 316/758 cut-off events. For 2987/3057 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4544 event pairs, 49 based on Foata normal form. 32/739 useless extension candidates. Maximal degree in co-relation 3050. Up to 153 conditions per place. [2022-12-06 05:05:11,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 136 transitions, 1163 flow [2022-12-06 05:05:11,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 05:05:11,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1220] L68-1-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_~b#1_57| |v_thread2Thread1of1ForFork2_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_57| |v_thread2Thread1of1ForFork2_minus_#in~a#1_31|) (<= 0 (+ |v_thread2Thread1of1ForFork2_minus_#res#1_49| 2147483648)) (= (ite (= (ite (not (= v_~result_10~0_74 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork2_~stop~1#1_45|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_49| v_~result_10~0_74) (= (select (select |v_#memory_int_234| v_~o_4~0.base_83) (+ v_~o_4~0.offset_83 (* |v_thread2Thread1of1ForFork2_~i~1#1_76| 4))) |v_thread2Thread1of1ForFork2_minus_#in~b#1_33|) (<= |v_thread2Thread1of1ForFork2_minus_#res#1_49| 2147483647) (= |v_thread2Thread1of1ForFork2_~i~1#1_75| (+ |v_thread2Thread1of1ForFork2_~i~1#1_76| 1)) (= |v_thread2Thread1of1ForFork2_#t~mem5#1_54| |v_thread2Thread1of1ForFork2_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75| (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_57| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_57|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_57|)) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_49| |v_thread2Thread1of1ForFork2_minus_~b#1_57|) |v_thread2Thread1of1ForFork2_minus_~a#1_57|)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_76|, ~o_4~0.offset=v_~o_4~0.offset_83, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_54|, #memory_int=|v_#memory_int_234|, ~o_4~0.base=v_~o_4~0.base_83} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_75|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_57|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_51|, ~o_4~0.offset=v_~o_4~0.offset_83, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_49|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_45|, ~o_4~0.base=v_~o_4~0.base_83, thread2Thread1of1ForFork2_#t~ret7#1=|v_thread2Thread1of1ForFork2_#t~ret7#1_31|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_57|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_31|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_33|, #memory_int=|v_#memory_int_234|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_21|, ~result_10~0=v_~result_10~0_74} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, thread2Thread1of1ForFork2_#t~ret7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, ~result_10~0] and [1065] L53-2-->L54-1: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~stop~0#1_29| 256) 0) (< |v_thread1Thread1of1ForFork1_~i~0#1_25| 5) (= (select (select |v_#memory_int_88| v_~o_0~0.base_21) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_25| 4) v_~o_0~0.offset_21)) |v_thread1Thread1of1ForFork1_#t~mem1#1_13|)) InVars {thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_29|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_25|, ~o_0~0.offset=v_~o_0~0.offset_21, #memory_int=|v_#memory_int_88|, ~o_0~0.base=v_~o_0~0.base_21} OutVars{thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_29|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_25|, ~o_0~0.offset=v_~o_0~0.offset_21, #memory_int=|v_#memory_int_88|, ~o_0~0.base=v_~o_0~0.base_21, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1#1] [2022-12-06 05:05:11,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1220] L68-1-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_~b#1_57| |v_thread2Thread1of1ForFork2_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_57| |v_thread2Thread1of1ForFork2_minus_#in~a#1_31|) (<= 0 (+ |v_thread2Thread1of1ForFork2_minus_#res#1_49| 2147483648)) (= (ite (= (ite (not (= v_~result_10~0_74 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork2_~stop~1#1_45|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_49| v_~result_10~0_74) (= (select (select |v_#memory_int_234| v_~o_4~0.base_83) (+ v_~o_4~0.offset_83 (* |v_thread2Thread1of1ForFork2_~i~1#1_76| 4))) |v_thread2Thread1of1ForFork2_minus_#in~b#1_33|) (<= |v_thread2Thread1of1ForFork2_minus_#res#1_49| 2147483647) (= |v_thread2Thread1of1ForFork2_~i~1#1_75| (+ |v_thread2Thread1of1ForFork2_~i~1#1_76| 1)) (= |v_thread2Thread1of1ForFork2_#t~mem5#1_54| |v_thread2Thread1of1ForFork2_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75| (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_57| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_57|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_57|)) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_49| |v_thread2Thread1of1ForFork2_minus_~b#1_57|) |v_thread2Thread1of1ForFork2_minus_~a#1_57|)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_76|, ~o_4~0.offset=v_~o_4~0.offset_83, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_54|, #memory_int=|v_#memory_int_234|, ~o_4~0.base=v_~o_4~0.base_83} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_75|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_57|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_51|, ~o_4~0.offset=v_~o_4~0.offset_83, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_49|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_45|, ~o_4~0.base=v_~o_4~0.base_83, thread2Thread1of1ForFork2_#t~ret7#1=|v_thread2Thread1of1ForFork2_#t~ret7#1_31|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_57|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_31|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_33|, #memory_int=|v_#memory_int_234|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_21|, ~result_10~0=v_~result_10~0_74} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, thread2Thread1of1ForFork2_#t~ret7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, ~result_10~0] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:11,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1220] L68-1-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_~b#1_57| |v_thread2Thread1of1ForFork2_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_57| |v_thread2Thread1of1ForFork2_minus_#in~a#1_31|) (<= 0 (+ |v_thread2Thread1of1ForFork2_minus_#res#1_49| 2147483648)) (= (ite (= (ite (not (= v_~result_10~0_74 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork2_~stop~1#1_45|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_49| v_~result_10~0_74) (= (select (select |v_#memory_int_234| v_~o_4~0.base_83) (+ v_~o_4~0.offset_83 (* |v_thread2Thread1of1ForFork2_~i~1#1_76| 4))) |v_thread2Thread1of1ForFork2_minus_#in~b#1_33|) (<= |v_thread2Thread1of1ForFork2_minus_#res#1_49| 2147483647) (= |v_thread2Thread1of1ForFork2_~i~1#1_75| (+ |v_thread2Thread1of1ForFork2_~i~1#1_76| 1)) (= |v_thread2Thread1of1ForFork2_#t~mem5#1_54| |v_thread2Thread1of1ForFork2_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75| (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_57| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_57|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_57|)) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_49| |v_thread2Thread1of1ForFork2_minus_~b#1_57|) |v_thread2Thread1of1ForFork2_minus_~a#1_57|)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_76|, ~o_4~0.offset=v_~o_4~0.offset_83, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_54|, #memory_int=|v_#memory_int_234|, ~o_4~0.base=v_~o_4~0.base_83} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_75|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_57|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_51|, ~o_4~0.offset=v_~o_4~0.offset_83, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_49|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_45|, ~o_4~0.base=v_~o_4~0.base_83, thread2Thread1of1ForFork2_#t~ret7#1=|v_thread2Thread1of1ForFork2_#t~ret7#1_31|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_57|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_31|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_33|, #memory_int=|v_#memory_int_234|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_21|, ~result_10~0=v_~result_10~0_74} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, thread2Thread1of1ForFork2_#t~ret7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, ~result_10~0] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:12,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1202] L81-2-->thread3EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread3Thread1of1ForFork0_~stop~2#1_In_4| 256) 0)))) (and (or .cse0 (not (< |v_thread3Thread1of1ForFork0_~i~2#1_In_10| 5))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_4| 0) (= v_~result_13~0_Out_22 (ite .cse0 v_~result_13~0_In_6 0)))) InVars {~result_13~0=v_~result_13~0_In_6, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_In_4|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_10|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_4|, ~result_13~0=v_~result_13~0_Out_22, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_4|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_In_4|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~result_13~0] [2022-12-06 05:05:12,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1208] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~stop~1#1_In_3| 256) 0)))) (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (or .cse0 (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_8| 5))) (= (ite .cse0 v_~result_10~0_In_6 0) v_~result_10~0_Out_24))) InVars {thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_In_3|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_8|, ~result_10~0=v_~result_10~0_In_6} OutVars{thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_8|, ~result_10~0=v_~result_10~0_Out_24, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~result_10~0, thread2Thread1of1ForFork2_#res#1.base] and [1202] L81-2-->thread3EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread3Thread1of1ForFork0_~stop~2#1_In_4| 256) 0)))) (and (or .cse0 (not (< |v_thread3Thread1of1ForFork0_~i~2#1_In_10| 5))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_4| 0) (= v_~result_13~0_Out_22 (ite .cse0 v_~result_13~0_In_6 0)))) InVars {~result_13~0=v_~result_13~0_In_6, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_In_4|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_10|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_4|, ~result_13~0=v_~result_13~0_Out_22, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_4|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_In_4|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base, ~result_13~0] [2022-12-06 05:05:12,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1208] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~stop~1#1_In_3| 256) 0)))) (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_4| 0) (or .cse0 (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_8| 5))) (= (ite .cse0 v_~result_10~0_In_6 0) v_~result_10~0_Out_24))) InVars {thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_In_3|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_8|, ~result_10~0=v_~result_10~0_In_6} OutVars{thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_4|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_8|, ~result_10~0=v_~result_10~0_Out_24, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~result_10~0, thread2Thread1of1ForFork2_#res#1.base] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:13,497 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:05:13,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2563 [2022-12-06 05:05:13,498 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 133 transitions, 1202 flow [2022-12-06 05:05:13,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:05:13,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:13,498 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:13,506 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:05:13,703 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:05:13,704 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:05:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1952691754, now seen corresponding path program 1 times [2022-12-06 05:05:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587312116] [2022-12-06 05:05:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:05:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:17,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587312116] [2022-12-06 05:05:17,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587312116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:17,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792212553] [2022-12-06 05:05:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:17,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:17,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:17,056 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:05:17,058 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:05:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:17,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:05:17,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:05:17,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:05:17,706 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 40 treesize of output 40 [2022-12-06 05:05:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-06 05:05:17,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:05:18,360 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size [2022-12-06 05:05:18,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104 [2022-12-06 05:05:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-06 05:05:18,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792212553] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:05:18,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:05:18,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14, 9] total 49 [2022-12-06 05:05:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960733097] [2022-12-06 05:05:18,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:05:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-06 05:05:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-06 05:05:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450 [2022-12-06 05:05:18,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:05:18,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 133 transitions, 1202 flow. Second operand has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 50 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:05:18,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:18,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:05:18,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:27,151 INFO L130 PetriNetUnfolder]: 14070/20513 cut-off events. [2022-12-06 05:05:27,152 INFO L131 PetriNetUnfolder]: For 113433/113433 co-relation queries the response was YES. [2022-12-06 05:05:27,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101806 conditions, 20513 events. 14070/20513 cut-off events. For 113433/113433 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 125229 event pairs, 4504 based on Foata normal form. 4/20413 useless extension candidates. Maximal degree in co-relation 85854. Up to 3711 conditions per place. [2022-12-06 05:05:27,328 INFO L137 encePairwiseOnDemand]: 16/38 looper letters, 664 selfloop transitions, 241 changer transitions 4/909 dead transitions. [2022-12-06 05:05:27,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 909 transitions, 10236 flow [2022-12-06 05:05:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-06 05:05:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-06 05:05:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 517 transitions. [2022-12-06 05:05:27,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2159565580618212 [2022-12-06 05:05:27,333 INFO L175 Difference]: Start difference. First operand has 98 places, 133 transitions, 1202 flow. Second operand 63 states and 517 transitions. [2022-12-06 05:05:27,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 909 transitions, 10236 flow [2022-12-06 05:05:28,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 909 transitions, 8980 flow, removed 617 selfloop flow, removed 2 redundant places. [2022-12-06 05:05:28,177 INFO L231 Difference]: Finished difference. Result has 185 places, 339 transitions, 3974 flow [2022-12-06 05:05:28,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=3974, PETRI_PLACES=185, PETRI_TRANSITIONS=339} [2022-12-06 05:05:28,178 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 151 predicate places. [2022-12-06 05:05:28,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:28,178 INFO L89 Accepts]: Start accepts. Operand has 185 places, 339 transitions, 3974 flow [2022-12-06 05:05:28,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:28,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:28,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 339 transitions, 3974 flow [2022-12-06 05:05:28,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 339 transitions, 3974 flow [2022-12-06 05:05:28,652 INFO L130 PetriNetUnfolder]: 1468/3573 cut-off events. [2022-12-06 05:05:28,653 INFO L131 PetriNetUnfolder]: For 35080/35366 co-relation queries the response was YES. [2022-12-06 05:05:28,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18486 conditions, 3573 events. 1468/3573 cut-off events. For 35080/35366 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 31753 event pairs, 216 based on Foata normal form. 142/3487 useless extension candidates. Maximal degree in co-relation 17552. Up to 673 conditions per place. [2022-12-06 05:05:28,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 339 transitions, 3974 flow [2022-12-06 05:05:28,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 2210 [2022-12-06 05:05:30,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1226] $Ultimate##0-->L81-2: Formula: (and (= |v_thread3Thread1of1ForFork0_~stop~2#1_51| (ite (= (ite (not (= v_~result_13~0_70 0)) 1 0) 0) 0 1)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= v_~result_13~0_70 |v_thread3Thread1of1ForFork0_minus_#res#1_37|) (not (= (ite (= (mod v_~isNull_1~0_47 256) 0) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_75| 1) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= (select (select |v_#memory_int_309| v_~o_4~0.base_91) v_~o_4~0.offset_91) |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_37|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= (mod v_~isNull_5~0_57 256) 0) (= (select (select |v_#memory_int_309| v_~o_0~0.base_63) v_~o_0~0.offset_63) |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0))) InVars {~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~o_4~0.offset=v_~o_4~0.offset_91, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, ~o_0~0.base=v_~o_0~0.base_63, ~o_4~0.base=v_~o_4~0.base_91} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_4~0.offset=v_~o_4~0.offset_91, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_43|, ~o_0~0.base=v_~o_0~0.base_63, thread3Thread1of1ForFork0_#t~post12#1=|v_thread3Thread1of1ForFork0_#t~post12#1_27|, ~o_4~0.base=v_~o_4~0.base_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_75|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_27|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_37|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_51|, ~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~result_13~0=v_~result_13~0_70, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|, thread3Thread1of1ForFork0_#t~ret11#1=|v_thread3Thread1of1ForFork0_#t~ret11#1_45|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post12#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_~stop~2#1, ~result_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_#t~ret11#1] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:34,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1214] $Ultimate##0-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_~stop~1#1_Out_14| v_~isNull_5~0_In_6) (= v_~result_10~0_Out_32 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread2Thread1of1ForFork2_~i~1#1_Out_14| 0) (= (ite (= (mod v_~isNull_3~0_In_6 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|)) InVars {~isNull_5~0=v_~isNull_5~0_In_6, ~isNull_3~0=v_~isNull_3~0_In_6} OutVars{~isNull_3~0=v_~isNull_3~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_Out_14|, ~isNull_5~0=v_~isNull_5~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_Out_14|, ~result_10~0=v_~result_10~0_Out_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, ~result_10~0] and [1205] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_Out_14| 0) (= v_~result_7~0_Out_24 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= (ite (= (mod v_~isNull_1~0_In_1 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread1Thread1of1ForFork1_~stop~0#1_Out_16| v_~isNull_3~0_In_4)) InVars {~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1} OutVars{~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_7~0=v_~result_7~0_Out_24, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_7~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:34,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1214] $Ultimate##0-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_~stop~1#1_Out_14| v_~isNull_5~0_In_6) (= v_~result_10~0_Out_32 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread2Thread1of1ForFork2_~i~1#1_Out_14| 0) (= (ite (= (mod v_~isNull_3~0_In_6 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|)) InVars {~isNull_5~0=v_~isNull_5~0_In_6, ~isNull_3~0=v_~isNull_3~0_In_6} OutVars{~isNull_3~0=v_~isNull_3~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_Out_14|, ~isNull_5~0=v_~isNull_5~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_Out_14|, ~result_10~0=v_~result_10~0_Out_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, ~result_10~0] and [1205] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_Out_14| 0) (= v_~result_7~0_Out_24 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= (ite (= (mod v_~isNull_1~0_In_1 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread1Thread1of1ForFork1_~stop~0#1_Out_16| v_~isNull_3~0_In_4)) InVars {~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1} OutVars{~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_7~0=v_~result_7~0_Out_24, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_7~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:34,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1226] $Ultimate##0-->L81-2: Formula: (and (= |v_thread3Thread1of1ForFork0_~stop~2#1_51| (ite (= (ite (not (= v_~result_13~0_70 0)) 1 0) 0) 0 1)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= v_~result_13~0_70 |v_thread3Thread1of1ForFork0_minus_#res#1_37|) (not (= (ite (= (mod v_~isNull_1~0_47 256) 0) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_75| 1) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= (select (select |v_#memory_int_309| v_~o_4~0.base_91) v_~o_4~0.offset_91) |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_37|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= (mod v_~isNull_5~0_57 256) 0) (= (select (select |v_#memory_int_309| v_~o_0~0.base_63) v_~o_0~0.offset_63) |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0))) InVars {~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~o_4~0.offset=v_~o_4~0.offset_91, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, ~o_0~0.base=v_~o_0~0.base_63, ~o_4~0.base=v_~o_4~0.base_91} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_4~0.offset=v_~o_4~0.offset_91, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_43|, ~o_0~0.base=v_~o_0~0.base_63, thread3Thread1of1ForFork0_#t~post12#1=|v_thread3Thread1of1ForFork0_#t~post12#1_27|, ~o_4~0.base=v_~o_4~0.base_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_75|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_27|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_37|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_51|, ~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~result_13~0=v_~result_13~0_70, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|, thread3Thread1of1ForFork0_#t~ret11#1=|v_thread3Thread1of1ForFork0_#t~ret11#1_45|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post12#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_~stop~2#1, ~result_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_#t~ret11#1] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:36,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1214] $Ultimate##0-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_~stop~1#1_Out_14| v_~isNull_5~0_In_6) (= v_~result_10~0_Out_32 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread2Thread1of1ForFork2_~i~1#1_Out_14| 0) (= (ite (= (mod v_~isNull_3~0_In_6 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|)) InVars {~isNull_5~0=v_~isNull_5~0_In_6, ~isNull_3~0=v_~isNull_3~0_In_6} OutVars{~isNull_3~0=v_~isNull_3~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_Out_14|, ~isNull_5~0=v_~isNull_5~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_Out_14|, ~result_10~0=v_~result_10~0_Out_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, ~result_10~0] and [1205] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_Out_14| 0) (= v_~result_7~0_Out_24 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= (ite (= (mod v_~isNull_1~0_In_1 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread1Thread1of1ForFork1_~stop~0#1_Out_16| v_~isNull_3~0_In_4)) InVars {~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1} OutVars{~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_7~0=v_~result_7~0_Out_24, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_7~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:38,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1226] $Ultimate##0-->L81-2: Formula: (and (= |v_thread3Thread1of1ForFork0_~stop~2#1_51| (ite (= (ite (not (= v_~result_13~0_70 0)) 1 0) 0) 0 1)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= v_~result_13~0_70 |v_thread3Thread1of1ForFork0_minus_#res#1_37|) (not (= (ite (= (mod v_~isNull_1~0_47 256) 0) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_75| 1) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= (select (select |v_#memory_int_309| v_~o_4~0.base_91) v_~o_4~0.offset_91) |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_37|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= (mod v_~isNull_5~0_57 256) 0) (= (select (select |v_#memory_int_309| v_~o_0~0.base_63) v_~o_0~0.offset_63) |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0))) InVars {~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~o_4~0.offset=v_~o_4~0.offset_91, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, ~o_0~0.base=v_~o_0~0.base_63, ~o_4~0.base=v_~o_4~0.base_91} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_4~0.offset=v_~o_4~0.offset_91, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_43|, ~o_0~0.base=v_~o_0~0.base_63, thread3Thread1of1ForFork0_#t~post12#1=|v_thread3Thread1of1ForFork0_#t~post12#1_27|, ~o_4~0.base=v_~o_4~0.base_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_75|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_27|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_37|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_51|, ~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~result_13~0=v_~result_13~0_70, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|, thread3Thread1of1ForFork0_#t~ret11#1=|v_thread3Thread1of1ForFork0_#t~ret11#1_45|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post12#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_~stop~2#1, ~result_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_#t~ret11#1] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:39,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1226] $Ultimate##0-->L81-2: Formula: (and (= |v_thread3Thread1of1ForFork0_~stop~2#1_51| (ite (= (ite (not (= v_~result_13~0_70 0)) 1 0) 0) 0 1)) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_53| |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= v_~result_13~0_70 |v_thread3Thread1of1ForFork0_minus_#res#1_37|) (not (= (ite (= (mod v_~isNull_1~0_47 256) 0) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_75| 1) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_37| 2147483647) (= |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= (select (select |v_#memory_int_309| v_~o_4~0.base_91) v_~o_4~0.offset_91) |v_thread3Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_53| |v_thread3Thread1of1ForFork0_minus_#res#1_37|) |v_thread3Thread1of1ForFork0_minus_~a#1_53|) (= (mod v_~isNull_5~0_57 256) 0) (= (select (select |v_#memory_int_309| v_~o_0~0.base_63) v_~o_0~0.offset_63) |v_thread3Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_53|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_53| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_53|))) 1 0))) InVars {~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~o_4~0.offset=v_~o_4~0.offset_91, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, ~o_0~0.base=v_~o_0~0.base_63, ~o_4~0.base=v_~o_4~0.base_91} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_4~0.offset=v_~o_4~0.offset_91, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_43|, ~o_0~0.base=v_~o_0~0.base_63, thread3Thread1of1ForFork0_#t~post12#1=|v_thread3Thread1of1ForFork0_#t~post12#1_27|, ~o_4~0.base=v_~o_4~0.base_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_75|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_53|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_27|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_37|, thread3Thread1of1ForFork0_~stop~2#1=|v_thread3Thread1of1ForFork0_~stop~2#1_51|, ~isNull_1~0=v_~isNull_1~0_47, ~isNull_5~0=v_~isNull_5~0_57, ~result_13~0=v_~result_13~0_70, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_53|, #memory_int=|v_#memory_int_309|, ~o_0~0.offset=v_~o_0~0.offset_63, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_29|, thread3Thread1of1ForFork0_#t~ret11#1=|v_thread3Thread1of1ForFork0_#t~ret11#1_45|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post12#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_~stop~2#1, ~result_13~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_#t~ret11#1] and [1222] L54-1-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| (select (select |v_#memory_int_248| v_~o_2~0.base_55) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_74| 4) v_~o_2~0.offset_55))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_61|))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_43| v_~result_7~0_80) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (= |v_thread1Thread1of1ForFork1_~stop~0#1_55| (ite (= (ite (not (= v_~result_7~0_80 0)) 1 0) 0) 0 1)) (<= 0 (+ v_~result_7~0_80 2147483648)) (= |v_thread1Thread1of1ForFork1_~i~0#1_73| (+ |v_thread1Thread1of1ForFork1_~i~0#1_74| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_41| |v_thread1Thread1of1ForFork1_#t~mem1#1_44|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_43| |v_thread1Thread1of1ForFork1_minus_~b#1_61|) |v_thread1Thread1of1ForFork1_minus_~a#1_61|) (<= v_~result_7~0_80 2147483647)) InVars {~o_2~0.offset=v_~o_2~0.offset_55, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_74|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_44|} OutVars{~o_2~0.offset=v_~o_2~0.offset_55, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_41|, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_55|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_23|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_33|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_43|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_39|, ~result_7~0=v_~result_7~0_80, ~o_2~0.base=v_~o_2~0.base_55, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_43|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~mem2#1, ~result_7~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:49,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1214] $Ultimate##0-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork2_~stop~1#1_Out_14| v_~isNull_5~0_In_6) (= v_~result_10~0_Out_32 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread2Thread1of1ForFork2_~i~1#1_Out_14| 0) (= (ite (= (mod v_~isNull_3~0_In_6 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|)) InVars {~isNull_5~0=v_~isNull_5~0_In_6, ~isNull_3~0=v_~isNull_3~0_In_6} OutVars{~isNull_3~0=v_~isNull_3~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_22|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_Out_14|, ~isNull_5~0=v_~isNull_5~0_In_6, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|, thread2Thread1of1ForFork2_~stop~1#1=|v_thread2Thread1of1ForFork2_~stop~1#1_Out_14|, ~result_10~0=v_~result_10~0_Out_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~stop~1#1, ~result_10~0] and [1205] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_Out_14| 0) (= v_~result_7~0_Out_24 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= (ite (= (mod v_~isNull_1~0_In_1 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread1Thread1of1ForFork1_~stop~0#1_Out_16| v_~isNull_3~0_In_4)) InVars {~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1} OutVars{~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_7~0=v_~result_7~0_Out_24, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_7~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:05:49,187 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:05:49,384 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:05:49,385 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 23 out of bounds for length 23 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) 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:05:49,388 INFO L158 Benchmark]: Toolchain (without parser) took 82853.72ms. Allocated memory was 177.2MB in the beginning and 1.2GB in the end (delta: 974.1MB). Free memory was 152.8MB in the beginning and 548.3MB in the end (delta: -395.5MB). Peak memory consumption was 870.7MB. Max. memory is 8.0GB. [2022-12-06 05:05:49,388 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:05:49,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.40ms. Allocated memory is still 177.2MB. Free memory was 152.8MB in the beginning and 140.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:05:49,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.37ms. Allocated memory is still 177.2MB. Free memory was 140.7MB in the beginning and 138.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:49,388 INFO L158 Benchmark]: Boogie Preprocessor took 52.26ms. Allocated memory is still 177.2MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:49,389 INFO L158 Benchmark]: RCFGBuilder took 653.17ms. Allocated memory is still 177.2MB. Free memory was 136.0MB in the beginning and 111.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:49,389 INFO L158 Benchmark]: TraceAbstraction took 81784.78ms. Allocated memory was 177.2MB in the beginning and 1.2GB in the end (delta: 974.1MB). Free memory was 111.3MB in the beginning and 548.3MB in the end (delta: -436.9MB). Peak memory consumption was 828.8MB. Max. memory is 8.0GB. [2022-12-06 05:05:49,390 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.40ms. Allocated memory is still 177.2MB. Free memory was 152.8MB in the beginning and 140.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.37ms. Allocated memory is still 177.2MB. Free memory was 140.7MB in the beginning and 138.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.26ms. Allocated memory is still 177.2MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 653.17ms. Allocated memory is still 177.2MB. Free memory was 136.0MB in the beginning and 111.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 81784.78ms. Allocated memory was 177.2MB in the beginning and 1.2GB in the end (delta: 974.1MB). Free memory was 111.3MB in the beginning and 548.3MB in the end (delta: -436.9MB). Peak memory consumption was 828.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 281 PlacesBefore, 34 PlacesAfterwards, 299 TransitionsBefore, 30 TransitionsAfterwards, 15390 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 123 TrivialYvCompositions, 124 ConcurrentYvCompositions, 22 ChoiceCompositions, 269 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 10113, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 0, independent unconditional: 10113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 0, independent unconditional: 10113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 0, independent unconditional: 10113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8953, independent: 8934, independent conditional: 0, independent unconditional: 8934, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8953, independent: 8934, independent conditional: 0, independent unconditional: 8934, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10136, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 8953, unknown conditional: 0, unknown unconditional: 8953] , Statistics on independence cache: Total cache size (in pairs): 18953, Positive cache size: 18934, Positive conditional cache size: 0, Positive unconditional cache size: 18934, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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, 31 PlacesBefore, 31 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 28, 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: 32, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 32, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 32, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 28, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 104, independent conditional: 16, independent unconditional: 88, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 104, independent conditional: 16, independent unconditional: 88, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 104, independent conditional: 16, independent unconditional: 88, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 86, independent conditional: 14, independent unconditional: 72, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 19, unknown conditional: 3, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 50, Positive conditional cache size: 2, Positive unconditional cache size: 48, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 46, independent conditional: 6, independent unconditional: 40, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 46, independent conditional: 6, independent unconditional: 40, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 46, independent conditional: 6, independent unconditional: 40, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 43, independent conditional: 6, independent unconditional: 37, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 46 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 117, independent conditional: 17, independent unconditional: 100, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 129, independent: 117, independent conditional: 17, independent unconditional: 100, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 117, independent conditional: 17, independent unconditional: 100, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, independent: 105, independent conditional: 17, independent unconditional: 88, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 49 PlacesBefore, 49 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 80, independent conditional: 26, independent unconditional: 54, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 80, independent conditional: 26, independent unconditional: 54, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 80, independent conditional: 26, independent unconditional: 54, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 80, independent conditional: 26, independent unconditional: 54, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, 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, 53 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 113, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 9, dependent conditional: 2, dependent unconditional: 7, 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: 113, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, 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, 55 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 48, independent conditional: 48, 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: 52, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 4, dependent conditional: 1, dependent unconditional: 3, 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: 52, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, 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, 53 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 116, independent conditional: 59, independent unconditional: 57, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 116, independent conditional: 59, independent unconditional: 57, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 116, independent conditional: 59, independent unconditional: 57, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 8, independent unconditional: 8, dependent: 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: 124, independent: 100, independent conditional: 51, independent unconditional: 49, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 16, unknown conditional: 8, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 86, Positive conditional cache size: 10, Positive unconditional cache size: 76, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 85 PlacesBefore, 84 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 109, Positive conditional cache size: 23, Positive unconditional cache size: 86, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 99 PlacesBefore, 98 PlacesAfterwards, 136 TransitionsBefore, 133 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 166, Positive conditional cache size: 50, Positive unconditional cache size: 116, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 23 out of bounds for length 23 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 23 out of bounds for length 23: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:05:49,425 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...